20110222, 09:20  #1 
2·3,347 Posts 
Assorted formulas for exponents of Mersenne primes
I have found a 39digit exponent (which obviously cannot be revealed to any member of the public) but because of the 10digit integer float of Prime95, it is not recognized as a prime number and hence i cannot submit. I have also found a Mersenne Prime generating function as well. Please reply to me so that i can submit my findings.
Thank you so much. 
20110222, 09:26  #2 
Feb 2011
Singapore
35_{10} Posts 
39 Digit exponent that could not be submitted.....
I have found a 39digit exponent but i cannot submit it in Prime95 because of the 10 digit integer floating limitation which causes it to be recognized as a nonprime. I have also found a Mersenne Prime generating function, which i am sure you would be interested to know.
I hope you can reply to me via email or any other means ASAP. Thanks. 
20110222, 09:31  #3 
Feb 2011
Singapore
100011_{2} Posts 
Does this program support exponents more than 10 digits? I have found an exponent that is 39 digits long. I have also found out a Mersenne prime generating formula.

20110222, 11:08  #4  
Banned
"Luigi"
Aug 2002
Team Italia
2^{2}×7×173 Posts 
Quote:
Luigi 

20110222, 13:21  #5  
"Forget I exist"
Jul 2009
Dumbassville
2^{6}·131 Posts 
Quote:


20110222, 13:25  #6  
Nov 2003
7460_{10} Posts 
Quote:


20110222, 13:36  #7 
"Forget I exist"
Jul 2009
Dumbassville
8384_{10} Posts 

20110222, 17:03  #8  
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
2^{2}·3·877 Posts 
Quote:
Also, if you have found a prime that is very large, can you please at least tell us the following:
Last fiddled with by Uncwilly on 20110222 at 17:49 Reason: spelling 

20110222, 17:29  #9  
"Forget I exist"
Jul 2009
Dumbassville
2^{6}·131 Posts 
Quote:


20110222, 23:26  #10  
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
7·13·47 Posts 
[nitpick ahead]
Quote:
Using currently known methods, a Mersenne number with a 39 digit exponent can not be known to be prime. Besides Prime95's limitation, it would take years. Hundreds of years on the best computer you could find, at minimum. You could have a ~25% chance of proving it composite fairly easily, by TFing, and of course any Mersenne number with a composite exponent is trivially composite, but proving primality is far harder. Last fiddled with by MiniGeek on 20110222 at 23:28 

20110222, 23:50  #11  
Aug 2006
3×1,993 Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
SophieGermain primes as Mersenne exponents  ProximaCentauri  Miscellaneous Math  15  20141225 14:26 
compendium of formulas related with primes ?  skan  Miscellaneous Math  6  20121214 12:56 
recurrent formulas to obtain primes  Unregistered  Information & Answers  2  20110114 17:19 
Mersenne Wiki: Improving the mersenne primes web site by FOSS methods  optim  PrimeNet  13  20040709 13:51 
Smooth polynomial formulas to produce all primes  Cyclamen Persicum  Math  10  20030329 07:08 