| 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"
(→Results) |
(links corr.) |
||
| Line 1: | Line 1: | ||
| − | The '''Mersenneplustwo factorizations''' is a [[distributed computing | + | The '''Mersenneplustwo factorizations''' is a [[distributed computing project]], which tries to [[factorization|factor]] numbers of the form: 2<sup>p</sup>+1 (with p being a prime, as well as simultaneously 2<sup>p</sup>-1 being prime). All such numbers are divisible by 3 since 2<sup>p</sup>-1 is not divisible by 3 (it's assumed to be prime) and 2<sup>p</sup> is not divisible by 3 (it's only prime factor is 2). |
| − | It is managed by James Wanless ( | + | It is managed by [[User:Bearnol|James Wanless (Bearnol)]]. |
==How to participate== | ==How to participate== | ||
| Line 10: | Line 10: | ||
==Results== | ==Results== | ||
| − | Best results so far include 37-digit factor of < | + | Best results so far include 37-digit factor of M<sub>9941</sub>+2 ({{FDBID|1000000000012159965}}) found by ECMNet, as well as 36-digit factor of M<sub>11213</sub>+2 ({{FDBID|1000000000012161237}}) found using ''mprime'' (the linux version of [[Prime95]] by [[George Woltman]]). |
| − | More recently, a 41-digit factor of < | + | |
| + | More recently, a 41-digit factor of M<sub>110503</sub>+2 ({{FDBID|1100000000017680993}}) was also found by ECMNet. | ||
==External links== | ==External links== | ||
Revision as of 09:21, 5 March 2019
The Mersenneplustwo factorizations is a distributed computing 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 M9941+2 (FDBid) found by ECMNet, as well as 36-digit factor of M11213+2 (FDBid) found using mprime (the linux version of Prime95 by George Woltman).
More recently, a 41-digit factor of M110503+2 (FDBid) was also found by ECMNet.
