| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "PrimeGrid"
(→Sub-projects) |
(→Sub-projects: Link to new page) |
||
| Line 10: | Line 10: | ||
*[[GCW Prime Search|Generalized Cullen/Woodall Prime Search]]: searching for primes of the form n×b<sup>n</sup>±1. | *[[GCW Prime Search|Generalized Cullen/Woodall Prime Search]]: searching for primes of the form n×b<sup>n</sup>±1. | ||
*[[Generalized Fermat number]] Search: searching for megaprimes of the form b<sup>2<sup>n</sup></sup>+1. | *[[Generalized Fermat number]] Search: searching for megaprimes of the form b<sup>2<sup>n</sup></sup>+1. | ||
| − | *Prime Sierpiński | + | *[[PrimeGrid Prime Sierpiński Problem|Prime Sierpiński problem]]: helping Prime Sierpiński Project solve the Prime Sierpiński problem. |
*[[Proth prime]] Search: searching for primes of the form k×2<sup>n</sup>+1. | *[[Proth prime]] Search: searching for primes of the form k×2<sup>n</sup>+1. | ||
*[[Seventeen or Bust]]: helping to solve the [[Sierpiński problem]]. | *[[Seventeen or Bust]]: helping to solve the [[Sierpiński problem]]. | ||
Revision as of 04:04, 27 September 2020
Overview
PrimeGrid is a distributed computing project for searching for prime numbers of world-record size. It makes use of the Berkeley Open Infrastructure for Network Computing (BOINC) platform. As of August 2010, there are about 5,000 active participants (on about 11,500 host computers) from 89 countries, reporting about 65 teraflops.
Sub-projects
- 321 Prime Search searching for mega primes of the form 3×2n±1.
- AP27 Search: searching for an arithmetic progression (p+dn) that yields primes for 27 consecutive values of n.
- Cullen numbers / Woodall numbers Search: searching for mega primes of forms n×2n±1
- Extended Sierpiński problem: helping solve the Extended Sierpinski Problem.
- Fermat Divisor Search: searching for large prime divisors of Fermat numbers.
- Generalized Cullen/Woodall Prime Search: searching for primes of the form n×bn±1.
- Generalized Fermat number Search: searching for megaprimes of the form b2n+1.
- Prime Sierpiński problem: helping Prime Sierpiński Project solve the Prime Sierpiński problem.
- Proth prime Search: searching for primes of the form k×2n+1.
- Seventeen or Bust: helping to solve the Sierpiński problem.
- Sierpinski-Riesel Base 5: helping to solve the Sierpiński-Riesel Base 5 Problem.
- Sophie Germain prime Search: searching for primes p and 2p+1, and twin primes p and p+2.
- The Riesel problem: helping to solve the Riesel problem.
