The real solution to MB needing at least one thing on its public id
Interview Vampire Daily
Claire Keane
sheepfilms
Doug Jones
$LAYYYTER
KIROKAZE

Discoholic 🪩

No title available
cherry valley forever

Game Changer & Make Some Noise
No title available
Xuebing Du

Andulka
Cosmic Funnies
NASA
Game of Thrones Daily
Mike Driver
2025 on Tumblr: Trends That Defined the Year
almost home
★
seen from Chile
seen from United States
seen from Germany
seen from United Kingdom
seen from Bangladesh
seen from Azerbaijan

seen from Singapore
seen from T1
seen from Algeria

seen from Netherlands
seen from Germany

seen from Türkiye

seen from Ireland
seen from Ecuador
seen from Ukraine

seen from Canada

seen from Ecuador
seen from United States
seen from United Kingdom
seen from Poland
@mornyavie
The real solution to MB needing at least one thing on its public id
fuck everything. whats the media people ASSUME youre into. what are people surprised that you havent watched/played/whatever
of his [aldarion’s] first journey little is known, save that he made the friendship of círdan and gil-galad
What’s been the hardest advice for you to swallow? Ever?
If you are correct and annoying, nobody will listen.
Like it does not matter how correct you are, or how beautiful your coherence of thought may be. If you're annoying, people will spend their time and energy elsewhere
You wake up one day and discover you've lost control over a random action or feeling!
Spin the wheel to find out what!
How bad is it?
Actually way better than before!
Its good
It's alright
It's annoying but I'll be fine
It's pretty bad
IM DEAD
worse than death
Nothing changes/results
This idea was submitted by @dbnekonico!
Yeah I think most people do
I wont lie folks its not the result we were hoping for .
stop antagonizing dinner.
the histories will tell of a meeting in the gardens
Yeesh. 4.5” of rain the last 24 hours.
4.5'' of mature content
So this turned into a bug hunt and I’m happy to report we found a years old bug where a post created on iOS that got restored from a saved draft would incorrectly get marked as mature.
[] != nil
iOS only.
'Spurious signals from the kitchen' is harder for an optical telescope than a radio one, but with enough determination and creativity, I believe it's possible.
Vera Rubin Observatory [Explained]
Transcript Under the Cut
in college back in 2018 i still didn't have a smart phone yet and they introduced DUO two-factor authentication and I carried one of the physical "clickers" because I couldn't use the phone app. I remember classmates being unable to participate in class or print assignments at the library even with school desktop computers because they left their phones ate home by accident or their phones died so they couldn't login to their school profiles.
professors started doing those kahoots quiz games for attendance points and I told them I couldn't participate because I didn't have a smart phone.
one of my professors scoffed in front of the whole class and said, "are you serious?" i said "are you going to pay for my data plan?"
he relented because he had to and every single day he had to print out a little physical quiz for me to take while everyone else did kahoots. it was so funny bc it was a lecture hall with like 150 students. he gave up after like 3 times and just counted me present.
at work i refuse to have a single work-related app on a phone they aren't paying for so they always have to order me the physical "clickers" for double authentication and they act like I'm pouring concrete in their shoes about it lmaoo
at one job for a state forest my office was in the middle of nowhere with no wifi and no landline and they were like "we'll need to call you throughout the day about project updates" and i said "well then you'll need to install a phone because i don't have cell service out here" and they looked at me like it was somehow my fault. they asked me to change cell phone carriers.
EXTREMELY specific request :p
I'm working on a personal website* and I think it would be really cute to have a little looping animated gif of, like, bees or other insects flying across the footer. for plant reasons.
have any of you seen in the wild something that might fit the bill? People share various website "assets" here and on neocities all the time, so I figure it's worth asking.
*you can dm me for the address if you're curious, though I may choose not to share it with you if I don't know you well, just for privacy reasons
5001 being divisible by 3 doesnt feel right
Shortcuts to determine if an integer is divisible by:
This is a given.
If the last digit is divisible by 2 (a.k.a. even), then so is the whole number.
If the sum of the digits is divisible by 3, then so is the whole number. The recursivity of this means that if the sum has multiple digits, you can add them up again until you get a single digit and see if it's 3, 6, or 9.
Like the rule for 2, but check if the last two digits are divisible by 4.
If it ends in 5 or 0.
If the rules for both 2 and 3 apply.
No shortcut. Alas.
Like the rules for 2 and 4, but check if the last three digits are divisible by 8. (Yes, this pattern keeps going for 16, 32, etc.)
Like the rule for 3, but the sum of the digits (or the sum of the sum of the digits, etc.) must be 9.
If it ends in 0.
#THIS POST IS WRONG 7 DOES HAVE A RULE FOR HOW TO TELL IF THE NUMBER IS DIVISIBLE#it's just. not a short cut#you're better off dividing it and seeing if you get a whole number than doing the method
but what IS the rule @anqelbean ???
Okay, so, basically, you remove the least important digit of the number (which is the first digit from the right), you double it, and then subtract it from the remaining number. If the number you get is still large, you do it again.
For example, 294
29 4
4×2=8
29-8=21
21 is divisible by 7
Second example, 1946
194 6
6×2=12
194-12=182
182 is still large, so let do it again
18 2
2×2=4
18-4=14
14 is divisible by 7
#???!?? I need to math out that 7 trick how does that work
Ooh yeah, fascinating, much more roundabout than the 3 example but straightforward to map out. Here's an example with a 3-digit number, but you can keep going as long as you want by just replacing the bigger digits with a single integer times 10.
Ok, so math-wise, if we want to say "X is divisible by 7," we can equivalently say "X is equal to 7 times an integer."
If we have a number that we write out as ABC, that's equivalent to
100*A + 10*B + C
hundreds place, tens place, single.
Now, the trick described above is to take
(10*A + B) - 2C
double the single digit and subtract it from the remaining digits.
Let's say this is divisible by 7; it's equal to 7 times some integer N.
(10A + B) - 2C = 7N
The easiest way to proceed is to notice that we can also write our original number as
10*(10*A + B) + C
so rearrange the above equation to make
(10A + B) = 7N + 2C
insert it into our original number
10*(7N + 2C) + C
and expand to find
70N + 20C + C = 70N + 21C
Both 70 and 21 are divisible by 7, so this is
70N + 21C = 7(10N + 3C)
which proves that our original number was divisible by 7.
Incidentally this means that this also works “in reverse” for 3
A - 2B = 3N
10(3N + 2B) + B = 30N + 21B = 3(10N + 7B)
and a slightly different version, multiplying by 8 instead of 2, works for 9
A - 8B = 9N
10(9N + 8B) + B = 90N + 81B = 9(10N + 9B)
In fact, I think that you can do this with any number which has a multiple ending in 1, such that 10*N + 1 is a multiple of the number. For instance
A - 12B = 11N
10(11N +12B) + B = 110N + 121B = 11(10N + 11B)
or the extremely impractical
A - 90B = 13N
10(13N + 90B) + B = 13(10N + 7B)
(which also gives you another "magic number" for 7!)
and you ought to be able to pull similar highjinx in different bases, and with more complex multiples if you set it up carefully. There must be a name for this principle… But I can’t figure out what to search to return it. If anyone knows let me know!
For the asks! 14.
14. what's a hobby you'd like to get into?
...I don't actually know! I'm already "into" most of my hobbies. The secret is that no one can stop you.
Hmm, I'd really like to rock-climb more! It's super fun and I would enjoy being good at it. But the time and money has never been something I prioritize over other hobbies.
ask game for aging tumblr population
what's your favourite kitchen appliance?
do you have a collection of anything?
what's the best job you've ever had?
what's the worst job you've ever had?
what's your favourite piece of furniture and where did you get it?
what's your go-to recipe when you want to make something that requires minimal effort?
are you married or do you intend to get married?
do you have kids? do you want them?
are you on good terms with your parents?
do you have siblings? do you hang out with them?
do you vote?
what's the biggest purchase you've ever made?
what are your hobbies?
what's a hobby you'd like to get into?
do you collect anything?
how long have you known your oldest friend?
are you a member of any clubs or associations?
have you ever changed fields in your career or education?
how many wisdom teeth do you have and have you had any removed?
what's your favourite beverage?
do you have any living grandparents?
do you have nieces/nephews/godchildren/other kids in your life that aren't yours?
what's the coolest place you've visited?
what's your most recent degree and has it been useful to you?
would you rather own a dishwasher or a laundry machine if you could only have one or the other?
do you make a list before going to the grocery store or just wing it?
what's your favourite household chore?
what chore do you hate the most?
do you have houseplants and how are you at keeping them alive?
what's your living arrangement? (who do you live with, in what kind of building, do you own or rent or other?)
Ooh, send me asks, get return asks! I've got a boring day in the office tomorrow, this might just help take the edge off!
Another model I've had done for a while, a Realmgate. The "pale stone" look here has served me well for quite a lot of my terrain.
5001 being divisible by 3 doesnt feel right
Shortcuts to determine if an integer is divisible by:
This is a given.
If the last digit is divisible by 2 (a.k.a. even), then so is the whole number.
If the sum of the digits is divisible by 3, then so is the whole number. The recursivity of this means that if the sum has multiple digits, you can add them up again until you get a single digit and see if it's 3, 6, or 9.
Like the rule for 2, but check if the last two digits are divisible by 4.
If it ends in 5 or 0.
If the rules for both 2 and 3 apply.
No shortcut. Alas.
Like the rules for 2 and 4, but check if the last three digits are divisible by 8. (Yes, this pattern keeps going for 16, 32, etc.)
Like the rule for 3, but the sum of the digits (or the sum of the sum of the digits, etc.) must be 9.
If it ends in 0.
#THIS POST IS WRONG 7 DOES HAVE A RULE FOR HOW TO TELL IF THE NUMBER IS DIVISIBLE#it's just. not a short cut#you're better off dividing it and seeing if you get a whole number than doing the method
but what IS the rule @anqelbean ???
Okay, so, basically, you remove the least important digit of the number (which is the first digit from the right), you double it, and then subtract it from the remaining number. If the number you get is still large, you do it again.
For example, 294
29 4
4×2=8
29-8=21
21 is divisible by 7
Second example, 1946
194 6
6×2=12
194-12=182
182 is still large, so let do it again
18 2
2×2=4
18-4=14
14 is divisible by 7
#???!?? I need to math out that 7 trick how does that work
Ooh yeah, fascinating, much more roundabout than the 3 example but straightforward to map out. Here's an example with a 3-digit number, but you can keep going as long as you want by just replacing the bigger digits with a single integer times 10.
Ok, so math-wise, if we want to say "X is divisible by 7," we can equivalently say "X is equal to 7 times an integer."
If we have a number that we write out as ABC, that's equivalent to
100*A + 10*B + C
hundreds place, tens place, single.
Now, the trick described above is to take
(10*A + B) - 2C
double the single digit and subtract it from the remaining digits.
Let's say this is divisible by 7; it's equal to 7 times some integer N.
(10A + B) - 2C = 7N
The easiest way to proceed is to notice that we can also write our original number as
10*(10*A + B) + C
so rearrange the above equation to make
(10A + B) = 7N + 2C
insert it into our original number
10*(7N + 2C) + C
and expand to find
70N + 20C + C = 70N + 21C
Both 70 and 21 are divisible by 7, so this is
70N + 21C = 7(10N + 3C)
which proves that our original number was divisible by 7.
5001 being divisible by 3 doesnt feel right
Shortcuts to determine if an integer is divisible by:
This is a given.
If the last digit is divisible by 2 (a.k.a. even), then so is the whole number.
If the sum of the digits is divisible by 3, then so is the whole number. The recursivity of this means that if the sum has multiple digits, you can add them up again until you get a single digit and see if it's 3, 6, or 9.
Like the rule for 2, but check if the last two digits are divisible by 4.
If it ends in 5 or 0.
If the rules for both 2 and 3 apply.
No shortcut. Alas.
Like the rules for 2 and 4, but check if the last three digits are divisible by 8. (Yes, this pattern keeps going for 16, 32, etc.)
Like the rule for 3, but the sum of the digits (or the sum of the sum of the digits, etc.) must be 9.
If it ends in 0.
#THIS POST IS WRONG 7 DOES HAVE A RULE FOR HOW TO TELL IF THE NUMBER IS DIVISIBLE#it's just. not a short cut#you're better off dividing it and seeing if you get a whole number than doing the method
but what IS the rule @anqelbean ???
Okay, so, basically, you remove the least important digit of the number (which is the first digit from the right), you double it, and then subtract it from the remaining number. If the number you get is still large, you do it again.
For example, 294
29 4
4×2=8
29-8=21
21 is divisible by 7
Second example, 1946
194 6
6×2=12
194-12=182
182 is still large, so let do it again
18 2
2×2=4
18-4=14
14 is divisible by 7