- **Math**
(*https://www.mersenneforum.org/forumdisplay.php?f=8*)

- - **probability of finding a Mersenne prime**
(*https://www.mersenneforum.org/showthread.php?t=1561*)

probability of finding a Mersenne primeThe Status command of the Prime95 client outputs: "The chance that the exponent you are testing will yield a Mersenne prime is about 1 in 278494".
How is this probability (1 in 278494) calculated? |

Some of the math is discussed here:
[url]http://www.utm.edu/research/primes/mersenne/heuristic.html[/url] I'm not sure if this is the actual calculation that Prime95 uses. |

[QUOTE][i]Originally posted by GP2 [/i]
[B]Some of the math is discussed here: [url]http://www.utm.edu/research/primes/mersenne/heuristic.html[/url] I'm not sure if this is the actual calculation that Prime95 uses. [/B][/QUOTE] I don't believe it is. From [url]http://www.mersenne.org/math.htm[/url] "What are the chances that the Lucas-Lehmer test will find a new Mersenne prime number? A simple approach is to repeatedly apply the observation that the chance of finding a factor between 2X and 2X+1 is about 1/x. For example, you are testing 210000139-1 for which trial factoring has proved there are no factors less than 264. The chance that it is prime is the chance of no 65-bit factor * chance of no 66 bit factor * ... * chance of no 5000070 bit factor. That is: 64 65 5000069 -- * -- * ... * ------- 65 66 5000070 This simplifies to 64 / 5000070 or 1 in 78126. This simple approach isn't quite right. It would give a formula of how_far_factored divided by (exponent divided by 2). However, more rigorous work has shown the formula to be (how_far_factored-1) / (exponent times Euler's constant (0.577...)). In this case, 1 in 91623." Doing the calculation on both my computers, I come up with a rather close number using the formula with Euler's constant. |

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

Powered by vBulletin® Version 3.8.11

Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.