Perfect Number

In number theory, a perfect number is a positive integer that is equal to the sum of its positive divisors, excluding the number itself. For instance, 6 has divisors 1, 2 and 3 (excluding itself), and 1 + 2 + 3 = 6, so 6 is a perfect number.

The sum of divisors of a number, excluding the number itself, 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 including itself; in symbols, $\sigma_1(n)=2n$ where $\sigma_1$ is the sum-of-divisors function. For instance, 28 is perfect as 1 + 2 + 4 + 7 + 14 = 28.

This definition is ancient, appearing as early as Euclid's ''Elements'' (VII.22) where it is called (''perfect'', ''ideal'', or ''complete number''). Euclid also proved a formation rule (IX.36) whereby $q(q+1)/2$ is an even perfect number whenever $q$ is a prime of the form $2^p-1$ for positive integer $p$—what is now called a Mersenne prime. Two millennia later, Leonhard Euler proved that all even perfect numbers are of this form.Caldwell, Chris
"A proof that all even perfect numbers are a power of two times a Mersenne prime"
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. The first few perfect numbers are 6, 28, 496 and 8128 .

History

In about 300 BC Euclid showed that if 2^''p'' − 1 is prime then 2^''p''−1(2^''p'' − 1) is perfect.
The first four perfect numbers were the only ones known to early Greek mathematics, and the mathematician Nicomachus noted 8128 as early as around AD 100. In modern language, Nicomachus states without proof that every perfect number is of the form $2^(2^n-1)$ where $2^n-1$ is prime. He seems to be unaware that itself has to be prime. He also says (wrongly) that the perfect numbers end in 6 or 8 alternately. (The first 5 perfect numbers end with digits 6, 8, 6, 8, 6; but the sixth also ends in 6.) Philo of Alexandria in his first-century book "On the creation" mentions perfect numbers, claiming that the world was created in 6 days and the moon orbits in 28 days because 6 and 28 are perfect. Philo is followed by Origen, and by Didymus the Blind, who adds the observation that there are only four perfect numbers that are less than 10,000. (Commentary on Genesis 1. 14–19). St Augustine defines perfect numbers in City of God (Book XI, Chapter 30) in the early 5th century AD, repeating the claim that God created the world in 6 days because 6 is the smallest perfect number. The Egyptian mathematician Ismail ibn Fallūs (1194–1252) mentioned the next three perfect numbers (33,550,336; 8,589,869,056; and 137,438,691,328) and listed a few more which are now known to be incorrect. The first known European mention of the fifth perfect number is a manuscript written between 1456 and 1461 by an unknown mathematician. In 1588, the Italian mathematician Pietro Cataldi identified the sixth (8,589,869,056) and the seventh (137,438,691,328) perfect numbers, and also proved that every perfect number obtained from Euclid's rule ends with a 6 or an 8.

Even perfect numbers

Euclid proved that 2^''p''−1(2^''p'' − 1) is an even perfect number whenever 2^''p'' − 1 is prime (Elements, Prop. IX.36).

For example, the first four perfect numbers are generated by the formula 2^''p''−1(2^''p'' − 1), with ''p'' a prime number, as follows:

:for ''p'' = 2:   2¹(2² − 1) = 2 × 3 = 6
:for ''p'' = 3:   2²(2³ − 1) = 4 × 7 = 28
:for ''p'' = 5:   2⁴(2⁵ − 1) = 16 × 31 = 496
:for ''p'' = 7:   2⁶(2⁷ − 1) = 64 × 127 = 8128.

Prime numbers of the form 2^''p'' − 1 are known as Mersenne primes, after the seventeenth-century monk Marin Mersenne, who studied number theory and perfect numbers. For 2^''p'' − 1 to be prime, it is necessary that ''p'' itself be prime. However, not all numbers of the form 2^''p'' − 1 with a prime ''p'' are prime; for example, 2¹¹ − 1 = 2047 = 23 × 89 is not a prime number. In fact, Mersenne primes are very rare—of the 2,610,944 prime numbers ''p'' up to 43,112,609,
2^''p'' − 1 is prime for only 47 of them.

