Edniwung fram 13:11, 6 Haligmonað 2016 adiht Escarbot (motung \| forðunga) 3,620 edits ly wikidata interwiki ← Yldre adihtung		Edniwung fram 05:26, 1 Þrimilcemonað 2018 adiht undo Birdofadozentides (motung \| forðunga) 2,838 edits lyNo edit summary Tag: Visual edit Niwre adihtung →
Líne 18: 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 == Líne 120: --> == See ~~swelce~~sƿelce eac == * [[Mersenne frumtæl]] * [[Lucas's theorem]] Line 129 ⟶ 130: * [[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] Line 138 ⟶ 140: == 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]]

Toscead betweox fadungum "Fermat tæl"