The Haruhi problem
In: Mathematics
what is the shortest string that contains all permutations of n objects? so suppose n is 3, the possible permutations are
abc, acb, bac, bca,cab,cba so a string with all permutations would be abcacbbacbcacabbca, but thats not the shortest, abcabacba also contains all, but is much shorter (the shortest I belive).
the problem is to find a general solution that gives the min for any number of letters
Latest Answers