-   Software (
-   -   Odds (

Fred 2016-03-07 23:36

Could someone give a brief elementary level explanation of how Prime95 calculates the odds that one of the numbers someone is testing is prime? For example, under Test -> Status where it says the odds are 1 out of xxx,xxx.

I had thought the number of Mersenne primes was thought (proven) to be infinite. Is there a way of calculating (or estimating) how many there are in a given exponent range? Or perhaps are the odds give just based on past experience (number of exponents tested by gimps in relation to number of primes found by gimps)?

VBCurtis 2016-03-07 23:45

The most elementary answer: [url][/url]
The Prime Number Theorem. Consequence 3 specifically.

However, Prime95 takes into account the trial factoring effort that has been done; a candidate Mersenne that has passed TF to, say, 70 bit is much more likely to be prime than a candidate that nothing is known about. For that, you need a more complicated formula (one also presented elsewhere in this forum- I refer you to the search function, now that you have "prime number theorem" or "odds of prime" search terms).

Your question 2 is answered by the first solution- if one can calculate the chances each test comes back prime, one can easily find expected number of primes in a set of 1000 or 10000 (etc) tests. If a single test has 1/50000 chance to be prime, and I run 100000 such tests, I can expect two primes. Note that is NOT the odds of finding a prime in such a range- expectation and probability are separate but related calculations.

Fred 2016-03-08 01:54

Thanks! Great answer and very helpful.

axn 2016-03-08 02:38

[URL=""]The Math[/URL]

kladner 2016-03-08 03:05

[QUOTE=axn;428350][URL=""]The Math[/URL][/QUOTE]
Thanks! I still don't really understand the math, but I get a broad sense of the operations carried out.
One small step. No giant leaps here!

All times are UTC. The time now is 20:20.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.