Re: [math-fun] A generalization of an old Conway Problem

Base pandigital abcd... ab is divisible by 2 abc is divisible by 3 abcd is divisible by 4 abcde is divisible by 5 abcdef is divisible by 6 abcdefg is divisible by 7 abcdefgh is divisible by 8 abcdefghi is divisible by 9 abcdefghij is divisible by 10 abcdefghijk is divisible by 11 ... up to "... is divisible by base-1" I've just added base-37 to my A256112 < http://chesswanks.com/num/a256112.pdf > solutions list. I needed to borrow a letter from the Greek alphabet! Can someone explain why prime bases have so many more solutions than composite ones?