Sets of Perfect Squares

Let S \mathcal{S} be the set of all perfect squares whose rightmost three digits in base 10 10 are 256 256 . Let T \mathcal{T} be the set of all numbers of the form x 2 256 1000 \frac{x^2-256}{1000} , where x x is in S \mathcal{S} . In other words, T \mathcal{T} is the set of numbers that result when the last three digits of each number in S \mathcal{S} are truncated. Find the remainder when the tenth smallest element of T \mathcal{T} is divided by 1000 1000 .


The answer is 170.

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

Johanz Piedad
Sep 15, 2015

We don't really need to think about the set T \mathcal{T} ; it is only used in the problem statement to make the actual question being asked easier to state.

All numbers x 2 x^2 in S \mathcal{S} satisfy x 2 1 6 2 0 ( m o d 1000 ) x^2 - 16^2 \equiv 0 \pmod {1000} , so ( x + 16 ) ( x 16 ) 0 ( m o d 1000 ) (x + 16)(x - 16) \equiv 0 \pmod {1000} . Obviously, x ± 16 ( m o d 1000 ) x \equiv \pm 16 \pmod {1000} works. Are there any other solutions?

Somehow we have to fit all the factors of 1000 1000 into ( x + 16 ) ( x 16 ) (x+16) * (x-16) , which includes three 5 5 s and three 2 2 s. Since x + 16 x + 16 and x 16 x - 16 differ by 32 32 , obviously all three factors of 5 5 must be in one of them. Also, if that number is not divisible by 4 4 , then the second one will not be either, and not enough factors of two will be present; so one of x ± 16 x \pm 16 must have three factors of 5 5 and two factors of 2 2 . Thus, we see all solutions are of the form x 0 ± 16 x \equiv 0 \pm 16 or x 500 ± 16 ( m o d 1000 ) x \equiv 500 \pm 16 \pmod {1000} . Listing out possible values of x x :

16 , 500 ± 16 , 1000 ± 16 , 1500 ± 16 , 2000 ± 16 , 2500 ± 16 16, 500 \pm 16, 1000 \pm 16, 1500 \pm 16, 2000 \pm 16, 2500 \pm 16 ...

With x = 2500 16 x = 2500 - 16 being the 10 10 th solution. ( 2500 16 ) 2 = 250 0 2 180000 + 256 = 6250000 180000 + 256 = 6170256 (2500-16)^2 = 2500^2 - 180000 + 256 = 6250000 - 180000 + 256 = 6170256 , and so the answer is 170 \boxed{170} .

Note that you previously defined T T as the set of x 256 1000 \frac{ x - 256 } { 1000} .

Calvin Lin Staff - 5 years, 8 months ago
Munem Shahriar
Oct 11, 2017

It is apparent that for a perfect square s 2 s^2 to satisfy the constraints, we must have s 2 256 = 1000 n s^2 - 256 = 1000n or ( s + 16 ) ( s 16 ) = 1000 n . (s+16)(s-16) = 1000n.

Now in order for ( s + 16 ) ( s 16 ) (s+16)(s-16) to be a multiple of 1000 , 1000, at least one of s + 16 s+16 and s 16 s-16 must be a multiple of 5 , 5, and since s + 16 s+16 and s 16 s-16 are in different residue classes mod 5 , 5, one term must have all the factors of 5 5 and thus must be a multiple of 125. 125.

Furthermore, each of s + 16 s+16 and s 16 s-16 must have at least two factors of 2 , 2, since otherwise ( s + 16 ) ( s 16 ) (s+16)(s-16) could not possibly be divisible by 8. 8.

So therefore the conditions are satisfied if either s + 16 s+16 or s 16 s-16 is divisible by 500 , 500, or equivalently if s = 500 n ± 16. s = 500n \pm 16.

Counting up from n = 0 n=0 to n = 5 , n=5, we see that the tenth value of s s is 500 5 16 = 2484 500 \cdot 5 - 16 = 2484 and therefore the corresponding element in T \mathcal{T} is 248 4 2 256 1000 = 6170 170. \dfrac{2484^2 - 256}{1000} = 6170 \rightarrow \boxed{170.}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...