Delicate prime
A delicate prime, digitally delicate prime, or weakly prime number is a prime number where, under a given radix but generally decimal, replacing any one of its digits with any other digit always results in a composite number.[1]
Definition
A prime number is called a digitally delicate prime number when, under a given radix but generally decimal, replacing any one of its digits with any other digit always results in a composite number.[1] A weakly prime base-b number with n digits must produce [math]\displaystyle{ (b - 1) \times n }[/math] composite numbers after every digit is individually changed to every other digit. There are infinitely many weakly prime numbers in any base. Furthermore, for any fixed base there is a positive proportion of such primes.[2]
History
In 1978, Murray S. Klamkin posed the question of whether these numbers existed. Paul Erdős proved that there exist an infinite number of "delicate primes" under any base.[1]
In 2007, Jens Kruse Andersen found the 1000-digit weakly prime [math]\displaystyle{ (17 \times 10^{1000} - 17) / 99 + 21686652 }[/math].[3] This is the largest known weakly prime number (As of 2011).
In 2011, Terence Tao proved in a 2011 paper, that delicate primes exist in a positive proportion for all bases.[4] Positive proportion here means as the primes get bigger, the distance between the delicate primes will be quite similar, thus not scarce among prime numbers.[1]
Widely digitally delicate primes
In 2021, Michael Filaseta of the University of South Carolina tried to find a delicate prime number such that when you add an infinite number of leading zeros to the prime number and change any one of its digits, including the leading zeros, it becomes composite. He called these numbers widely digitally delicate.[5] He with a student of his showed in the paper that there exist an infinite number of these numbers, although they could not produce a single example of this, having looked through 1 to 1 billion. They also proved that a positive proportion of primes are widely digitally delicate.[1]
Jon Grantham gave an explicit example of a 4032-digit widely digitally delicate prime.[6]
Examples
The smallest weakly prime base-b number for bases 2 through 10 are:[7]
| Base | In base | Decimal |
|---|---|---|
| 2 | 11111112 | 127 |
| 3 | 23 | 2 |
| 4 | 113114 | 373 |
| 5 | 3135 | 83 |
| 6 | 3341556 | 28151 |
| 7 | 4367 | 223 |
| 8 | 141038 | 6211 |
| 9 | 37389 | 2789 |
| 10 | 29400110 | 294001 |
In the decimal number system, the first weakly prime numbers are:
- 294001, 505447, 584141, 604171, 971767, 1062599, 1282529, 1524181, 2017963, 2474431, 2690201, 3085553, 3326489, 4393139 (sequence A050249 in the OEIS).
For the first of these, each of the 54 numbers 094001, 194001, 394001, ..., 294009 are composite.
References
- ↑ 1.0 1.1 1.2 1.3 1.4 Nadis, Steve (30 March 2021). "Mathematicians Find a New Class of Digitally Delicate Primes". https://www.quantamagazine.org/mathematicians-find-a-new-class-of-digitally-delicate-primes-20210330/.
- ↑ Terence Tao (2011). "A remark on primality testing and decimal expansions". Journal of the Australian Mathematical Society 91 (3): 405–413. doi:10.1017/S1446788712000043.
- ↑ Carlos Rivera. "Puzzle 17 – Weakly Primes". The Prime Puzzles & Problems Connection. http://www.primepuzzles.net/puzzles/puzz_017.htm.
- ↑ Tao, Terence (2010-04-18). "A remark on primality testing and decimal expansions". arXiv:0802.3361 [math.NT].
- ↑ Filaseta, Michael; Juillerat, Jacob (2021-01-21). "Consecutive primes which are widely digitally delicate". arXiv:2101.08898 [math.NT].
- ↑ Grantham, Jon (2022). "Finding a Widely Digitally Delicate Prime". arXiv:2109.03923 [math.NT].
- ↑ Les Reid. "Solution to Problem #12". Missouri State University's Problem Corner. http://people.missouristate.edu/lesreid/Soln12.html.
 |  |
