# Euclid–Euler theorem

Euclid–Euler theorem This article is about the theorem on perfect numbers and Mersenne primes. For the theorem on the infinitude of prime numbers, see Euclid's theorem.

The Euclid–Euler theorem is a theorem in number theory that relates perfect numbers to Mersenne primes. It states that an even number is perfect if and only if it has the form 2p−1(2p − 1), where 2p − 1 is a prime number. The theorem is named after mathematicians Euclid and Leonhard Euler, who respectively proved the "Se" e "only if" aspects of the theorem.

It has been conjectured that there are infinitely many Mersenne primes. Although the truth of this conjecture remains unknown, it is equivalent, by the Euclid–Euler theorem, to the conjecture that there are infinitely many even perfect numbers. Tuttavia, it is also unknown whether there exists even a single odd perfect number.[1] Contenuti 1 Statement and examples 2 Storia 3 Prova 3.1 Sufficiency 3.2 Necessity 4 References Statement and examples A perfect number is a natural number that equals the sum of its proper divisors, the numbers that are less than it and divide it evenly (with remainder zero). Per esempio, the proper divisors of 6 sono 1, 2, e 3, which sum to 6, Così 6 is perfect.

A Mersenne prime is a prime number of the form Mp = 2p − 1, one less than a power of two. For a number of this form to be prime, p itself must also be prime, but not all primes give rise to Mersenne primes in this way. Per esempio, 23 − 1 = 7 is a Mersenne prime, ma 211 − 1 = 2047 = 23 × 89 non è.

The Euclid–Euler theorem states that an even natural number is perfect if and only if it has the form 2p−1Mp, where Mp is a Mersenne prime.[1] The perfect number 6 comes from p = 2 in this way, as 22−1M2 = 2 × 3 = 6, and the Mersenne prime 7 corresponds in the same way to the perfect number 28.

History Euclid proved that 2p−1(2p − 1) is an even perfect number whenever 2p − 1 è primo. This is the final result on number theory in Euclid's Elements; the later books in the Elements instead concern irrational numbers, solid geometry, and the golden ratio. Euclid expresses the result by stating that if a finite geometric series beginning at 1 with ratio 2 has a prime sum q, then this sum multiplied by the last term t in the series is perfect. Expressed in these terms, the sum q of the finite series is the Mersenne prime 2p − 1 and the last term t in the series is the power of two 2p−1. Euclid proves that qt is perfect by observing that the geometric series with ratio 2 starting at q, with the same number of terms, is proportional to the original series; dunque, since the original series sums to q = 2t − 1, the second series sums to q(2t − 1) = 2qt − q, and both series together add to 2qt, two times the supposed perfect number. Tuttavia, these two series are disjoint from each other and (by the primality of q) exhaust all the divisors of qt, so qt has divisors that sum to 2qt, showing that it is perfect.[2] Over a millennium after Euclid, Alhazen c. 1000 CE conjectured that every even perfect number is of the form 2p−1(2p − 1) where 2p − 1 è primo, but he was not able to prove this result.[3] It was not until the 18th century, Sopra 2000 years after Euclid,[4] that Leonhard Euler proved that the formula 2p−1(2p − 1) will yield all the even perfect numbers.[1][5] così, there is a one-to-one relationship between even perfect numbers and Mersenne primes; each Mersenne prime generates one even perfect number, e viceversa. After Euler's proof of the Euclid–Euler theorem, other mathematicians have published different proofs, including Victor-Amédée Lebesgue, Robert Daniel Carmichael, Leonard Eugene Dickson, John Knopfmacher, and Wayne L. McDaniel. Dickson's proof, in particolare, has been commonly used in textbooks.[6] This theorem was included in a web listing of the "superiore 100 mathematical theorems", dating from 1999, which later became used by Freek Wiedijk as a benchmark set to test the power of different proof assistants. As of 2021, the proof of the Euclid–Euler theorem had been formalized in 5 del 10 proof assistants recorded by Wiedijk.[7] Proof Euler's proof is short[1] and depends on the fact that the sum of divisors function σ is multiplicative; questo è, if a and b are any two relatively prime integers, then σ(ab) = pag(un)p(b). For this formula to be valid, the sum of divisors of a number must include the number itself, not just the proper divisors. A number is perfect if and only if its sum of divisors is twice its value.

