A perfect number is a positive integer whose proper positive divisors add up to the number itself. For example, the proper divisors of 6 are 1, 2, and 3. Their sum is 1 + 2 + 3 = 6, so 6 is perfect. The next perfect number is 28 because its proper divisors are 1, 2, 4, 7, and 14, whose sum is 28. Perfect numbers are related to the sum-of-divisors function. Every known even perfect number has the form 2^(p-1)(2^p - 1), where 2^p - 1 is a Mersenne prime. The Euclid-Euler theorem establishes that this formula produces all even perfect numbers. Whether any odd perfect number exists remains an unsolved problem.
Perfect Numbers
A perfect number is a positive integer equal to the sum of all its positive divisors excluding itself.
σ(n) = 2n
Explanation
Variables
Σ(n)
The sum of all positive divisors of n.
N
A positive integer.
2n
Twice the original number; for a perfect number, the total divisor sum equals 2n.
Example or application
A worked example has not yet been added.
Definition
A perfect number is a positive integer n for which the sum of its proper positive divisors equals n.
Purpose
To understand special relationships between integers and their divisors.
Importance
Perfect numbers connect divisor theory, prime numbers, Mersenne primes, and important unsolved problems in number theory.
Key Concepts
Proper divisors
Sum of divisors
Perfect-number condition
Even perfect numbers
Euclid-Euler theorem
Odd perfect-number problem
Characteristics
A perfect number equals the sum of its proper positive divisors.
The smallest perfect number is 6.
The second perfect number is 28.
Every known perfect number is even.
Even perfect numbers are generated using Mersenne primes.
The existence of odd perfect numbers remains unknown.
Types
| Name | Description |
|---|---|
Even perfect numbers | Perfect numbers divisible by 2, such as 6, 28, and 496. |
Odd perfect numbers | A hypothetical category of perfect numbers that are odd; none has been discovered or proven to exist. |
Components
Positive integer
Proper divisors
Divisor sum
Perfect-number equality
Properties
A perfect number satisfies σ(n) = 2n.
The sum of its proper positive divisors is exactly n.
Every even perfect number has the form 2^(p-1)(2^p - 1), where 2^p - 1 is prime.
The first few perfect numbers are 6, 28, 496, and 8128.
Every known perfect number is even.
No odd perfect number is currently known.
Examples
| Problem | Solution |
|---|---|
Show that 6 is a perfect number. | The proper divisors of 6 are 1, 2, and 3. Their sum is 1 + 2 + 3 = 6. Therefore, 6 is perfect. |
Show that 28 is a perfect number. | The proper divisors of 28 are 1, 2, 4, 7, and 14. Their sum is 1 + 2 + 4 + 7 + 14 = 28. |
Generate a perfect number using p = 3. | Since 2³ - 1 = 7 is prime, the formula gives 2^(3-1)(2³ - 1) = 4 × 7 = 28. |
Applications
Number theory research
Divisor-function analysis
Prime-number research
Mathematical classification
Study of unsolved mathematical problems
Prerequisites
Factors and divisors
Prime numbers
Divisor sums
Exponents
Mersenne primes
Learning Objectives
Define a perfect number.
Identify proper divisors.
Calculate the sum of proper divisors.
Verify whether an integer is perfect.
Understand the Euclid-Euler theorem.
Explain the connection between Mersenne primes and even perfect numbers.
Common Mistakes
Including the number itself among its proper divisors.
Assuming every even number is perfect.
Confusing perfect numbers with prime numbers.
Treating the existence of odd perfect numbers as a settled question.
Using the Mersenne formula without checking that the Mersenne number is prime.
Practice Questions
Show that 6 is perfect.
Verify whether 12 is a perfect number.
Find the proper divisors of 28.
What is the smallest perfect number?
State the Euclid-Euler theorem.
Why are Mersenne primes important in generating even perfect numbers?
Key Takeaway
A perfect number equals the sum of its proper divisors, and every even perfect number is connected to a Mersenne prime.
Related Topics
Mersenne Primes
Divisor Functions
Sum of Divisors
Abundant Numbers
Deficient Numbers
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.
- Source verification pending; check an authoritative textbook, university, standards body, or peer-reviewed source.
Suggest a correction or source · More in Arithmetic & Number Theory