A 701-digit number is to be formed by only using the digits 6 and 0 for 600 and 101 times respectively. How many possible ways to arrange the digits such that the resultant number is 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.
Case 1: The number ends in 2 n zeroes.
Then it is divisible by 1 0 2 n , which implies it is divisible by 2 2 n . However, since there is a 6 to the left, it is then divisible maximally by 2 2 n + 1 , which means it can never be a square.
Case 2: The number ends in 2 n + 1 zeroes.
Then it is divisible by 1 0 2 n + 1 , which implies it is divisible by 5 2 n + 1 . However, since there is a 6 to the left, it is then divisible maximally by 5 2 n + 1 , which means it can never be a square.
Thus, 0 solutions exist.
Problem Loading...
Note Loading...
Set Loading...
http://burningmath.blogspot.in/2013/09/how-to-check-if-number-is-perfect-square.html