Toscead betweox fadungum "Fermat tæl"

ly
nis nǣngu scortness þǣre adihtunge
ly (wikidata interwiki)
ly
Gif 2<sup>''n''</sup> + 1 [[frumtæl]] is, man cynþ ācȳðan þæt ''n'' must bēon 2-miht. (Gif ''n'' = ''ab'' þæt 1 < ''a'', ''b'' < ''n'' and ''b'' is ofertæl, man hæfþ 2<sup>''n''</sup> + 1 ≡ (2<sup>''a''</sup>)<sup>''b''</sup> + 1 ≡ (−1)<sup>''b''</sup> + 1 ≡ 0 ('''mod''' 2<sup>''a''</sup> + 1).)
 
For þǣm ǣlc frumtæl mid scape 2<sup>''n''</sup> + 1 is Fermat tæl, and þās frumtalu hātte '''Fermat frumtalu'''. Man wātƿāt ǣnlīce fīf Fermat frumtalu: ''F''<sub>0</sub>, ... ,''F''<sub>4</sub>.
 
== Basic properties ==
-->
 
== See swelcesƿelce eac ==
 
* [[Mersenne frumtæl]]
* [[Lucas's theorem]]
* [[Sierpinski tæl]]
 
== Ūtweardlican Ūtƿeardlican bendas: ==
 
* [http://www.research.att.com/cgi-bin/access.cgi/as/njas/sequences/eisA.cgi?Anum=A000215 Sequence of Fermat numbers]
* [http://primes.utm.edu/glossary/page.php?sort=FermatNumber Prime Glossary Page on (+d,āc) Fermat Numbers]
 
== References ==
* ''17 WordcræftasǷordcræftas on Fermat talu: From Number Theory to Geometry'', Michal Krizek, Florian Luca, Lawrence Somer, Springer, CMS Books 9, ISBN 0-387-95332-9 (Þis bóc hæfþ extensive list of references.)
 
[[Flocc:Rīmcræft]]