Find the remainder when the number 1 9 8 9 × 1 9 9 0 × 1 9 9 1 + 1 9 9 3 3 is divided by 7.
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.
For 1989 = 1 mod(7) And for 1990 = 2 mod(7) and 1991 = 3 mod(7) , Then For 1993 = 4 mod 7 or 1 9 9 3 3 = 64 mod(7) = 1 mod(7) . Now Multiplying First 3 and adding with the fourth we get 1 9 8 9 ⋅ 1 9 9 0 ⋅ 1 9 9 1 + 1 9 9 3 3 = 7 mod (7) = 0 mod 7
Problem Loading...
Note Loading...
Set Loading...
1 9 8 9 ⋅ 1 9 9 0 ⋅ 1 9 9 1 + 1 9 9 3 3 ≡ 1 ⋅ 2 ⋅ 3 + 5 3 (mod 7) ≡ 6 + 1 2 5 (mod 7) ≡ 6 + 6 (mod 7) ≡ 5 (mod 7)