Find the number of natural numbers n such that for each natural number n , one of the numbers in the sequence 1 4 n + 1 1 , 1 4 n + 1 1 1 , 1 4 n + 1 1 1 1 , … is 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.
Awesome explanation man. Thank you so much.
perhaps I am being silly, but it is not obvious to me that every term of the sequence is of the form 4k+3. Could you explain how you saw this please, thanks : )
Log in to reply
Whenever n ≥ 2 , 1 4 n will be a multiple of 4 since there will be more than one factor of 2 and the remaining terms i.e. 1 1 , 1 1 1 , 1 1 1 1 , … will always leave a remainder of 3 when divided by 4 . Hence, every term of the sequence will be of the form 4 k + 3 .
Observe that for n=1, the first term of the sequence is a perfect square. For n>=2, all the terms of the sequence are of the form 4k+3 So they cant be perfect squares.
Ans= 1
I have elaborated the solution. Please have a look. Thanks.
Problem Loading...
Note Loading...
Set Loading...
Case 1: n = 1
By mere observation, First term of the sequence 1 4 1 + 1 1 = 2 5 = 5 2 is a perfect square.
Case 2: n ≥ 2
Every term of the sequence is of the form 4 k + 3 where k ∈ N
Every number is either of the form 4 m or 4 m + 1 or 4 m + 2 or 4 m + 3 where m ∈ Z
( 4 m ) 2 = 1 6 m 2 = 4 k where k = 4 m 2
( 4 m + 1 ) 2 = 1 6 m 2 + 8 m + 1 = 4 k + 1 where k = 4 m 2 + 2 m
( 4 m + 2 ) 2 = 1 6 m 2 + 1 6 m + 4 = 4 k where k = 4 m 2 + 4 m + 1
( 4 m + 3 ) 2 = 1 6 m 2 + 2 4 m + 9 = 4 k + 1 where k = 4 m 2 + 6 m + 2
∴ No perfect square is of the form 4k+3
Hence the only solution is n = 1