Sufficiency One direction of the theorem (the part already proved by Euclid) immediately follows from the multiplicative property: every Mersenne prime gives rise to an even perfect number. When 2p − 1 è primo, {displaystyle sigma (2^{p-1}(2^{p}-1))=sigma (2^{p-1})sigma (2^{p}-1).} The divisors of 2p−1 are 1, 2, 4, 8, ..., 2p−1. The sum of these divisors is a geometric series whose sum is 2p − 1. Prossimo, since 2p − 1 è primo, its only divisors are 1 and itself, so the sum of its divisors is 2p.

Combining these, {stile di visualizzazione {inizio{allineato}sigma (2^{p-1}(2^{p}-1))&=sigma (2^{p-1})sigma (2^{p}-1)\&=(2^{p}-1)(2^{p})\&=2(2^{p-1})(2^{p}-1).fine{allineato}}} Perciò, 2p−1(2p − 1) is perfect.[8][9][10] Necessity In the other direction, suppose that an even perfect number has been given, and partially factor it as 2kx, where x is odd. For 2kx to be perfect, the sum of its divisors must be twice its value: {stile di visualizzazione 2 ^{k+1}x=sigma (2^{K}X)=(2^{k+1}-1)sigma (X).} () The odd factor 2k+1 − 1 on the right side of () is at least 3, and it must divide x, the only odd factor on the left side, so y = x/(2k+1 − 1) is a proper divisor of x. Dividing both sides of () by the common factor 2k+1 − 1 and taking into account the known divisors x and y of x gives {stile di visualizzazione 2 ^{k+1}y=sigma (X)=x+y+{}} other divisors {stile di visualizzazione {}=2^{k+1}y+{}} other divisors.

For this equality to be true, there can be no other divisors. Perciò, y must be 1, and x must be a prime of the form 2k+1 − 1.[8][9][10] Riferimenti ^ Salta su: a b c d Stillwell, John (2010), Mathematics and Its History, Undergraduate Texts in Mathematics, Springer, p. 40, ISBN 978-1-4419-6052-8. ^ Euclid (1956), The Thirteen Books of The Elements, Translated with introduction and commentary by Sir Thomas L. Heath, vol. 2 (Books III–IX) (2nd ed.), Dover, pp. 421–426. See in particular Prop. IX.36. ^ O'Connor, John J.; Robertson, Edmund F., "Abu Ali al-Hasan ibn al-Haytham", Archivio di storia della matematica di MacTutor, University of St Andrews ^ Pollack, Paolo; Shevelev, Vladimir (2012), "On perfect and near-perfect numbers", Rivista di teoria dei numeri, 132 (12): 3037–3046, arXiv:1011.6160, doi:10.1016/j.jnt.2012.06.008, SIG 2965207, S2CID 13607242 ^ Euler, Leonhard (1849), "De numeris amicibilibus" [On amicable numbers], Commentationes arithmeticae (in latino), vol. 2, pp. 627–636. Originally read to the Berlin Academy on February 23, 1747, and published posthumously. See in particular section 8, p. 88. ^ Cohen, Graeme L. (Marzo 1981), "Even perfect numbers", La Gazzetta Matematica, 65 (431): 28–30, doi:10.2307/3617930, JSTOR 3617930 ^ Wiedijk, Freek, Formalizing 100 Teoremi, Radboud University Institute for Computing and Information Sciences, recuperato 2021-07-10 ^ Salta su: a b Gerstein, Larry (2012), Introduction to Mathematical Structures and Proofs, Undergraduate Texts in Mathematics, Springer, Teorema 6.94, p. 339, ISBN 978-1-4614-4265-3. ^ Salta su: a b Caldwell, Chris K., "A proof that all even perfect numbers are a power of two times a Mersenne prime", Prime Pages, recuperato 2014-12-02. ^ Salta su: a b Travaglini, Giancarlo (2014), Teoria dei numeri, Fourier Analysis and Geometric Discrepancy, Testi degli studenti della London Mathematical Society, vol. 81, Cambridge University Press, pp. 26–27, ISBN 978-1-107-04403-6. Categorie: Theorems in number theoryLeonhard EulerMersenne primesPerfect numbers

Se vuoi conoscere altri articoli simili a Euclid–Euler theorem puoi visitare la categoria Leonhard Euler.

Vai su

Utilizziamo cookie propri e di terze parti per migliorare l'esperienza dell'utente Maggiori informazioni