WEP-M+2 Project: Difference between revisions
Jump to navigation
Jump to search
initial edits |
→Scientific results: Wikipedia reference |
||
| Line 19: | Line 19: | ||
== Scientific results == | == Scientific results == | ||
* https://sites.google.com/site/bearnol/math/mersenneplustwo | * https://sites.google.com/site/bearnol/math/mersenneplustwo These results are referenced on Wikipedia here: https://en.wikipedia.org/wiki/Mersenne_conjectures#cite_ref-3 | ||
Revision as of 22:32, 4 February 2024
BOINC project page template
WEP-M+2 Project is a volunteer distributed computing project that uses BOINC for Mersenneplustwo integer factorization.
Why WEP-M+2 Project?
- Mersenneplustwo because they’re the most interesting mathematically, especially when it comes to integer factorization.
Goal
- Mersenneplustwo numbers are those integers that are two more than a Mersenne prime. Mersenne primes are of the form 2^p-1 http://www.mersenne.org/. This makes Mersenneplustwo numbers of the form 2^p+1.
- WEP-M+2 Project aims to find the factors (ie integer divisors) of Mersenneplustwo numbers.
Methods
- BOINC is sooooo cool. I originally setup a server on spec because I felt I wanted the extra cycles, and when I saw the first wu’s come in over the network even from just my own little local farm, let alone later all the external volunteers, I was hooked for the next 17 years… :)))
- The underlying algorithm is released open source at: https://github.com/bearnol/we
Project Administrator
James Wanless
Scientific results
- https://sites.google.com/site/bearnol/math/mersenneplustwo These results are referenced on Wikipedia here: https://en.wikipedia.org/wiki/Mersenne_conjectures#cite_ref-3