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
(Complete)
(Add info on ranges searched)
Line 1: Line 1:
'''Fermat Divisor Search''' is a [[PrimeGrid]] project searching for large [[Fermat divisor]]s. It began in September 2019, and ended in April 2021.<ref>https://www.primegrid.com/forum_thread.php?id=8778&nowrap=true#149792</ref>
+
'''Fermat Divisor Search''' was a [[PrimeGrid]] project searching for large [[Fermat divisor]]s. It began in September 2019, and ended in April 2021.<ref name="table">https://www.primegrid.com/forum_thread.php?id=8778&nowrap=true#149792</ref>
  
 
==Purpose==
 
==Purpose==
Searching for [[Fermat divisor]]s of the form {{Kbn|+|k|2|n}} for 5 &le; {{Vk}} &le; 49.
+
The project searched for [[Fermat divisor]]s of the form {{Kbn|+|k|2|n}}, for the following ranges:<ref name="table"/>
  
==Status==
+
* 5 ≤ {{Vk}} ≤ 49 for {{Vn}} ≤ 9,000,000, with two exceptions:
*[https://www.primegrid.com/stats_div_llr.php Current status]
+
**{{Vk}} = 9 and 27 did not search even {{Vn}}-values, because they cannot produce Fermat divisors.<ref>[https://www.primegrid.com/forum_thread.php?id=8783 What primes can be Fermat divisors? - PrimeGrid Forums]</ref>
 +
* {{Vk}} = 1323, 2187, 3125, 3267, 3375 for {{Vn}} ≤ 3,322,000
 +
* {{Vk}} = 19683 for {{Vn}} ≤ 4,000,000
 +
 
 +
[https://www.primegrid.com/stats_div_llr.php Completed status page]
  
 
==Found primes==
 
==Found primes==

Revision as of 06:46, 18 April 2021

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, 3125, 3267, 3375 for n ≤ 3,322,000
  • k = 19683 for n ≤ 4,000,000

Completed status page

Found primes

See also

References

External links