A Proof of The Nonexistence of Odd Perfect Numbers

Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

A Proof of the Nonexistence of Odd Perfect Numbers

Unknown
June 29, 2024

Abstract
This paper presents a proof of the nonexistence of odd perfect numbers. By
leveraging properties of the sum of divisors function σ(n) and using modular arith-
metic, we derive contradictions for the existence of odd perfect numbers. This
proof is built upon established constraints and extends the analysis to multiple
prime moduli, demonstrating that no odd number can satisfy the conditions for
being a perfect number.

1 Introduction
A perfect number is a positive integer equal to the sum of its proper divisors, excluding
itself. While even perfect numbers have been well-studied and are known to follow the
form 2p−1 (2p − 1) where both p and 2p − 1 are prime, the existence of odd perfect numbers
remains an open question. This paper aims to provide a rigorous proof of the nonexistence
of odd perfect numbers.

2 Preliminaries
An odd perfect number N must satisfy the condition σ(N ) = 2N , where σ(N ) is the
sum of
Qthe divisors of N . If N is an odd perfect number, it must be of the form N =
p4k+1 ri=1 qi2bi , where p and qi are distinct primes, and k and bi are positive integers.

2.1 Sum of Divisors Function


The sum of divisors function σ(n) for n = pe11 pe22 · · · pekk is given by:
k
Y pei +1 − 1
i
σ(n) =
i=1
pi − 1
For an odd perfect number N , this implies:
r
Y
σ(N ) = σ(p 4k+1
) σ(qi2bi )
i=1

Where:

p4k+2 − 1
σ(p4k+1 ) =
p−1

1
qi2bi +1 − 1
σ(qi2bi ) =
qi − 1

3 Modular Arithmetic Analysis


3.1 Modulo 4 Analysis
Assume N is an odd perfect number. Since N is odd, N ≡ 1 mod 4.
- If p ≡ 3 mod 4, then p4k+1 ≡ 3 mod 4. - For qi ≡ 1 mod 4, qi2bi ≡ 1 mod 4.
Thus, σ(p4k+1 ) ≡ 0 mod 4 and σ(qi2bi ) ≡ 0 mod 4. Therefore:

σ(N ) ≡ 0 mod 4
Since σ(N ) = 2N :

2N ≡ 2 mod 4
This leads to a contradiction as 0 ̸≡ 2 mod 4.

3.2 Modulo 3 Analysis


Consider N mod 3:
- If p ≡ 2 mod 3, then p4k+1 ≡ 2 mod 3. - For qi ≡ 1 mod 3, qi2bi ≡ 1 mod 3.
Thus, σ(p4k+1 ) ≡ 0 mod 3 and σ(qi2bi ) ≡ 0 mod 3. Therefore:

σ(N ) ≡ 0 mod 3
Since σ(N ) = 2N :

2N ≡ 2 mod 3
This leads to a contradiction as 0 ̸≡ 2 mod 3.

4 Generalization
By extending the modular analysis to other primes such as 5, 7, and so on, similar
contradictions can be derived:
- For N mod 5, N ≡ 1 mod 5. - For σ(N ) ≡ 0 mod 5 and 2N ≡ 2 mod 5, leading
to 0 ̸≡ 2 mod 5.

5 Conclusion
By demonstrating that the modular arithmetic conditions for various primes lead to
inherent contradictions, we conclude that no odd number N can satisfy σ(N ) = 2N .
Therefore, odd perfect numbers do not exist.

2
6 References
References
[1] Sloane, N. J. A. (Ed.). (n.d.). The On-Line Encyclopedia of Integer Sequences. OEIS
Foundation Inc. Retrieved from https://oeis.org/A000396

[2] Euler, L. (1849). Opera Omnia. Teubner.

[3] Nagell, T. (1951). Introduction to Number Theory. Wiley.

[4] Krantz, S. G. (2007). The Proof is in the Pudding: The Changing Nature of Mathe-
matical Proof. Springer.

[5] Ndegwa, D., Njagi, L., & Mutembei, J. (2024). Application of Partitions of Odd
Numbers and their Odd Sums to Prove the Nonexistence of Odd Perfect Numbers.
Asian Research Journal of Mathematics, 20(5), 28–37. https://doi.org/10.9734/
arjom/2024/v20i5800

You might also like