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"

From Prime-Wiki
Jump to: navigation, search
m
(update category for completed status)
 
Line 79: Line 79:
 
<references/>
 
<references/>
 
{{Navbox PrimeGrid}}
 
{{Navbox PrimeGrid}}
[[Category:PrimeGrid Fermat Divisor Search| ]]
+
[[Category:PrimeGrid|Fermat Divisor Search]]

Latest revision as of 18:29, 18 April 2025

Fermat Divisor Search was a PrimeGrid project searching for large Fermat divisors. It began in September 2019, and ended in April 2021.[1]

Purpose

The project searched for Fermat divisors of the form k•2n+1, for the following ranges:[1]

  • 5 ≤ k ≤ 49 for n ≤ 9,000,000, with two exceptions:
    • k = 9 and 27 did not search even n-values, because they cannot produce Fermat divisors.[2]
  • k = 1323, 2187, 3267 for even[3] n ≤ 3,322,000
  • k = 3125, 3375 for n ≤ 3,322,000
  • k = 19683 for n ≤ 4,000,000

Completed status page

Found primes

See also

External links

References

PrimeGrid