Modular Arithmetic Practice
Modular Arithmetic Practice
Part I
Part II
1. [Solution: 6]
2. [Solution: 1] 7100 ≡ (72)50 ≡ 4950 ≡ (−1)50 ≡ 1 mod 10.
3. [Solution: Thursday] There are either 65+200 = 265 or 66+200 = 266 days between the
first two dates depending upon whether or not year N is a leap year. Since 7 divides into
266, then it is possible for both dates to Tuesday; hence year N + 1 is a leap year and N
−1 is not a leap year. There are 265 + 300 = 565 days between the date in years N, N −1,
which leaves a remainder of 5 upon division by 7. Since we are subtracting days, we
count 5 days before Tuesday, which gives us Thursday.
4. [Solution: 80] The sum of the first three numbers is divisible by 3. The sum of the first
four numbers is divisible by 4. If we write out all 5 numbers in mod 3, we get 2,1,2,1,1,
respectively. Clearly the only way to get a number divisible by 3 by adding three of these
is 1 + 1 + 1, so those scores must be entered first. Now we have an odd sum, so we must
add 71 in order for the sum to be divisible by 4. That leaves 80 for the last score entered.
Continue with more questions in your textbooks. Don’t forget to try some past questions
too