PrimeGrid: Difference between revisions
→Why PrimeGrid?: wording |
→Methods: math |
||
| Line 23: | Line 23: | ||
* Generalized Cullen-Woodall Search: searching for megaprimes of forms n·b<sup>n</sup>+1 and n·b<sup>n</sup>−1 where n + 2 > b. | * Generalized Cullen-Woodall Search: searching for megaprimes of forms n·b<sup>n</sup>+1 and n·b<sup>n</sup>−1 where n + 2 > b. | ||
* Extended Sierpinski Problem: helping solve the '''''[https://www.primegrid.com/forum_thread.php?id=5758 Extended Sierpinski Problem]'''''. | * Extended Sierpinski Problem: helping solve the '''''[https://www.primegrid.com/forum_thread.php?id=5758 Extended Sierpinski Problem]'''''. | ||
* Generalized Fermat Prime Search: searching for megaprimes of the form | * Generalized Fermat Prime Search: searching for megaprimes of the form <math>b^{2^{n}}</math>+1. | ||
* Prime Sierpinski Project: helping the Prime Sierpinski Project solve the '''''[https://www.primegrid.com/forum_thread.php?id=972 Prime Sierpinski Problem]'''''. | * Prime Sierpinski Project: helping the Prime Sierpinski Project solve the '''''[https://www.primegrid.com/forum_thread.php?id=972 Prime Sierpinski 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. | ||