| 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 "Twin Prime Search"
(corr.) |
(corr.) |
||
| Line 4: | Line 4: | ||
* [[Twin Prime Search 222333|{{Vn}}=222333 twin/Sophie Germain drive]] | * [[Twin Prime Search 222333|{{Vn}}=222333 twin/Sophie Germain drive]] | ||
* [[Twin Prime Search 333444|{{Vn}}=333444 twin/Sophie Germain drive]] | * [[Twin Prime Search 333444|{{Vn}}=333444 twin/Sophie Germain drive]] | ||
| − | * [[Twin Prime Search 480000|{{Vn}}= | + | * [[Twin Prime Search 480000|{{Vn}}=480000-500000 variable-{{Vn}} drive]] |
| − | * [[Twin Prime Search 1000000|{{Vn}}= | + | * [[Twin Prime Search 1000000|{{Vn}}=1000000 drive]] |
| − | * [[Twin Prime Search 1700000|{{Vn}}= | + | * [[Twin Prime Search 1700000|{{Vn}}=1700000 twin/Sophie Germain drive]] |
| − | * [[Twin Prime Search 3322000|{{Vn}}= | + | * [[Twin Prime Search 3322000|{{Vn}}=3322000 twin/Sophie Germain drive]] |
==External links== | ==External links== | ||
Latest revision as of 11:04, 21 March 2024
The Twin Prime Search is a distributed computing project that looks for large twin primes (Riesel type k•2n-1) of world record size.
Drives
- n=222333 twin/Sophie Germain drive
- n=333444 twin/Sophie Germain drive
- n=480000-500000 variable-n drive
- n=1000000 drive
- n=1700000 twin/Sophie Germain drive
- n=3322000 twin/Sophie Germain drive
External links
Twin Prime Search