Although Nicomachus had stated (without proof) that all perfect numbers were of the form $2^\left(2^n - 1\right)$ where $2^n - 1$ is prime (though he stated this somewhat differently), Ibn al-Haytham (Alhazen) circa AD 1000 conjectured only that every even perfect number is of that form. It was not until the 18th century that Leonhard Euler proved that the formula 2^''p''−1(2^''p'' − 1) will yield all the even perfect numbers. Thus, there is a one-to-one correspondence between even perfect numbers and Mersenne primes; each Mersenne prime generates one even perfect number, and vice versa. This result is often referred to as the Euclid–Euler theorem.

An exhaustive search by the GIMPS distributed computing project has shown that the first 48 even perfect numbers are 2^''p''−1(2^''p'' − 1) for
: ''p'' = 2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, 127, 521, 607, 1279, 2203, 2281, 3217, 4253, 4423, 9689, 9941, 11213, 19937, 21701, 23209, 44497, 86243, 110503, 132049, 216091, 756839, 859433, 1257787, 1398269, 2976221, 3021377, 6972593, 13466917, 20996011, 24036583, 25964951, 30402457, 32582657, 37156667, 42643801, 43112609 and 57885161 .

Three higher perfect numbers have also been discovered, namely those for which ''p'' = 74207281, 77232917, and 82589933. Although it is still possible there may be others within this range, initial but exhaustive tests by GIMPS have revealed no other perfect numbers for ''p'' below 109332539. , 51 Mersenne primes are known, and therefore 51 even perfect numbers (the largest of which is 2^82589932 × (2^82589933 − 1) with 49,724,095 digits). It is not known whether there are infinitely many perfect numbers, nor whether there are infinitely many Mersenne primes.

As well as having the form 2^''p''−1(2^''p'' − 1), each even perfect number is the triangular number (and hence equal to the sum of the integers from 1 to ) and the hexagonal number. Furthermore, each even perfect number except for 6 is the centered nonagonal number and is equal to the sum of the first odd cubes (odd cubes up to the cube of ):

:\begin
6 = 2^1\left(2^2 - 1\right)
& = 1 + 2 + 3, \\ pt 28 = 2^2\left(2^3 - 1\right)
& = 1 + 2 + 3 + 4 + 5 + 6 + 7 = 1^3 + 3^3, \\ pt 496 = 2^4\left(2^5 - 1\right)
& = 1 + 2 + 3 + \cdots + 29 + 30 + 31 \\
& = 1^3 + 3^3 + 5^3 + 7^3, \\ pt 8128 = 2^6\left(2^7 - 1\right)
& = 1 + 2 + 3 + \cdots + 125 + 126 + 127 \\
& = 1^3 + 3^3 + 5^3 + 7^3 + 9^3 + 11^3 + 13^3 + 15^3, \\ pt 33550336 = 2^\left(2^ - 1\right)
& = 1 + 2 + 3 + \cdots + 8189 + 8190 + 8191 \\
& = 1^3 + 3^3 + 5^3 + \cdots + 123^3 + 125^3 + 127^3.
\end

Even perfect numbers (except 6) are of the form
:$T_ = 1 + \frac = 1 + 9 \times T_$

with each resulting triangular number , , (after subtracting 1 from the perfect number and dividing the result by 9) ending in 3 or 5, the sequence starting with , , T₄₂ = 903, T₂₇₃₀ = 3727815, ... This can be reformulated as follows: adding the digits of any even perfect number (except 6), then adding the digits of the resulting number, and repeating this process until a single digit (called the digital root) is obtained, always produces the number 1. For example, the digital root of 8128 is 1, because 8 + 1 + 2 + 8 = 19, 1 + 9 = 10, and 1 + 0 = 1. This works with all perfect numbers 2^''p''−1(2^''p'' − 1) with odd prime ''p'' and, in fact, with all numbers of the form 2^''m''−1(2^''m'' − 1) for odd integer (not necessarily prime) ''m''.

