The Square Problem!

Find the number of natural numbers n such that for each natural number n , one of the numbers in the sequence 1 4 n + 11 , 1 4 n + 111 , 1 4 n + 1111 , 14^n+11, 14^n+111, 14^n+1111, \ldots is a perfect square.


The answer is 1.

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.

2 solutions

Rishik Jain
Jan 6, 2016

Case 1: n = 1 \textbf{Case 1: } n=1

By mere observation, First term of the sequence 1 4 1 + 11 = 25 = 5 2 14^1 + 11=25=5^2 is a perfect square.

Case 2: n 2 \textbf{Case 2: } n \ge 2

Every term of the sequence is of the form 4 k + 3 4k+3 where k N k \in \mathbb N


Every number is either of the form 4 m 4m or 4 m + 1 4m+1 or 4 m + 2 4m+2 or 4 m + 3 4m+3 where m Z m \in \mathbb Z

( 4 m ) 2 = 16 m 2 = 4 k where k = 4 m 2 (4m)^2 = 16m^2 = \boxed{4k} \text{ where }k=4m^2

( 4 m + 1 ) 2 = 16 m 2 + 8 m + 1 = 4 k + 1 where k = 4 m 2 + 2 m (4m+1)^2 = 16m^2 + 8m+1 = \boxed{4k+1} \text{ where } k=4m^2+2m

( 4 m + 2 ) 2 = 16 m 2 + 16 m + 4 = 4 k where k = 4 m 2 + 4 m + 1 (4m+2)^2 = 16m^2 + 16m + 4 = \boxed{4k} \text{ where } k=4m^2+4m+1

( 4 m + 3 ) 2 = 16 m 2 + 24 m + 9 = 4 k + 1 where k = 4 m 2 + 6 m + 2 (4m+3)^2 = 16m^2+24m+9 = \boxed{4k+1} \text{ where }k=4m^2+6m+2

No perfect square is of the form 4k+3 \therefore \textbf{No perfect square is of the form 4k+3}

Hence the only solution is n = 1 \large \boxed{n=1}

Awesome explanation man. Thank you so much.

Samved Rajvanshi - 5 years, 5 months ago

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 : )

Ryan Garvey - 5 years, 5 months ago

Log in to reply

Whenever n 2 n \ge 2 , 1 4 n 14^{n} will be a multiple of 4 4 since there will be more than one factor of 2 2 and the remaining terms i.e. 11 , 111 , 1111 , 11,111,1111, \dots will always leave a remainder of 3 3 when divided by 4 4 . Hence, every term of the sequence will be of the form 4 k + 3 4k+3 .

Rishik Jain - 5 years, 5 months ago

Log in to reply

Awesome thanks : )

Ryan Garvey - 5 years, 5 months ago
Shrihari B
Dec 21, 2014

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.

Rishik Jain - 5 years, 5 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...