WEP-M+2 Project: Difference between revisions

Line 1:

<div style="background-color: #D4E2FC; border-top: 1px solid #5F92F2; font-size: bigger; padding-left: 15px; margin: 12px -5px -5px -5px;">'''BOINC project page template'''</div>

[http://bearnol.is-a-geek.com/wanless2/ ~~'''''~~WEP-M+2 Project'''''] is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project that ~~uses~~ [https://boinc.berkeley.edu/ '''''BOINC'''''] ~~for~~ Mersenneplustwo integer factorization.

'''''[https://web.archive.org/web/20240118183120/http://bearnol.is-a-geek.com/wanless2/ WEP-M+2 Project]''''' is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project that used [https://boinc.berkeley.edu/ '''''BOINC'''''] to investigate Mersenneplustwo integer factorization.

== Why WEP-M+2 Project? ==

* Mersenneplustwo because they’re the most interesting mathematically, especially when it comes to integer factorization.

* Mersenneplustwo because they’re the most interesting mathematically, especially when it comes to '''''[[wikipedia:Integer_factorization|integer factorization]]'''''.

== Goal ==

Line 19:

== 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

* https://sites.google.com/site/bearnol/math/mersenneplustwo These results are referenced on Wikipedia here: [[wikipedia:Mersenne_conjectures#cite_ref-3 |Mersenne conjectures cite ref-3]]

@@ Line 1: / Line 1: @@
 <div style="background-color: #D4E2FC; border-top: 1px solid #5F92F2; font-size: bigger; padding-left: 15px; margin: 12px -5px -5px -5px;">'''BOINC project page template'''</div>
-[http://bearnol.is-a-geek.com/wanless2/ '''''WEP-M+2 Project'''''] is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project that uses [https://boinc.berkeley.edu/ '''''BOINC'''''] for Mersenneplustwo integer factorization.
+'''''[https://web.archive.org/web/20240118183120/http://bearnol.is-a-geek.com/wanless2/ WEP-M+2 Project]''''' is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project that used [https://boinc.berkeley.edu/ '''''BOINC'''''] to investigate Mersenneplustwo integer factorization.
 == Why WEP-M+2 Project? ==
-* Mersenneplustwo because they’re the most interesting mathematically, especially when it comes to integer factorization.
+* Mersenneplustwo because they’re the most interesting mathematically, especially when it comes to '''''[[wikipedia:Integer_factorization|integer factorization]]'''''.
 == Goal ==
@@ Line 19: / Line 19: @@
 == 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
+* https://sites.google.com/site/bearnol/math/mersenneplustwo  These results are referenced on Wikipedia here: [[wikipedia:Mersenne_conjectures#cite_ref-3 |Mersenne conjectures cite ref-3]]