Find the remainder when is divided by 1990.
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.
We know that X = 1 9 9 0 = 2 × 5 × 1 9 9 . Using Euler's Theorem, we have
X ≡ ⎩ ⎪ ⎨ ⎪ ⎧ 0 ( m o d 2 ) 4 ( m o d 5 ) 2 9 ( m o d 1 9 9 )
We can write those congruences into equations for t , s , and u :
X = ⎩ ⎪ ⎨ ⎪ ⎧ 2 t 5 s + 4 1 9 9 u + 2 9
Start by substituting firs equation to second congruence:
2 t ≡ 4 ( m o d 5 ) t ≡ 2 ( m o d 5 )
meaning that t = 5 s + 2 . Substitute t into the first equation:
X = 2 t = 1 0 s + 4 . Substitute this X into the third congruence:
2 s 2 s s 1 0 s + 4 ≡ 5 ( m o d 1 9 9 ) ≡ 2 0 4 ( m o d 1 9 9 ) ≡ 1 0 2 ( m o d 1 9 9 ) ≡ 2 9 ( m o d 1 9 9 )
meaning that s = 1 9 9 u + 1 0 2 . Finally,
X = 1 0 ( 1 9 9 u + 1 0 2 ) + 4 = 1 9 9 0 u + 1 0 2 4 ≡ 1 0 2 4 ( m o d 1 9 9 0 )