View Single Post
Old 2018-02-01, 03:29   #15
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

72×112 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
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.
True, but the bounds are pretty tight: n! + (n-1)! + (n-2)! + n-3 <= A180632(n) <= n! + (n-1)! + ... + 2! + 1!.
CRGreathouse is online now