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 places, expressing them without having to show all of their digits, and even proving their primality.
Mathematica has, I recently discovered, a RandomPrime function that can be configured to generate primes with a specific number of digits. By repeated application of such and checking each one 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 was very helpful in doing just that, mostly without my input.
No comments:
Post a Comment