True or false ? Sqares #2

For all positive integers n n , there exists a positive integer k k , such that n n . . . n k times \underbrace{\overline {nn...n} }_\text{k times} is a perfect sqaure.

True or false ?

Note : n n \overline {nn} stands for the concatenation of n n and n n in their decimal representation. Examples : For n = 5 n=5 , n n = 55 \overline {nn}=55 and for n = 1663 n=1663 , n n n = 166316631663 \overline {nnn}=166316631663 .

False True

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.

1 solution

Mark Hennings
May 26, 2019

No square ends in 2 2 , so there is no integer k k in the case n = 2 n=2 .

I wonder if the question should have been the other way around? (ie, is it true that for any k k there exists an n n ...) Perhaps that's coming up.

Chris Lewis - 2 years ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...