3 ms·
I wonder if the problem would be simpler if the superpermutation would be treated as a repeating (circular) sequence. I.e., what is the shortest sequence (havin
by layer8 3y ago
I wonder if the problem would be simpler if the superpermutation would be treated as a repeating (circular) sequence. I.e., what is the shortest sequence (having length n) such that if the episodes where shown in an endless repetition of that sequence, viewers could start at any episode and watch the next n + k episodes to catch all permutations. This would remove both ends of the superpermutation being a special case, so to speak.
(Cue comments about the Endless Eight.)