A Fermat number is a positive integer of the form two raised to a power of two, itself raised to some exponent, plus one, written Fn for the exponent n, so that the first few Fermat numbers are three, five, seventeen, two hundred fifty-seven, and sixty-five thousand five hundred thirty-seven. They are named after the French mathematician Pierre de Fermat, who conjectured in the seventeenth century that every number of this form is prime, a claim that holds for the first five Fermat numbers but was disproved in 1732 by Leonhard Euler, who showed that the sixth one factors into smaller primes. No further prime Fermat numbers have ever been found beyond the first five, despite extensive computer searches of much larger candidates, and it remains an open question whether any more exist at all. Fermat numbers are also connected to geometry through a theorem of Carl Friedrich Gauss, who showed that a regular polygon can be constructed using only a compass and straightedge if its number of sides is a power of two multiplied by any number of distinct prime Fermat numbers.
Facts
Connections
Attributed To
Source Wikipedia: Fermat number
In Branch
Source Wolfram MathWorld: Fermat Number
Is Kind Of Object
Principal Result Of
Source Wikipedia: Pierre de Fermat
Sources
1. Wikipedia: Fermat number
Introduction, opening sentence
In mathematics, a Fermat number, named after Pierre de Fermat (1601-1665), the first known to have studied them, is a positive integer of the form:
Attributed To: Pierre de Fermat, Lead paragraph
the first known to have studied them
View the SourceWikipedia: Pierre de Fermat
WikipediaPrincipal Result Of: Pierre de Fermat, Article textQuote, Principal Result Of: Pierre de Fermat, Article text
In his letter to Pierre de Carcavi, Fermat said that he had proved that the Fermat numbers are all prime.
View the Source Wolfram MathWorld: Fermat Number
Wolfram MathWorldIn Branch: Number Theory, Subject classificationsQuote, In Branch: Number Theory, Subject classifications
Number Theory Special Numbers
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.