Primeval number
Encyclopedia : P : PR : PRI : Primeval number
In mathematics, a primeval number is a natural number n for which the number of prime numbers which can be obtained by permuting all or some of its digits (in base 10) is larger than the number of primes obtainable in the same way for any smaller natural number. Primeval numbers were first described by Mike Keith.
The first few primeval numbers are 2, 13, 37, 107, 113, 137, 1013, 1037, 1079, 1237, 1367, ... (sequence in OEIS); the number of primes that can be obtained from the primeval numbers is 1, 3, 4, 5, 7, 11, 11, 19, 21, 26, 29, ... (sequence in OEIS). The number of primes that can be obtained from a primeval number with n digits is 1, 4, 11, 31, 106, ... (sequence in OEIS).
An example of how this works, matching the first five primeval numbers with the number of primes obtained is given:
| Primeval number | Primes obtained | Number of primes contained |
|---|---|---|
| (sequence in OEIS) | (ordered permutations) | (sequence in OEIS) |
| 2 | 2 | 1 |
| 13 | 3, 13, 31 | 3 |
| 37 | 3, 7, 37, 73 | 4 |
| 107 | 7, 17, 71, 107, 701 | 5 |
| 113 | 3, 11, 13, 31, 113, 131, 311 | 7 |
External links
From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.