Syntactic Confectionery Delight  
PerlMonks 
Re (tilly) 1: Rotationally Prime Numbersby tilly (Archbishop) 
on Feb 01, 2002 at 04:00 UTC ( #142591=note: print w/replies, xml )  Need Help?? 
A minor number theory note. Based on some back of the envelope estimates, there should be only a finite number of rotational primes in base 10. (I haven't doublechecked my estimates closely, but I find it suggestive that you have 4 of size 1, and none of size 7.) However my estimates suggesting this were based on the standard, "Treat is_prime(n) as a random number with probability 1/log(n) of being true." This is a simple rule of thumb which leads to a lot of estimates in number theory, most of which are strongly supported by the numerical evidence. (For instance the prime number theorem is true, the Riemann Hypothesis should be, the twin prime conjecture should be, Mertens Conjecture should be false but the numerical evidence will make it look true for an absurdly long time, etc.) Unfortunately it is a rule of thumb that is absolutely and horribly wrong, with the result that number theory is full of gloriously precise conjectures on primes which have very strong affirmative evidence, but which are not readily amenable to proof. UPDATE: As I point out at Re^2: Rotationally Prime Numbers Revisited, I think this post is wrong. (I forgot about numbers that are just strings of 1s.)
In Section
Cool Uses for Perl

