Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 7.8.5* ($\sum_{i=1}^n i = m^2$ has infinitely many solutions)

Exercise 7.8.5* ($\sum_{i=1}^n i = m^2$ has infinitely many solutions)

Prove that the sum of the first n natural numbers is a perfect square for infinitely many values of n .

Answers

Proof. The sum S n of the first n natural numbers is S n = i = 1 n i = ( n ( n + 1 ) ) 2 .

For all positive integers n , m , we have the following equivalence:

n ( n + 1 ) 2 = m 2 n 2 + n 2 m 2 = 0 4 n 2 + 4 n 8 m 2 = 0 ( 2 n + 1 ) 2 8 m 2 = 1 .

Let ( x , y ) be any positive solution of x 2 8 y 2 = 1 . Then x 2 = 8 y 2 + 1 is odd, so x is odd. There exists some integer n such that x = 2 n + 1 . Put m = y . Then ( 2 n + 1 ) 2 8 m 2 = 1 , so n ( n + 1 ) 2 = m 2 .

By Theorem 7.25, there are infinitely many positive solutions of x 2 8 y 2 = 1 . For each such solution, ( n , m ) = ( ( x 1 ) 2 , y ) is a solution of n ( n + 1 ) 2 = m 2 .

Therefore the sum of the first n natural numbers is a perfect square for infinitely many values of n . □

Note: the first solutions are

S 1 = 1 2 , S 8 = 6 2 , S 49 = 3 5 2 , S 288 = 20 4 2 , S 1681 = 118 9 2 ,
User profile picture
2025-08-25 09:14
Comments