Glad Hobo Express
Wednesday, April 15, 2026
Thursday, April 02, 2026
A random 5000-digit emirp pair
Print[DateString[]];
c=0;While[c++;
PrimeQ[IntegerReverse[r=RandomPrime[{10^4999,2*10^4999}]]]==False];
Print[{DateString[], c}]; r
Tue 24 Mar 2026 13:20:15
{Thu 2 Apr 2026 14:16:15, 1459}
IntegerReverse[r]
Click on either number to check its primality.
Monday, March 23, 2026
A random 2000-digit emirp pair
Print[DateString[]];
c=0; While[c++; PrimeQ[IntegerReverse[r=RandomPrime[{10^1999,2*10^1999}]]]==False];
Print[{DateString[], c}]; r
Mon 23 Mar 2026 16:19:04
{Mon 23 Mar 2026 18:37:09, 305}
IntegerReverse[r]
Click on either number to check its primality.
Saturday, March 21, 2026
A random large emirp pair
One might think from my previous post that large base-ten emirps congregate near — or at least involve — powers of ten. Well, record ones certainly do but that is surely an artifact of the convenience of searching for such integers in those locations, expressing them without having to show all of their digits, and even proving their primality.
I recently found that Mathematica has a RandomPrime function which can be configured to generate primes with a specific number of digits. By repeated application of it and checking each against the primality (most often lack-of-primality) of the integer created by reversing its decimal digits, I can now create random emirps.
While[PrimeQ[IntegerReverse[r = RandomPrime[{10^999, 10^1000}]]] == False]; r
The reverse of this is:
I did not think that I would be able to prove their primality, but factordb (click on either number to see its evaluation there) apparently has some "elves" who download the smallest probable primes in the database and run deterministic tests on them. I guess I got lucky.