Is the following number 2 0 1 8 1 1 … 1 1 2 0 1 9 2 2 … 2 2 5 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.
Thank you, nice and logical solution.
First Solution:
Similar to @Mark Hennings solution :
Let N = 2 0 1 8 1 1 … 1 1 × 1 0 2 0 2 0 + 2 0 1 9 2 2 … 2 2 × 1 0 + 5
N = 9 1 ( 1 0 2 0 1 8 − 1 ) × 1 0 2 0 2 0 + 9 2 ( 1 0 2 0 1 9 − 1 ) × 1 0 + 5
N = 9 1 ( 1 0 4 0 3 8 + 2 × 5 × 1 0 2 0 1 9 + 2 5 ) = [ 3 1 ( 1 0 2 0 1 9 + 5 ) 2 ]
N = ( 3 1 0 0 … 0 0 2 0 1 8 5 ) 2 = ( 2 0 1 8 3 3 … 3 3 5 ) 2 , hence N is a perfect square.
Second Solution:
Note that 9 N = 1 2 0 1 7 0 0 … 0 0 1 2 0 1 8 0 0 … 0 0 2 5 = 1 0 4 0 3 8 + 1 0 2 0 2 0 + 2 5 = ( 1 0 2 0 1 9 + 5 ) 2 ⟹ N is a perfect square.
Third Solution :
There is a lemma that states: (and it was the inspiration to the problem)
Let b be an integer greater than 5 . For each positive integer n , consider the number:
x n = n − 1 1 1 … 1 n 2 2 … 2 5
written in base b . Then the following holds true if and only if b = 1 0 ; that there exists a positive integer M such that for every integer n greater than M , the number x n is a perfect square.
My logic : nobody just comes with a 4038 digit number and asks whether it is a perfect square, so it must be a perfect square :p
yeah, you are right.
Problem Loading...
Note Loading...
Set Loading...
For any integer N consider the number S N = × N 1 1 1 ⋯ 1 × ( N + 1 ) 2 2 2 ⋯ 2 5 for then S N = 9 1 0 N − 1 × 1 0 N + 2 + 2 9 1 0 N + 1 − 1 × 1 0 + 5 = 9 1 1 0 2 N + 2 − 9 1 1 0 N + 2 + 9 2 1 0 N + 2 − 9 2 0 + 5 = 9 1 ( 1 0 2 N + 2 + 1 0 N + 2 + 2 5 ) = 9 1 ( 1 0 N + 1 + 5 ) 2 and hence S N is the square of 3 1 ( 1 0 N + 1 + 5 ) .