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 "Fermat divisor"
(new) |
(No difference)
|
Latest revision as of 09:09, 7 September 2021
A Fermat divisor is a divisor of a Generalized Fermat number (in short a "GF Divisor").
Édouard Lucas showed:
- If n ≥ 2 then a Fermat divisor of a Fermat number Fn is of the form k•2n+2+1 (so a Proth prime).