Fermat number
Positive integer of the form (2^(2^n))+1
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: F n = 2 2 n + 1 , {\displaystyle F_{n}=2^{2^{n}}+1,} where n is a non-negative integer. The first few Fermat numbers are: 3, 5, 17, 257, 65537, 4294967297, 18446744073709551617, 340282366920938463463374607431768211457, ...
Nº Q207264 ★★
Uncommon · Knowledge
Fermat number
Positive integer of the form (2^(2^n))+1
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: F n = 2 2 n + 1 , {\displaystyle F_{n}=2^{2^{n}}+1,} where n is a non-negative integer. The first few Fermat numbers are: 3, 5, 17, 257, 65537, 4294967297, 18446744073709551617, 340282366920938463463374607431768211457, ...
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
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: F n = 2 2 n + 1 , {\displaystyle F_{n}=2^{2^{n}}+1,} where n is a non-negative integer. The first few Fermat numbers are: 3, 5, 17, 257, 65537, 4294967297, 18446744073709551617, 340282366920938463463374607431768211457, ... (sequence A000215 in the OEIS). If 2k + 1 is prime and k > 0, then k itself must be a power of 2, so 2k + 1 is a Fermat number; such primes are called Fermat primes. As of 2026, the only known Fermat primes are F0 = 3, F1 = 5, F2 = 17, F3 = 257, and F4 = 65537 (sequence A019434 in the OEIS).
Text: Wikipédia, CC BY-SA 4.0. · Image: Unknown authorUnknown author (Public domain) ·
Related cards
-
F
Fermat polygonal number theorem
Theorem
Nº Q1146791 ★
Not listed
-
Fermat's theorem on sums of two squares
Theorem that an odd prime is a sum of two squares iff it is of the form 4𝑛+1
Nº Q914517 ★★
Not listed
-
B
Beal conjecture
Conjecture in number theory
Nº Q508173 ★★
Not listed
-
Pell's equation
Mathematical equation, specifically a kind of Diophantine equation
Nº Q853067 ★★
Not listed
-
6
65,535
Natural number, 1 less than 2^16, product of first 4 Fermat primes
Nº Q2318766 ★
Not listed
-
5
Natural number
Nº Q203 ★★★★
Not listed