Repost z 4szamba: https://boards.4chan.org/sci/thread/10089701
> The “Haruhi problem” –better known to mathematicians as the minimal superpermutation problem – was discussed here in 2011. https://mathsci.wikia.com/wiki/The_Haruhi_Problem
> Recently Greg Egan (yes the sf writer) made a major breakthrough with a new improved upper bound.
> http://www.gregegan.net/SCIENCE/Superpermutations/Superpermutations.html
> So the good news for Haruhi fans is that you now only need to watch 93,924,230,411 episodes to see them in every possible order.
> But we're in the interesting situation where more mathematicians are becoming interested in this problem, and the best-known lower bound was proved by an anon here, which is kind of awkward to cite. Plus for some reason not everyone thinks /sci/ is a reputable source. The proof is on the wikia page linked above.
> I don’t suppose the anon in question would be interested in writing a paper on it? If not then I guess someone else will, but it seems a shame for the person who came up with the idea not to get the credit (if they want it).