7 Jan
2017
7 Jan
'17
12:18 p.m.
in the range 991 < p < 10^175 the only base 10 permutable primes are repunit primes
I'll copy/paste from Arkadii Slinko's "Absolute Primes" (year?):
Apparently there was a preprint of Arkadii's "lecture to math olympiad students" on the Net in 2002. Also note that my quoted range for primes (which came from planetmath.org) is wrong. The bound 6*10^175 is not for the prime itself but for its number of digits! Slinko stated that Richert mentioned "that by using the tables of primes and their primitive roots up to 10^5, it is possible to show that n > 6*10^175". Did Richert actually show it? I don't read it that way. Rather, only that it was possible to show it. So who, if anyone, since 1951 *has* shown it?