How many perfect square(s) are there that can be represented as the sum of six consecutive positive integers?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Same logic used .. nice problem 1 like and 1 upvote
Let the first positive integer be a , then the sum of six consecutive positive integers is S = 2 6 ( a + a + 5 ) = 6 a + 1 5 , which is divisible by 3. Then, we can assume:
6 a + 1 5 2 a + 5 2 a + 5 2 a + 5 ⟹ a = ( 3 k ) 2 = 3 k 2 = 3 ( 2 n − 1 ) 2 = 3 ( 4 n 2 − 4 n + 1 ) = 1 2 n 2 − 1 2 n + 3 = 6 n ( n − 1 ) − 1 where k ∈ N Since LHS is odd, k is odd. Let k = 2 n − 1
We note that for n ≥ 2 , a = 1 1 , 3 5 , 7 1 , . . . infinitely many of them.
Great solution! 👍
Problem Loading...
Note Loading...
Set Loading...
Let the positive integers be
{ a , a + 1 , a + 2 , a + 3 , a + 4 , a + 5 }
The sum of all these integers is
S = 2 6 ( a + a + 5 ) = 3 ( 2 a + 5 )
Let S = n 2 for some positive integer n .
Thus we have
n 2 = 3 ( 2 a + 5 ) ⟹ 3 n 2 = 2 a + 5
Since a is an integer so 2 a + 5 is also an integer. This means that n 2 must be divisible by 3.
Hence, n 2 must be divisible by 9 (since we can't have a single factor of 3 in a perfect square). This implies that n must be divisible by 3.
Let n = 3 k for some positive integer k < n .
Thus, we have
( 3 k ) 2 = 3 ( 2 a + 5 ) ⟹ 3 k 2 = 2 a + 5 ⟹ a = 2 3 k 2 − 5
Hence, for a to be a positive integer k should be an odd positive integer and k ≥ 3 .
Thus, we derive that there can exist infinitely many perfect squares that satisfy the criterion which are of the form 9 ( 2 m + 1 ) 2 where m is any positive integer.