Let be a positive integer satisfying the relation
Find the sum of all the solutions in the range .
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.
Let us 'peel' the solution layer by layer.
Layer 1
Consider the problem of finding i 2 m o d 4 for a positive integer i .
If i = 2 m is even, then i 2 m o d 4 = 4 m 2 m o d 4 = 0 , and
if i = 2 m + 1 is odd, then i 2 m o d 4 = 4 ( m 2 + m ) + 1 m o d 4 = 1
Layer 2
(ODD i) Now if i is an odd number i i 2 = i 4 k + 1 for some k
and hence for odd i
i i 2 m o d 1 0 = ( i m o d 1 0 ) i 2 = ( i m o d 1 0 ) 4 k ( i m o d 1 0 )
It is interesting to note that 1 4 m o d 1 0 = 3 4 m o d 1 0 = 7 4 m o d 1 0 = 9 4 m o d 1 0 = 1 and 5 4 m o d 1 0 = 5 and
further that 1 k m o d 4 = 1 and 5 k m o d 4 = 5
Hence, i i 2 m o d 1 0 = i m o d 1 0 for all odd numbers.
(EVEN i) If i is an even number, i i 2 = i 4 k for some k , which results in
i i 2 m o d 1 0 = ( i m o d 1 0 ) i 2 = ( i m o d 1 0 ) 4 k ( i m o d 1 0 )
It is again interesting to see that for even i , not divisible by 10, 2 4 m o d 1 0 4 4 m o d 1 0 = 6 4 m o d 1 0 = 8 4 m o d 1 0 = 6
Further, 6 k m o d 1 0 = 6
Hence, for any even number which is not 0 modulo 10, i i 2 m o d 1 0 = 6
Layer 3
Now a table can be formed
Layer 4
Using the above table for evaluating the sum for various n , it can be seen that L H S = n m o d 1 0 for n = 8 , 9 , 3 2 , 3 6 , 4 4
Therefore, we have the solution to be 8 + 9 + 3 2 + 3 6 + 4 4 = 1 2 9