A | B | C | D | E | F | G | H | CH | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
Named after | Pierre de Fermat |
---|---|
No. of known terms | 5 |
Conjectured no. of terms | 5 |
Subsequence of | Fermat numbers |
First terms | 3, 5, 17, 257, 65537 |
Largest known term | 65537 |
OEIS index | A019434 |
In mathematics, a Fermat number, named after Pierre de Fermat, the first known to have studied them, is a positive integer of the form: where n is a non-negative integer. The first few Fermat numbers are: 3, 5, 17, 257, 65537, 4294967297, 18446744073709551617, ... (sequence A000215 in the OEIS).
If 2k + 1 is prime and k > 0, then k itself must be a power of 2,[1] so 2k + 1 is a Fermat number; such primes are called Fermat primes. As of 2023[update], the only known Fermat primes are F0 = 3, F1 = 5, F2 = 17, F3 = 257, and F4 = 65537 (sequence A019434 in the OEIS).
Basic properties
The Fermat numbers satisfy the following recurrence relations:
for n ≥ 1,
for n ≥ 2. Each of these relations can be proved by mathematical induction. From the second equation, we can deduce Goldbach's theorem (named after Christian Goldbach): no two Fermat numbers share a common integer factor greater than 1. To see this, suppose that 0 ≤ i < j and Fi and Fj have a common factor a > 1. Then a divides both
and Fj; hence a divides their difference, 2. Since a > 1, this forces a = 2. This is a contradiction, because each Fermat number is clearly odd. As a corollary, we obtain another proof of the infinitude of the prime numbers: for each Fn, choose a prime factor pn; then the sequence {pn} is an infinite sequence of distinct primes.
Further properties
- No Fermat prime can be expressed as the difference of two pth powers, where p is an odd prime.
- With the exception of F0 and F1, the last digit of a Fermat number is 7.
- The sum of the reciprocals of all the Fermat numbers (sequence A051158 in the OEIS) is irrational. (Solomon W. Golomb, 1963)
Primality
Fermat numbers and Fermat primes were first studied by Pierre de Fermat, who conjectured that all Fermat numbers are prime. Indeed, the first five Fermat numbers F0, ..., F4 are easily shown to be prime. Fermat's conjecture was refuted by Leonhard Euler in 1732 when he showed that
Euler proved that every factor of Fn must have the form k 2n+1 + 1 (later improved to k 2n+2 + 1 by Lucas) for n ≥ 2.
That 641 is a factor of F5 can be deduced from the equalities 641 = 27 × 5 + 1 and 641 = 24 + 54. It follows from the first equality that 27 × 5 ≡ −1 (mod 641) and therefore (raising to the fourth power) that 228 × 54 ≡ 1 (mod 641). On the other hand, the second equality implies that 54 ≡ −24 (mod 641). These congruences imply that 232 ≡ −1 (mod 641).
Fermat was probably aware of the form of the factors later proved by Euler, so it seems curious that he failed to follow through on the straightforward calculation to find the factor.[2] One common explanation is that Fermat made a computational mistake.
There are no other known Fermat primes Fn with n > 4, but little is known about Fermat numbers for large n.[3] In fact, each of the following is an open problem:
- Is Fn composite for all n > 4?
- Are there infinitely many Fermat primes? (Eisenstein 1844[4])
- Are there infinitely many composite Fermat numbers?
- Does a Fermat number exist that is not square-free?
As of 2024[update], it is known that Fn is composite for 5 ≤ n ≤ 32, although of these, complete factorizations of Fn are known only for 0 ≤ n ≤ 11, and there are no known prime factors for n = 20 and n = 24.[5] The largest Fermat number known to be composite is F18233954, and its prime factor 7 × 218233956 + 1 was discovered in October 2020.
Heuristic arguments
Heuristics suggest that F4 is the last Fermat prime.
The prime number theorem implies that a random integer in a suitable interval around N is prime with probability 1 / ln N. If one uses the heuristic that a Fermat number is prime with the same probability as a random integer of its size, and that F5, ..., F32 are composite, then the expected number of Fermat primes beyond F4 (or equivalently, beyond F32) should be
One may interpret this number as an upper bound for the probability that a Fermat prime beyond F4 exists.
This argument is not a rigorous proof. For one thing, it assumes that Fermat numbers behave "randomly", but the factors of Fermat numbers have special properties. Boklan and Conway published a more precise analysis suggesting that the probability that there is another Fermat prime is less than one in a billion.[6]
Anders Bjorn and Hans Riesel estimated the number of square factors of Fermat numbers from F5 onward as
in other words, there are unlikely to be any non-squarefree Fermat numbers, and in general square factors of are very rare for large n.[7]
Equivalent conditions
Let be the nth Fermat number. Pépin's test states that for n > 0,
- is prime if and only if
Antropológia
Aplikované vedy
Bibliometria
Dejiny vedy
Encyklopédie
Filozofia vedy
Forenzné vedy
Humanitné vedy
Knižničná veda
Kryogenika
Kryptológia
Kulturológia
Literárna veda
Medzidisciplinárne oblasti
Metódy kvantitatívnej analýzy
Metavedy
Metodika
Text je dostupný za podmienok Creative
Commons Attribution/Share-Alike License 3.0 Unported; prípadne za ďalších
podmienok.
Podrobnejšie informácie nájdete na stránke Podmienky
použitia.
www.astronomia.sk | www.biologia.sk | www.botanika.sk | www.dejiny.sk | www.economy.sk | www.elektrotechnika.sk | www.estetika.sk | www.farmakologia.sk | www.filozofia.sk | Fyzika | www.futurologia.sk | www.genetika.sk | www.chemia.sk | www.lingvistika.sk | www.politologia.sk | www.psychologia.sk | www.sexuologia.sk | www.sociologia.sk | www.veda.sk I www.zoologia.sk