Owing to their form, 2^''p''−1(2^''p'' − 1), every even perfect number is represented in binary form as ''p'' ones followed by ''p'' − 1  zeros; for example,
: 6₁₀ = 2² + 2¹ = 110₂,
: 28₁₀ = 2⁴ + 2³ + 2² = 11100₂,
: 496₁₀ = 2⁸ + 2⁷ + 2⁶ + 2⁵ + 2⁴ = 111110000₂, and
: 8128₁₀ = 2¹² + 2¹¹ + 2¹⁰ + 2⁹ + 2⁸ + 2⁷ + 2⁶ = 1111111000000₂.

Thus every even perfect number is a pernicious number.

Every even perfect number is also a practical number (cf. Related concepts).

Odd perfect numbers

It is unknown whether any odd perfect numbers exist, though various results have been obtained. In 1496, Jacques Lefèvre stated that Euclid's rule gives all perfect numbers, thus implying that no odd perfect number exists. Euler stated: "Whether ... there are any odd perfect numbers is a most difficult question". More recently, Carl Pomerance has presented a heuristic argument suggesting that indeed no odd perfect number should exist.Oddperfect.org
All perfect numbers are also Ore's harmonic numbers, and it has been conjectured as well that there are no odd Ore's harmonic numbers other than 1. Many of the properties proved about odd perfect numbers also apply to Descartes numbers, and Pace Nielsen has suggested that sufficient study of those numbers may lead to a proof that no odd perfect numbers exist.

Any odd perfect number ''N'' must satisfy the following conditions:
* ''N'' > 10¹⁵⁰⁰.
* ''N'' is not divisible by 105.
* ''N'' is of the form ''N'' ≡ 1 (mod 12) or ''N'' ≡ 117 (mod 468) or ''N'' ≡ 81 (mod 324).
* ''N'' is of the form
::$N=q^ p_1^ \cdots p_k^,$
:where:
:* ''q'', ''p''₁, ..., ''p''_''k'' are distinct odd primes (Euler).
:* ''q'' ≡ α ≡ 1 ( mod 4) (Euler).
:* The smallest prime factor of ''N'' is at most $\frac.$
:* Either ''q''^α > 10⁶², or ''p''_''j''^2''e''_''j''  > 10⁶² for some ''j''.
:* $N < 2^$
:* $\alpha + 2e_1 + 2e_2 + 2e_3 + \cdots + 2e_k \geq \frac$.
:* $qp_1p_2p_3 \cdots p_k < 2N^$.
* The largest prime factor of ''N'' is greater than 10⁸ and less than \sqrt
* The second largest prime factor is greater than 10⁴, and is less than \sqrt /math>..
* The third largest prime factor is greater than 100, and less than \sqrt
* ''N'' has at least 101 prime factors and at least 10 distinct prime factors. If 3 is not one of the factors of ''N'', then ''N'' has at least 12 distinct prime factors.

Furthermore, several minor results are known about the exponents
''e''₁, ..., ''e''_''k''.
* Not all ''e''_''i'' ≡ 1 ( mod 3).
* Not all ''e''_''i'' ≡ 2 ( mod 5).
* If all ''e''_''i'' ≡ 1 ( mod 3) or 2 ( mod 5), then the smallest prime factor of ''N'' must lie between 10⁸ and 10¹⁰⁰⁰.
* More generally, if all 2''e''_''i''+1 have a prime factor in a given finite set ''S'', then the smallest prime factor of ''N'' must be smaller than an effectively computable constant depending only on ''S''.
* If (''e''₁, ..., ''e''_''k'')=  (1, ..., 1, 2, ..., 2) with ''t'' ones and ''u'' twos, then $(t-1)/4 \leq u \leq 2t+\sqrt$.
* (''e''₁, ..., ''e''_''k'') ≠ (1, ..., 1, 3), (1, ..., 1, 5), (1, ..., 1, 6).
* If , then
** ''e'' cannot be 3, 5, 24, 6, 8, 11, 14 or 18.
** $k\leq 2e^2+8e+2$ and $N<2^$.

