Remainders after division by 100

How many integers s s are there such that 0 s 99 0 \leq s \leq 99 and there exists a positive integer n n such that n 2 n^2 leaves a remainder of s s when divided by 100?


The answer is 22.

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

Calvin Lin Staff
May 13, 2014

n n is either odd ( 2 k + 1 ) (2k+1) or even ( 2 k ) (2k) , thus n 2 n^2 is either ( 2 k + 1 ) 2 = 4 k 2 + 4 k + 1 (2k+1)^2 = 4k^2+4k+1 or ( 2 k ) 2 = 4 k 2 (2k)^2 = 4k^2 . Thus, n 2 0 ( m o d 4 ) n^2 \equiv 0 \pmod{4} or n 2 1 ( m o d 4 ) n^2 \equiv 1 \pmod {4} . Also, n 2 0 , 1 , 4 , 6 , 9 , 11 , 14 , 16 , 19 , 21 , 24 ( m o d 25 ) n^2 \equiv 0, 1, 4, 6, 9, 11, 14, 16, 19, 21, 24 \pmod {25} . Since 4 , 25 4, 25 are coprime, each possibility is attainable by using the Chinese Remainder Theorem. Hence S = 22 |S|=22

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...