| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Mersenneplustwo factorizations"
(restored) |
(→Results) |
||
| Line 11: | Line 11: | ||
==Results== | ==Results== | ||
Best results so far include 37-digit factor of <math>M_{9941}{+2}</math> ({{FDBID|1000000000012159965}}) found by ECMNet, as well as 36-digit factor of <math>M_{11213}{+2}</math> ({{FDBID|1000000000012161237}}) found using ''mprime'' (the linux version of [[Prime95]] by [[George Woltman]]) | Best results so far include 37-digit factor of <math>M_{9941}{+2}</math> ({{FDBID|1000000000012159965}}) found by ECMNet, as well as 36-digit factor of <math>M_{11213}{+2}</math> ({{FDBID|1000000000012161237}}) found using ''mprime'' (the linux version of [[Prime95]] by [[George Woltman]]) | ||
| + | More recently, a 41-digit factor of <math>M_{110503}{+2}</math> was also found by ECMNet. | ||
==External links== | ==External links== | ||
Revision as of 15:13, 4 March 2019
The Mersenneplustwo factorizations is a project, which tries to factor numbers of the form: 2p+1 (with p being a prime, as well as simultaneously 2p-1 being prime). All such numbers are divisible by 3 since 2p-1 is not divisible by 3 (it's assumed to be prime) and 2p is not divisible by 3 (it's only prime factor is 2).
It is managed by James Wanless (bearnol).
Contents
[hide]How to participate
Participants use ECMclient to automatically download numbers, do ECM curves on them and upload them again.
Status
As of this moment (2005-09-12), about 8GHz is being dedicated to this project - more needed! :-)
Results
Best results so far include 37-digit factor of
