Greentext

4591 readers

1084 users here now

This is a place to share greentexts and witness the confounding life of Anon. If you're new to the Greentext community, think of it as a sort of zoo with Anon as the main attraction.

Be warned:

Anon is often crazy.
Anon is often depressed.
Anon frequently shares thoughts that are immature, offensive, or incomprehensible.

If you find yourself getting angry (or god forbid, agreeing) with something Anon has said, you might be doing it wrong.

founded 1 year ago

MODERATORS

Early_To_Risa@sh.itjust.works

Anon goes on a date (sh.itjust.works)

submitted 1 year ago by Early_To_Risa@sh.itjust.works to c/greentext@sh.itjust.works

13 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[–] starman2112@sh.itjust.works 1 points 1 year ago (2 children)

There is the Haruhi Problem, which proved a lower bound on superpermutations of sets n>5

https://en.m.wikipedia.org/wiki/Superpermutation

[–] Klear@lemmy.world 2 points 1 year ago

In reference to the Japanese anime series The Melancholy of Haruhi Suzumiya, the problem was presented on the imageboard as "The Haruhi Problem": if you wanted to watch the 14 episodes of the first season of the series in every possible order, what would be the shortest string of episodes you would need to watch?

Holy fuck that's amazing.

[–] SpaceNoodle@lemmy.world 1 points 1 year ago

Wow! I stand corrected.