The Garbage Will Do

Nicole: writer, artist, eater of cake. Dating this lovely lady . A little bit of whatever I'm into right now, which spans anything from Lord of the Rings to Haikyuu!! Expect everything to be neatly tagged but otherwise absolutely chaotic.

[juiche]

Sometimes I do anatomy studies and the character suddenly has an automail arm :')

[belladonnabedlam]

Okay. I was on my beloved AO3 and I saw something that made me do a double take. So, now I really want to know…

What is your AO3 user ID?

I’m an OG user 5 digits or less

Six figures baby!

I’m in the millions…

Remaining time: 6 days 44 minutes

I’m so curious to see how long people have been on AO3! I know some people have been on there since beta/invite only, but I would love to see what the number is on tumblr!

[fadesense]

The Two of Cups

Upright: unity, partnership, attraction, connection, close bonds, mutual respect, love

For the Viperquin 2026 Exchange!

[an-ruraiocht]

which of these classical texts have you read?

the iliad, the odyssey, and the aeneid

the iliad and the odyssey, not the aeneid

the iliad only

the odyssey only

the aeneid only

the aeneid and the iliad, not the odyssey

the aeneid and the odyssey, not the iliad

I have read none of these

Remaining time: 1 day 21 hours

"what if I've read part of it" if it's a large enough part that you would consider yourself to Have Read It in general contexts, then it counts. if it's not, then it doesn't. only you can be the judge of that, but I'm not giving you a nuance button.

any translations count, but abridged retellings don't

obviously, there are lots of other classical texts out there. you might have read none of these and be an expert on greek tragedy. I'm not judging your classical knowledge so you don't need to tell me all that. I'm just curious about combos of these specific texts and their popularity, bc a post i just saw got me thinking about it

[theta-scenario]

People with low spoons, someone just recommended this cookbook to me, so I thought I'd pass it on.

I always look at cookbooks for people who have no energy/time to do elaborate meal preparations, and roll my eyes. Like, you want me to stay on my feet for long enough to prepare 15 different ingredients from scratch, and use 5 different pots and pans, when I have chronic fatigue and no dishwasher?

These people seem to get it, though. It's very simple in places. It's basically the cookbook for people who think, 'I'm really bored of those same five low-spoons meals I eat, but I can't think of anything else to cook that won't exhaust me'. And it's free!

The Sad Bastard Cookbook by tRaum Books

by Rachel A. Rosen and Zilla Novikov || Food you can make so you don't die.

[esseastri]

My fiancee made me lose the Game, so now you all have to lose it too.

[dajo42]

5001 being divisible by 3 doesnt feel right

[dajo42]

[shinyhappygoth]

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.

[noelements-setempty]

11. Put alternating + and - signs in front of each digit such that the last digit has a + sign (so for 5001 it's - 5 + 0 - 0 + 1). If the answer is divisible by 11, so is the original number. This is recursive like the 3 and 9 rules.

[unnatural-transformations]

7: Subtract twice the last digit of your number from the number you get by ignoring the last digit. If the result of that operation is divisible by 7, so is your original number (eg, 91 -> 9 - 2×1 = 7, so 91 is a multiple of 7). As with the rules for 3, 9 and 11 this rule is recursive (2261 -> 226 - 2×1 = 224; 224 -> 22 - 2×4 = 14; 14 -> 1 - 2×4 = -7 and so 2261 is divisible by 7).

It's not a fast way of checking if a number is a multiple of 7 (you honestly may as well just do the division), but it does work.

[asleepinawell]

[spaceshipsandpurpledrank]

This is just cute

[tartrazeen]

I love when people have fun 💖

This is one of those stories you talk about twenty years later

[mitrakats]

[raven] boys, come find me

prints of this r on my etsy and i’ll be bringing a few to share at Maggie’s sf event in august :’)

[spatulahat]

The Riker Maneuver in Technicolor

[sg1]

Stargate SG-1, 07.03 Fragile Balance

[mylittlehony]

The foal-shaped void had Feelings about the wind and the rain.

[tranthony]

grout white shark

[space-pics]

Moon Surface

[millionsknives]

trigun maximum / hadestown / typhoon, "prosthetic love"

[dealunart]

Testing out some pencil/charcoal brushes so here's a Kaladin sketch