Find (460·691) mod 13 without multiplying out the large numbers: reduce first.
Number theory & modular arithmetic worksheet with answers
1.Easy
n = 13
(460·691) mod 13 =
2.Easy
Find (631·787 + 173) mod 12 without multiplying out the large numbers: reduce first.
n = 12
(631·787 + 173) mod 12 =
3.Medium
Find the inverse of 6 modulo 23: the number x with 0 < x < 23 and 6·x ≡ 1 (mod 23).
a = 6n = 23
6−1 mod 23 =
4.Medium
Solve 63x ≡ 18 (mod 73). Give the solution x with 0 < x < 73.
63x ≡ 18 (mod 73)
x =
5.Hard
59 is prime. Use Fermat’s little theorem to find 98928 mod 59.
p = 59k = 8928
98928 mod 59 =
6.Hard
An RSA key uses the primes p = 7 and q = 31 and the public exponent e = 13. Find the private exponent d (0 < d < φ(n)).
p = 7q = 31e = 13
d =
Answer key
- 1. (460·691) mod 13 = 10
- 2. (631·787 + 173) mod 12 = 6
- 3. 6−1 mod 23 = 4
- 4. x = 42
- 5. 98928 mod 59 = 5
- 6. d = 97
Full step-by-step solutions: practise this topic on examproblems.com.