
Glossary: Prime Pages: Top 5000: 
Every prime number, when written in base ten, has one of the following primes as a substring (defined below):
2, 3, 5, 7, 11, 19, 41, 61, 89, 409, 449, 499, 881, 991, 6469, 6949, 9001, 9049, 9649, 9949, 60649, 666649, 946669, 60000049, 66000049, 66600049These are the minimal primes. Below we will explain this more fully, list the minimal composites, and offer a few problems for you to solve. In 1996, Jeffrey Shallit [Shallit96] suggested that we view prime numbers (when written in radix 10) as strings of digits. He then used concepts from formal language theory to define an interesting set of primes called the minimal primes:
For example, if our set is the set of prime numbers (written in radix 10), then we get the set of minimal primes listed above. If we take the set of composite numbers (again in base 10) we get the minimal set: 4, 6, 8, 9, 10, 12, 15, 20, 21, 22, 25, 27, 30, 32, 33, 35, 50, 51, 52, 55, 57, 70 72, 75, 77, 111, 117, 171, 371, 711, 713, 731.Shallit conjectures the minimal set for the powers of 2 (in radix 10) is 1, 2, 4, 8, 65536Shallit left as a challenge to his readers the task of finding minimal sets for the primes in other radices, and for all the other classical sets (Mersenne primes, Fermat primes, ...).
See Also: Repunit, LeftTruncatablePrime, RightTruncatablePrime, DeletablePrime, Primeval References:
Chris K. Caldwell © 19992014 (all rights reserved)
