| 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 "The Other Prime Search"
| Line 13: | Line 13: | ||
==External links== | ==External links== | ||
*[https://primes.utm.edu/bios/page.php?id=3316 Project at The Prime Pages] | *[https://primes.utm.edu/bios/page.php?id=3316 Project at The Prime Pages] | ||
| − | [[Category:Project| ]] | + | [[Category:Distributed Computing Project| ]] |
Revision as of 16:00, 25 February 2020
The Other Prime Search (TOPS) is a prime searching project established in 2011 by Predrag Minovic (Kosmaj) and Thomas Ritschel (Thomas11).
The initial project description was as follows:
- Search for large generalized Cullen/Woodall primes. Breaking records, finding primes for primeless bases! In the future we plan to expand to near-repdigits, palindromes and other infrequently searched forms.
So far the following subprojects have been addressed:
- (1) Generalized Cullen/Woodall primes, started in 2011.
- (2) Irregular primes (Bernoulli and Euler), started in 2013.
- (3) Consecutive primes in arithmetic progression.
- (4) Cunningham chains and Sophie Germain primes.
- (5) Near-repdigit primes.
