| 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 Fermat Divisor Search"
(→See also: +multi reservation) |
(Add intro) |
||
| Line 1: | Line 1: | ||
| + | '''Fermat Divisor Search''' is a [[PrimeGrid]] project searching for large [[Fermat divisor]]s. It began in September 2019, and is expected to end in March-April 2021. | ||
| + | |||
==Purpose== | ==Purpose== | ||
Searching for [[Fermat divisor]]s of the form {{Kbn|+|k|2|n}} for 5 ≤ {{Vk}} ≤ 49. | Searching for [[Fermat divisor]]s of the form {{Kbn|+|k|2|n}} for 5 ≤ {{Vk}} ≤ 49. | ||
| Line 8: | Line 10: | ||
==See also== | ==See also== | ||
| + | *[[Multi Reservation:20|Multi Reservation]] | ||
*[[PrimeGrid]] | *[[PrimeGrid]] | ||
| − | |||
==External links== | ==External links== | ||
Revision as of 08:16, 14 March 2021
Fermat Divisor Search is a PrimeGrid project searching for large Fermat divisors. It began in September 2019, and is expected to end in March-April 2021.
Purpose
Searching for Fermat divisors of the form k•2n+1 for 5 ≤ k ≤ 49.