In 1888, Sylvester stated:

Minor results

All even perfect numbers have a very precise form; odd perfect numbers either do not exist or are rare. There are a number of results on perfect numbers that are actually quite easy to prove but nevertheless superficially impressive; some of them also come under Richard Guy's strong law of small numbers:
* The only even perfect number of the form ''x''³ + 1 is 28 .
* 28 is also the only even perfect number that is a sum of two positive cubes of integers .
* The reciprocals of the divisors of a perfect number ''N'' must add up to 2 (to get this, take the definition of a perfect number, $\sigma_1(n) = 2n$, and divide both sides by ''n''):
** For 6, we have $1/6 + 1/3 + 1/2 + 1/1 = 2$;
** For 28, we have $1/28 + 1/14 + 1/7 + 1/4 + 1/2 + 1/1 = 2$, etc.
* The number of divisors of a perfect number (whether even or odd) must be even, because ''N'' cannot be a perfect square.
** From these two results it follows that every perfect number is an Ore's harmonic number.
* The even perfect numbers are not trapezoidal numbers; that is, they cannot be represented as the difference of two positive non-consecutive triangular numbers. There are only three types of non-trapezoidal numbers: even perfect numbers, powers of two, and the numbers of the form $2^(2^n+1)$ formed as the product of a Fermat prime $2^n+1$ with a power of two in a similar way to the construction of even perfect numbers from Mersenne primes.
* The number of perfect numbers less than ''n'' is less than $c\sqrt$, where ''c'' > 0 is a constant. In fact it is $o(\sqrt)$, using little-o notation.
* Every even perfect number ends in 6 or 28, base ten; and, with the only exception of 6, ends in 1, base 9. Therefore, in particular the digital root of every even perfect number other than 6 is 1.
* The only square-free perfect number is 6..

Related concepts

The sum of proper divisors gives various other kinds of numbers. Numbers where the sum is less than the number itself are called deficient, and where it is greater than the number, abundant. These terms, together with ''perfect'' itself, come from Greek numerology. A pair of numbers which are the sum of each other's proper divisors are called amicable, and larger cycles of numbers are called sociable. A positive integer such that every smaller positive integer is a sum of distinct divisors of it is a practical number.

By definition, a perfect number is a fixed point of the restricted divisor function , and the aliquot sequence associated with a perfect number is a constant sequence. All perfect numbers are also $\mathcal$-perfect numbers, or Granville numbers.

A semiperfect number is a natural number that is equal to the sum of all or some of its proper divisors. A semiperfect number that is equal to the sum of all its proper divisors is a perfect number. Most abundant numbers are also semiperfect; abundant numbers which are not semiperfect are called weird numbers.

See also

* Hyperperfect number
* Leinster group
* List of Mersenne primes and perfect numbers
* Multiply perfect number
* Superperfect numbers
* Unitary perfect number
* Harmonic divisor number

Notes

References

* Euclid, ''Elements'', Book IX, Proposition 36. Se
D.E. Joyce's website
for a translation and discussion of this proposition and its proof.
*
*

Further reading

* Nankar, M.L.: "History of perfect numbers," Ganita Bharati 1, no. 1–2 (1979), 7–8.
*
* Riele, H.J.J. "Perfect Numbers and Aliquot Sequences" in H.W. Lenstra and R. Tijdeman (eds.): ''Computational Methods in Number Theory'', Vol. 154, Amsterdam, 1982, pp. 141–157.
* Riesel, H. ''Prime Numbers and Computer Methods for Factorisation'', Birkhauser, 1985.
*

External links

*
* David Moews



*
*

OddPerfect.org
A projected distributed computing project to search for odd perfect numbers.

Great Internet Mersenne Prime Search
(GIMPS)


math forum at Drexel.
*

{{DEFAULTSORT:Perfect Number
Divisor function
Integer sequences
Unsolved problems in number theory
Mersenne primes