Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re^5: Rotationally Prime Numbers Revisited

by tilly (Archbishop)
on Mar 25, 2005 at 19:33 UTC ( [id://442396]=note: print w/replies, xml ) Need Help??


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

While they may be more likely to be primes, I'm not convinced that the effect is that large. True, possible factors are restricted, but numbers in that set of possible factors are far, far more likely to be divisors than mere chance would predict. How do these balance out? It certainly isn't obvious to me.

Let's do some heuristics. the 38'th Mersenne prime is 2**6972593-1. Naively from the Prime Number theorem you'd expect to find an average of 22.12 primes in that sequence to that point. We actually got 38. So we got about 70% more primes than we were expecting to have. The limited results that we have for (10**p-1)/9 suggest a similar advantage.

Which is significant, but not astoundingly different than the naive approximation.

  • Comment on Re^5: 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://442396]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others perusing the Monastery: (3)
As of 2024-04-19 23:54 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found