Let S be the set of all perfect squares whose rightmost three digits in base 1 0 are 2 5 6 . Let T be the set of all numbers of the form 1 0 0 0 x 2 − 2 5 6 , where x is in S . In other words, T is the set of numbers that result when the last three digits of each number in S are truncated. Find the remainder when the tenth smallest element of T is divided by 1 0 0 0 .
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.
It is apparent that for a perfect square s 2 to satisfy the constraints, we must have s 2 − 2 5 6 = 1 0 0 0 n or ( s + 1 6 ) ( s − 1 6 ) = 1 0 0 0 n .
Now in order for ( s + 1 6 ) ( s − 1 6 ) to be a multiple of 1 0 0 0 , at least one of s + 1 6 and s − 1 6 must be a multiple of 5 , and since s + 1 6 and s − 1 6 are in different residue classes mod 5 , one term must have all the factors of 5 and thus must be a multiple of 1 2 5 .
Furthermore, each of s + 1 6 and s − 1 6 must have at least two factors of 2 , since otherwise ( s + 1 6 ) ( s − 1 6 ) could not possibly be divisible by 8 .
So therefore the conditions are satisfied if either s + 1 6 or s − 1 6 is divisible by 5 0 0 , or equivalently if s = 5 0 0 n ± 1 6 .
Counting up from n = 0 to n = 5 , we see that the tenth value of s is 5 0 0 ⋅ 5 − 1 6 = 2 4 8 4 and therefore the corresponding element in T is 1 0 0 0 2 4 8 4 2 − 2 5 6 = 6 1 7 0 → 1 7 0 .
Problem Loading...
Note Loading...
Set Loading...
We don't really need to think about the set T ; it is only used in the problem statement to make the actual question being asked easier to state.
All numbers x 2 in S satisfy x 2 − 1 6 2 ≡ 0 ( m o d 1 0 0 0 ) , so ( x + 1 6 ) ( x − 1 6 ) ≡ 0 ( m o d 1 0 0 0 ) . Obviously, x ≡ ± 1 6 ( m o d 1 0 0 0 ) works. Are there any other solutions?
Somehow we have to fit all the factors of 1 0 0 0 into ( x + 1 6 ) ∗ ( x − 1 6 ) , which includes three 5 s and three 2 s. Since x + 1 6 and x − 1 6 differ by 3 2 , obviously all three factors of 5 must be in one of them. Also, if that number is not divisible by 4 , then the second one will not be either, and not enough factors of two will be present; so one of x ± 1 6 must have three factors of 5 and two factors of 2 . Thus, we see all solutions are of the form x ≡ 0 ± 1 6 or x ≡ 5 0 0 ± 1 6 ( m o d 1 0 0 0 ) . Listing out possible values of x :
1 6 , 5 0 0 ± 1 6 , 1 0 0 0 ± 1 6 , 1 5 0 0 ± 1 6 , 2 0 0 0 ± 1 6 , 2 5 0 0 ± 1 6 ...
With x = 2 5 0 0 − 1 6 being the 1 0 th solution. ( 2 5 0 0 − 1 6 ) 2 = 2 5 0 0 2 − 1 8 0 0 0 0 + 2 5 6 = 6 2 5 0 0 0 0 − 1 8 0 0 0 0 + 2 5 6 = 6 1 7 0 2 5 6 , and so the answer is 1 7 0 .