Perfect number

In mathematics, a perfect number is a positive integer that is the sum of its proper positive divisors, that is, the sum of the positive divisors excluding the number itself. Equivalently, a perfect number is a number that is half the sum of all of its positive divisors (including itself), or σ(n) = 2n.

The first perfect number is 6, because 1, 2, and 3 are its proper positive divisors, and 1 + 2 + 3 = 6. Equivalently, the number 6 is equal to half the sum of all its positive divisors: ( 1 + 2 + 3 + 6 ) / 2 = 6.

The next perfect number is 28 = 1 + 2 + 4 + 7 + 14. This is followed by the perfect numbers 496 and 8128 (sequence A000396 in the OEIS).

These first four perfect numbers were the only ones known to early Greek mathematics.

Even perfect numbers

Euclid discovered that the first four perfect numbers are generated by the formula 2^p−1(2^p − 1), with p a prime number:

for p = 2:   2¹(2² − 1) = 6

for p = 3:   2²(2³ − 1) = 28

for p = 5:   2⁴(2⁵ − 1) = 496

for p = 7:   2⁶(2⁷ − 1) = 8128.

Noticing that 2^p − 1 is a prime number in each instance, Euclid proved that the formula 2^p−1(2^p − 1) gives an even perfect number whenever 2^p − 1 is prime (Euclid, Prop. IX.36).

In order for 2^p − 1 to be prime, it is necessary that p itself be prime. 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. However, not all numbers of the form 2^p − 1 with p a prime are prime.

Over a millennium after Euclid, Ibn al-Haytham (Alhazen) circa 1000 AD realized that every even perfect number is of the form 2^p−1(2^p − 1) where 2^p − 1 is prime, but he was not able to prove this result. 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 concrete one-to-one association between even perfect numbers and Mersenne primes. This result is often referred to as the Euclid–Euler Theorem. As of September 2009, only 47 Mersenne primes are known, which means there are 47 perfect numbers known, the largest being 2^43,112,608 × (2^43,112,609 − 1) with 25,956,377 digits.

The first 39 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 (sequence A000043 in the OEIS).

The other 8 known are for p = 20996011, 24036583, 25964951, 30402457, 32582657, 37156667, 42643801, 43112609. It is not known whether there are others between them.

It is still uncertain whether there are infinitely many Mersenne primes and perfect numbers. The search for new Mersenne primes is the goal of the GIMPS distributed computing project.

Since any even perfect number has the form 2^p−1(2^p − 1), it is the (2^p − 1)th triangular number and the 2^p−1th hexagonal number. Like all triangular numbers, it is the sum of all natural numbers up to a certain point; in this case: 2^p − 1. Furthermore, any even perfect number except the first one is the sum of the first 2^(p−1)/2 odd cubes:

${\begin{aligned}6&=2^{1}(2^{2}-1)&&=1+2+3,\\[8pt]28&=2^{2}(2^{3}-1)&&=1+2+3+4+5+6+7=1^{3}+3^{3},\\[8pt]496&=2^{4}(2^{5}-1)&&=1+2+3+\cdots +29+30+31\\&&&=1^{3}+3^{3}+5^{3}+7^{3},\\[8pt]8128&=2^{6}(2^{7}-1)&&=1+2+3+\cdots +125+126+127\\&&&=1^{3}+3^{3}+5^{3}+7^{3}+9^{3}+11^{3}+13^{3}+15^{3}.\end{aligned}}$

Even perfect numbers (except 6) give remainder 1 when divided by 9. 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 is obtained — the resulting number is called the digital root — produces the number 1. For example, the digital root of 8128 = 1, since 8 + 1 + 2 + 8 = 19, 1 + 9 = 10, and 1 + 0 = 1. The reason that this digital root doesn't work with the perfect number 6 is because it only works with perfect numbers 2^p−1(2^p − 1), with odd prime p, The perfect number 6 associated with the even prime 2.

Owing to their form, 2^p−1(2^p − 1), every even perfect number is represented in binary as p 1s followed by p − 1  0s:

6₁₀ = 110₂

28₁₀ = 11100₂

496₁₀ = 111110000₂

Odd perfect numbers

Unsolved problem in mathematics:

Are there any odd perfect numbers?

(more unsolved problems in mathematics)

It is unknown whether there are any odd perfect numbers. Various results have been obtained, but none that has helped to locate one or otherwise resolve the question of their existence. Carl Pomerance has presented a heuristic argument which suggests that no odd perfect numbers exist. Also, it has been conjectured that there are no odd Ore's harmonic numbers, except for 1. If true, this would imply that there are no odd perfect numbers.

Any odd perfect number N must satisfy the following conditions:

• N > 10³⁰⁰. A search has tentatively shown that N > 10⁵⁰⁰, but this result is as yet unpublished.
• N is of the form

