20180127, 22:04  #12  
Aug 2006
3×19×103 Posts 
Quote:


20180127, 22:14  #13 
"Forget I exist"
Jul 2009
Dumbassville
2^{6}×131 Posts 

20180131, 23:32  #14 
"Forget I exist"
Jul 2009
Dumbassville
2^{6}·131 Posts 
Superpermutations
Still can't believe the lowest number of instruction needed to have all permutations of n instructions present in a code isn't well known. 
20180201, 03:29  #15  
Aug 2006
3×19×103 Posts 
Quote:


20180201, 22:02  #16  
"Forget I exist"
Jul 2009
Dumbassville
2^{6}×131 Posts 
Quote:


20180201, 22:26  #17  
Aug 2006
3·19·103 Posts 
Quote:
\[n^{n! + (n1)! + (n2)! + n3}\] possibilities to check in the best case, it's hard to reduce the options to something reasonable. Googol to the sixth power and all that. 

20180201, 23:28  #18 
"Forget I exist"
Jul 2009
Dumbassville
8384_{10} Posts 
I do see ways to cut down the number to search. Because, you can use symmetries picking (a,b) and (b',a') where apostrophies mean reversed permutations, will not change much at the same length, it can in theory reverse the superpermutation.
Last fiddled with by science_man_88 on 20180201 at 23:46 
20180202, 02:38  #19  
Aug 2006
1011011101111_{2} Posts 
Quote:
\[n^{n! + (n1)! + (n2)! + n3}/2.\] You can do better: reassign the variables so the first one you use is 1, the first one you use other than that is 2, and so on. This cuts it to about \[n^{n! + (n1)! + (n2)! + n3}/n! \approx n^{n! + (n1)! + (n2)!  3}.\] But these numbers are huge, we need to do much, much better. 

20180202, 03:25  #20  
"Forget I exist"
Jul 2009
Dumbassville
20C0_{16} Posts 
Quote:
Last fiddled with by science_man_88 on 20180202 at 03:34 

20180203, 18:49  #21 
"Forget I exist"
Jul 2009
Dumbassville
2^{6}·131 Posts 
At least we can use derangement math to show as n gets larger about 37% of orderings will have at least 1 permutaion placed correctly.

20180204, 03:23  #22 
"Forget I exist"
Jul 2009
Dumbassville
2^{6}·131 Posts 
. Not sure it wouldn't be solved already, I found a solution for the equation for n=14 just take the coeffcients on 1001 to add to 391 Mod 432 and the coefficient on 432 is 906 mod 1001.
Last fiddled with by science_man_88 on 20180204 at 03:34 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Post 200000  Raman  Lounge  19  20161007 06:17 
Where to post job ad?  xilman  Linux  2  20101215 16:39 
Post numbers  what now?  henryzz  Forum Feedback  26  20081224 14:21 
Can't post to other forums  Unregistered  Forum Feedback  27  20070404 04:56 
Something that I just had to post/buy  dave_0273  Lounge  1  20050227 18:36 