Beefy Boxes and Bandwidth Generously Provided by pair Networks Joe
The stupid question is the question not asked
 
PerlMonks  

Re^2: Rotationally Prime Numbers Revisited

by tall_man (Parson)
on Mar 24, 2005 at 19:11 UTC ( [id://442230]=note: print w/replies, xml ) Need Help??

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


in reply to Re: Rotationally Prime Numbers Revisited
in thread Rotationally Prime Numbers Revisited

According to the Mathews page, all repunit primes (primes consisting of the digit "1" only) are rotational primes -- and that there are conjectured to be an infinite number of them.

If so, there are an infinite number of (trivial) repunit rotational primes, but there may not be any more nontrivial ones.

  • Comment on Re^2: Rotationally Prime Numbers Revisited

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://442230]
help
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    hippoepoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.