![]() |
Fully factored
Is there a "fully TF'd" list of exponents on mersenne.ca?
|
Define "fully TF'ed". Do you mean fully factored?
|
Yes, fully factored
|
This would be an interesting list to see.
I suspect there are very few large exponents on the list -- finding one 60- or 70-bit factor of a million-digit number leaves a very large nut to crack. |
Check the top-5000 primes page for mersenne cofactors.
I assume there is a prp version of that page too with larger cofactors too big for ECPP just yet- perhaps someone could aim me the right direction? |
A superset of the PRPs is [URL="http://www.primenumbers.net/prptop/searchform.php?form=%282%5Ep-1%29%2F%3F&action=Search"]here[/URL].
There are some (2[SUP]ap[/SUP]-1)/(2[SUP]a[/SUP]-1)/f as you can see. If you replace "?" with "f", then you could miss some cofactors that were submitted like (2[SUP]p[/SUP]-1)/f[SUB]1[/SUB]/f[SUB]2[/SUB] |
Yes: [URL="http://primes.utm.edu/top20/page.php?id=49"]top 20[/URL] Mersenne cofactors (proven).
There are some outstanding ones less than Primo's 35k digit limit. Here the reported [URL="http://www.primenumbers.net/prptop/searchform.php?form=%282^p-1%29%2Fn&action=Search"]gigantic PRPs[/URL] -- I dare say Henri's list is out of date, in that some PRPs are proven primes. I am currently proving a ~15k digit [URL="http://www.mersenneforum.org/showpost.php?p=449729&postcount=282"]Mersenne cofactor[/URL] -- ETA less than a month form now. |
[QUOTE=paulunderwood;452477]Here the reported [URL="http://www.primenumbers.net/prptop/searchform.php?form=%282^p-1%29%2Fn&action=Search"]gigantic PRPs[/URL] -- I dare say Henri's list is out of date, in that some PRPs are proven primes.[/QUOTE]
It also has the problem that the formats of the entries are not normalized, but are simply stored however they were reported. For example M1790743 does not appear in the link you gave because it is stored as (2^1790743-1)/(146840927*158358984977*3835546416767873*20752172271489035681) and therefore doesn't match the pattern (2^p-1)/n Similarly M4834891, M822971, M750151, M696343, M675977, M576551, M488441, M440399, M270059, M157457, M41681 are missing. All of these do appear when you click the "[URL="http://www.primenumbers.net/prptop/prptop.php"]The Full PRP Top[/URL]" (on the first page from 1 to 250, or subsequent pages). |
[QUOTE=mattmill30;452433]Is there a "fully TF'd" list of exponents on mersenne.ca?[/QUOTE]
Yes, here is [URL="http://www.mersenne.ca/prp.php"]the complete list[/URL]. There are currently 310 fully-factored or probably-fully-factored exponents, in addition to the Mersenne primes themselves which are certainly also fully factored. Only 63703 and smaller are certified and proven to be fully factored, the higher exponents have a probable-prime (PRP) cofactor, albeit with extremely high confidence. |
[QUOTE=GP2;452498]Yes, here is [URL="http://www.mersenne.ca/prp.php"]the complete list[/URL]. There are currently 310 fully-factored or probably-fully-factored exponents, in addition to the Mersenne primes themselves which are certainly also fully factored.
Only 63703 and smaller are certified and proven to be fully factored, the higher exponents have a probable-prime (PRP) cofactor, albeit with extremely high confidence.[/QUOTE]A lot of those PRP cofactors could be tested easily. We wonder why nobody has done that. :confused: |
[QUOTE=Xyzzy;452535]A lot of those PRP cofactors could be tested easily. We wonder why nobody has done that.[/QUOTE]
I imagine it's harder than you think. The record for Primo is [URL="http://www.ellipsa.eu/public/primo/top20.html"]34093 decimal digits, which took 14 months with 48 cores[/URL], plus 200 additional days with 6 cores, by none other than Paul Underwood. Based on that, M106391 (with a cofactor of 32010 decimal digits) is the largest Mersenne exponent that could feasibly be fully factored at the present time. The next smallest is M130439, with a cofactor of 39261 decimal digits. |
| All times are UTC. The time now is 00:35. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.