![]() |
![]() |
#1 |
2·13·179 Posts |
![]()
I have found a 39-digit exponent (which obviously cannot be revealed to any member of the public) but because of the 10-digit 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. |
![]() |
![]() |
#2 |
Feb 2011
Singapore
5·7 Posts |
![]()
I have found a 39-digit exponent but i cannot submit it in Prime95 because of the 10 digit integer floating limitation which causes it to be recognized as a non-prime. 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. |
![]() |
![]() |
![]() |
#3 |
Feb 2011
Singapore
5×7 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.
|
![]() |
![]() |
![]() |
#4 | |
Banned
"Luigi"
Aug 2002
Team Italia
3×5×17×19 Posts |
![]() Quote:
Luigi |
|
![]() |
![]() |
![]() |
#5 | |
"Forget I exist"
Jul 2009
Dumbassville
26·131 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#6 | |
"Bob Silverman"
Nov 2003
North of Boston
22·5·373 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#7 |
"Forget I exist"
Jul 2009
Dumbassville
26·131 Posts |
![]() |
![]() |
![]() |
![]() |
#8 | |
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
10,607 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 2011-02-22 at 17:49 Reason: spelling |
|
![]() |
![]() |
![]() |
#9 | |
"Forget I exist"
Jul 2009
Dumbassville
26×131 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#10 | |
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
2·3·23·31 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 Mini-Geek on 2011-02-22 at 23:28 |
|
![]() |
![]() |
![]() |
#11 | |
Aug 2006
3×1,993 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Sophie-Germain primes as Mersenne exponents | ProximaCentauri | Miscellaneous Math | 15 | 2014-12-25 14:26 |
compendium of formulas related with primes ? | skan | Miscellaneous Math | 6 | 2012-12-14 12:56 |
recurrent formulas to obtain primes | Unregistered | Information & Answers | 2 | 2011-01-14 17:19 |
Mersenne Wiki: Improving the mersenne primes web site by FOSS methods | optim | PrimeNet | 13 | 2004-07-09 13:51 |
Smooth polynomial formulas to produce all primes | Cyclamen Persicum | Math | 10 | 2003-03-29 07:08 |