How many terms in the following sequence are perfect squares?
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.
Notice . . . 1 1 9 = 1 1 6 + 3 = 4 k + 3 for some integer k .
By division algorithm Every integer is of form 4k,4k+1,4k+2 or 4k+3,
Now, ( 4 k ) 2 = 1 6 k 2 = 4 j ( 4 k + 1 ) 2 = 1 6 k 2 + 8 k + 1 = 4 p + 1 ( 4 k + 2 ) 2 = 1 6 k 2 + 1 6 k + 4 = 4 l ( 4 k + 3 ) 2 = 1 6 k 2 + 2 4 k + 9 = 4 m + 1
For some j , p , l , m
From this we see that every square number is of form 4 k , 4 k + 1 .
Now we have to find such a square number whose form is 4 k + 3 .
But we know that every square number is of form 4 k , 4 k + 1 but not of 4 k + 3 .
Therefore there are 0 square numbers in sequence.