Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 4.2.19 (Every even perfect number has the form $2^{n-1} q$, where $q = 2^n - 1$ is prime)

Exercise 4.2.19 (Every even perfect number has the form $2^{n-1} q$, where $q = 2^n - 1$ is prime)

Prove that every even perfect number has the form given in Problem 16.

Hint. Assume that 2 n 1 q is a perfect number, where n > 1 and q is odd. Write σ ( q ) = q + k and so deduce from σ ( 2 n 1 q ) = 2 n q that q = k ( 2 n 1 ) . Thus k q and k < q .

Answers

Proof. Let m be an even perfect number. Since m 1 , we can write m in the form m = 2 n 1 q , where q is odd, and n > 1 because m is even.

We know that σ ( q ) q for all positive integer q , so σ ( q ) = q + k for some k 0 .

By definition of a perfect number, σ ( m ) = 2 m , so

σ ( 2 n 1 q ) = 2 n q . (1)

Since σ is multiplicative, and q is odd, by Theorem 4.5,

σ ( 2 n 1 q ) = ( 2 n 1 ) σ ( q ) = ( 2 n 1 ) ( q + k ) . (2)

The comparison of (1) and (2) gives 2 n q = ( 2 n 1 ) ( q + k ) , therefore

q = k ( 2 n 1 ) .

This shows that k q and k < q , because n > 1 . By Problem 18, we obtain that k = 1 , so σ ( q ) = q + 1 , and by Problem 17, q is a prime.

Thus m = 2 n 1 q where q = 2 n 1 is a prime, thus m has the form given by Euclid. □

User profile picture
2025-01-15 11:56
Comments