Metraipolis › archive › dc_c96bf0b5745b
Perfect number — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Perfect_number
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T12:52:09.978Z
- SHA-256 of the archived text
ac5dc560e09cd391109ab73045219a195c86ae5cfee7f1a43403f50f79172c32- Stable URL of this page
https://metraipolis.com/documento/dc_c96bf0b5745b
How to cite
Perfect number — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Perfect_number (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_c96bf0b5745b (Metraipolis archive dc_c96bf0b5745b, sha256 ac5dc560e09cd391109ab73045219a195c86ae5cfee7f1a43403f50f79172c32)
BibTeX
@misc{dcc96bf0b5745b,
title = {Perfect number — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Perfect_number},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_c96bf0b5745b; sha256 ac5dc560e09cd391109ab73045219a195c86ae5cfee7f1a43403f50f79172c32},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Perfect_number. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In number theory, a perfect number is a positive integer that is equal to the sum of its positive proper divisors, that is, divisors excluding the number itself. For instance, 6 has proper divisors 1, 2, and 3, and 1 + 2 + 3 = 6, so 6 is a perfect number. The next perfect number is 28, because 28 has proper divisors 1, 2, 4, 7, 14, and 1 + 2 + 4 + 7 + 14 = 28. The first seven perfect numbers are 6, 28, 496, 8128, 33550336, 8589869056, and 137438691328 (sequence A000396 in the OEIS). The sum of proper divisors of a number is called its aliquot sum, so a perfect number is one that is equal to its aliquot sum. Equivalently, a perfect number is a number that is half the sum of all of its positive divisors; in symbols, σ 1 ( n ) = 2 n {\displaystyle \sigma _{1}(n)=2n} where σ 1 {\displaystyle \sigma _{1}} is the sum-of-divisors function. This definition is ancient, appearing as early as Euclid's Elements (Book VII, Definition 22) where it is called τέλειος ἀριθμός (téleios arithmós; 'perfect', 'ideal', or 'complete number'). Euclid also proved a formation rule (Book IX, Proposition 36) whereby q ( q + 1 ) 2 {\textstyle {\frac {q(q+1)}{2}}} is an even perfect number whenever q {\displaystyle q} is a prime of the form 2 p − 1 {\displaystyle 2^{p}-1} for positive integer p {\displaystyle p} —what is now called a Mersenne prime. Two millennia later, Leonhard Euler proved that all even perfect numbers are of this form. This is known as the Euclid–Euler theorem. It is not known whether there are any odd perfect numbers, nor whether infinitely many perfect numbers exist.
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «number theory»).
Fonte: Wikipedia in inglese, voce «Perfect number» — https://en.wikipedia.org/wiki/Perfect_number
Wikidata Q170043: «numero naturale uguale alla somma dei suoi divisori» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q170043
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Perfect_number?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1378731853, consultata il 2026-10-06T11:08:29.536Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 72ef50877d23a3978be6ea1de1d40998cf751c52c81d683c1a0411e247f46bd6