3 ms·
Napkin math (possibly with gross errors, and doing stats, so making the math rigid cannot lead to rigorous proof): A prime with N digits has 9N ‘neighbors’. T
by Someone 6y ago
Napkin math (possibly with gross errors, and doing stats, so making the math rigid cannot lead to rigorous proof):
A prime with N digits has 9N ‘neighbors’.
There are about 10^N/ln(10^N) - 10^(N-1)/ln(10^(N-1)) primes with N digits, so the probability of a N-digit number being prime is about 1/ln(10^N), of it not being prime 1-1/ln(10^N).
So, the question is about the behavior of (1-1/ln(10^N))^9N as N ⇒ ∞. Google gives me a plot that’s essentially zero, so yes, most primes should be digitally delicate.