Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
integer sequence
|
| gptkbp:application |
number theory
constructible polygons |
| gptkbp:definedIn |
F_n = 2^{2^n} + 1
|
| gptkbp:discoveredBy |
gptkb:Pierre_de_Fermat
|
| gptkbp:first_terms |
17
257 3 5 65537 |
| https://www.w3.org/2000/01/rdf-schema#label |
Fermat number
|
| gptkbp:namedAfter |
gptkb:Pierre_de_Fermat
|
| gptkbp:property |
Fermat numbers are always odd
Fermat numbers are pairwise coprime Fermat numbers grow very rapidly all known Fermat numbers with n > 4 are composite Fermat numbers are of the form 2^{2^n} + 1 for n ≥ 0 Fermat conjectured all Fermat numbers are prime (disproved) |
| gptkbp:relatedTo |
gptkb:Mersenne_number
Fermat prime |
| gptkbp:sequence |
A000215
|
| gptkbp:bfsParent |
gptkb:Mersenne_number
|
| gptkbp:bfsLayer |
8
|