/sci/ - Science & Math

Episode orderings may overlap but must be contiguous
(12321 contains 123 and 321 but not 132).
Prove your answer.

>>5542934

<- This is still an open problem to my knowledge. Any fresh ideas on solving it?

Some previous work:
http://mathsci.wikia.com/wiki/The_Haruhi_Problem

Also, other interesting problems we might work on? Any progress on the solitary numbers stuff from
http://archive.installgentoo.net/sci/thread/S4808214
?

Specifically, every permutation must be a substring (not subsequence) of the list of episodes you watch. Permutations may overlap. If there were 3 episodes, 123121321 would be a solution.

Original problem is in the pic.

You have an n episode tv series. You want to watch the episodes in every order possible. What is the least number of episodes that you would have to watch?

Over lapping is allowed. For example, in the case of n=2, watching episode 1, then 2, then 1 again, would fit the criteria.

The orders must be continuous. For example, (1,2,1,3) does NOT contain the sequence (1,2,3)

Ok /sci/, it's me again. Essentially, you have an n episode series. How many episodes would you watch to see it in every possible order (permutation).

Ok /sci/,

You have a 14 episode series, and you wanna watch it in every order possible. E(n) is the least number of episodes watched to make this possible. For example, if n=3, E=9, because you could watch them in the order 1,2,3,1,2,1,3,2,1 to see all 6 permutations.