Consider a sum of square of n arbitrary odd integers. In which of the following cases the given sum cannot be a perfect square.
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.
( n + 1 ) 2 = n 2 + ( 2 n + 1 )
meaning that ( n + 1 ) 2 (a square), can be written as the sum of another square n 2 plus 2 n + 1 of 1 2 (another square). So, if we take n to be an odd number, we have found a group of 2 n + 2 = 2 ( n + 1 ) odd squares that sum up to a square. For n = 1 , 3 , 5 , 7 , the length of the sum would be 4 , 8 , 1 2 , 1 6 respectively and it would cover all the options, except n = 2 , which is actually well-known due to Pythagorean triples.
Problem Loading...
Note Loading...
Set Loading...
Note that a perfect square is always of the form 4 k or 4 k + 1 . (Consider squares of odd and even numbers)
Now, sum of square of two odd numbers is,
( 2 m + 1 ) 2 + ( 2 n + 1 ) 2 = ( 4 m 2 + 4 m + 1 ) + ( 4 n 2 + 4 n + 1 ) = 4 k + 2 , which cannot be a perfect square.
Likewise is not true for the other 3 cases.