$N=q^{\alpha }p_{1}^{2e_{1}}\cdots p_{k}^{2e_{k}},$

where:

• q, p₁, ..., p_k are distinct primes (Euler).
• q ≡ α ≡ 1 (mod 4) (Euler).
• The smallest prime factor of N is less than (2k + 8) / 3 (Grün 1952).
• Either q^α > 10²⁰, or p _j^2e_j  > 10²⁰ for some j (Cohen 1987).
• N < 2^4k+1 (Nielsen 2003).

• The largest prime factor of N is greater than 10⁸ (Takeshi Goto and Yasuo Ohno, 2006).
• The second largest prime factor is greater than 10⁴, and the third largest prime factor is greater than 100 (Iannucci 1999, 2000).
• N has at least 75 prime factors and at least 9 distinct prime factors. If 3 is not one of the factors of N, then N has at least 12 distinct prime factors (Nielsen 2006; Kevin Hare 2005).

In 1888, Sylvester stated:

...a prolonged meditation on the subject has satisfied me that the existence of any one such [odd perfect number] — its escape, so to say, from the complex web of conditions which hem it in on all sides — would be little short of a miracle.

Minor results

All even perfect numbers have a very precise form; odd perfect numbers are rare, if indeed they do exist. There is 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:

• An odd perfect number is not divisible by 105 (Kühnel 1949).
• Every odd perfect number is of the form 12m + 1 or 468m + 117 or 324m + 81 (Roberts 2008). This can be extended.
• The only even perfect number of the form $x^{3}+1$ is 28 (Makowski 1962).
• The reciprocals of the divisors of a perfect number N must add up to 2:
  • 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, since 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 a class of numbers formed from Fermat primes in a similar way to the construction of even perfect numbers from Mersenne primes.

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 s(n) = σ(n) − n, and the aliquot sequence associated with a perfect number is a constant sequence.

See also

• Perfection
• Jan Brożek
• List of perfect numbers

References

• Graeme L. Cohen, "On the largest component of an odd perfect number", Journal of the Australian Mathematical Society, 42:2 (1987), pp. 280–286.
• Euclid, Elements, Book IX, Proposition 36. See D.E. Joyce's website for a translation and discussion of this proposition and its proof.
• Takeshi Goto and Yasuo Ohno, "Odd perfect numbers have a prime factor exceeding 10⁸", Mathematics of Computation 77:263 (2008), pp. 1859-1868. doi:10.1090/S0025-5718-08-02050-9.
• Otto Grün, "Über ungerade vollkommene Zahlen", Mathematische Zeitschrift, 55 (1952), pp. 353–354.
• Kevin Hare, New techniques for bounds on the total number of prime factors of an odd perfect number. Preprint, 2005. Available from his webpage.
• Douglas E. Iannucci, "The second largest prime divisor of an odd perfect number exceeds ten thousand", Mathematics of Computation, 68:228 (1999), pp. 1749–1760.
• Douglas E. Iannucci, "The third largest prime divisor of an odd perfect number exceeds one hundred", Mathematics of Computation, 69:230 (2000), pp. 867–879.
• H.-J. Kanold, "Untersuchungen über ungerade vollkommene Zahlen", Journal für die Reine und Angewandte Mathematik, 183 (1941), pp. 98–109.
• Ullrich Kühnel, "Verschärfung der notwendigen Bedingungen für die Existenz von ungeraden vollkommenen Zahlen", Mathematische Zeitschrift, 52 (1949), pp. 201–211.
• Pace P. Nielsen, "An upper bound for odd perfect numbers," Integers, 3 (2003), A14, 9 pp.
• Pace P. Nielsen, "Odd perfect numbers have at least nine different prime factors", Mathematics of Computation, in press, 2006. arXiv:math.NT/0602485.
• T. Roberts, "On the Form of an Odd Perfect Number", Australian Mathematical Gazette, 35:4 (2008), p. 244.
• R. Steuerwald, "Verschärfung einer notwendigen Bedingung für die Existenz einer ungeraden vollkommenen Zahl", S.-B. Bayer. Akad. Wiss., 1937, pp. 69–72.

Further reading

• Dickson, L.E.: History of the Theory of Numbers, 1, Chelsea, reprint, 1952.
• Nankar, M.L.: "History of perfect numbers," Ganita Bharati 1, no. 1–2 (1979), 7–8.
• Hagis, P.: "A Lower Bound for the set of odd Perfect Prime Numbers", Mathematics of Computation 27, (1973), 951–953.
• 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: Perfect, amicable and sociable numbers
• Perfect numbers - History and Theory
• Weisstein, Eric W. "perfect number". MathWorld.
• OEIS: A000396: List of perfect numbers
• OddPerfect.org A projected distributed computing project to search for odd perfect numbers
• [1], Great Internet Mersenne Prime Search
• Perfect Numbers, Math forum at Drexel