There are no approved revisions of this page, so it may
not have been
reviewed.
Perfect numbers are [positive] integers
for which the
sum of divisors equals
. For example, the divisors of
6 are
{1, 2, 3, 6}, and
1 + 2 + 3 + 6 = 12 = 2 × 6.
The even perfect numbers are of the form

n = 2 m (2 m + 1 − 1) = 2 m σ (2 m ), m ≥ 1, 
where
must be
prime (called a
Mersenne prime, see
A000668).

σ (n) = σ (2 m ) σ (σ (2 m )) = σ (2 m ) σ (2 m + 1 − 1) = σ (2 m ) 2 m + 1 = (2 m + 1 − 1) 2 m + 1 = 2 m + 1 (2 m + 1 − 1) = 2 n, m ≥ 1, 
since powers of 2, with positive exponent, are almostperfect.
Theorem. (Euclid)
If is a prime number (called a Mersenne prime), then is a perfect number (see A000396).
Proof. Labelling for our convenience the Mersenne prime as , the divisors of are the powers of 2 from 1 to and each of those powers multiplied by . Since , the sum of the divisors of is . Further rewriting, we get σ (n) = (2 m − 1) (1 + p) = (2 m − 1) (1 + 2 m − 1) = 2 m (2 m − 1) = 2 × 2 m − 1 (2 m − 1) = 2n 
, as predicted.^{[1]} □
It wasn’t until Leonhard Euler came along that the converse was proven.
Theorem. (Euler)
If is an even perfect number, it must be the product of a Mersenne prime and the power of two . (See A000079 for the powers of 2.)
Proof. PROOF GOES HERE. □ ^{(Provide proof: PROOF GOES HERE. □)} ^{[2]}
Between Euclid and Euler, medieval mathematicians made some conjectures about perfect numbers that have since been proven false, such as that there is a perfect number between each consecutive power of 10 (there are no perfect numbers between 10000 and 100000, or for that matter between 10000 and 10000000), and that the least significant base 10 digit of each successive perfect number alternates between 6 and 8 (supported by reference only to the first five perfect numbers).^{[3]}
Every even perfect number is a triangular number, since they are a subset of

2 n − 1 (2 n − 1) = = t 2 n − 1 , 
where
is prime.
Every even perfect number is also an hexagonal number, since they are a subset of

2 n − 1 (2 n − 1) = 2 n − 1 (2 ⋅ 2 n − 1 − 1) = h 2 n − 1 , 
where
is prime.
Odd perfect numbers
 Main article page: Odd perfect numbers
It is not known whether odd perfect numbers exist or not! Mathematicians have been able to prove all sorts of necessary (but not sufficient) requirements for the existence of such numbers without being able to prove either that they do exist or that they don’t exist.
See also
References
 ↑ James A. Anderson & James M. Bell, Number Theory with Applications, Upper Saddle River, New Jersey: Prentice Hall (1997): p. 124, Theorem 2.21.
 ↑ Needs proof.
 ↑ Thomas Koshy, Elementary Number Theory with Applications, Elsevier Academic Press (2007): 375.