Find the least common multiple lcm(159, 33). Use Euclid’s algorithm for the gcd first.
Number theory & modular arithmetic worksheet with answers
1.Easy
a = 159b = 33
lcm(159, 33) =
2.Easy
Find (−74) mod 6, the remainder r with 0 ≤ r < 6.
a = −74n = 6
(−74) mod 6 =
3.Medium
Solve 26x ≡ 5 (mod 55). Give the solution x with 0 < x < 55.
26x ≡ 5 (mod 55)
x =
4.Medium
Find the inverse of 39 modulo 74: the number x with 0 < x < 74 and 39·x ≡ 1 (mod 74).
a = 39n = 74
39−1 mod 74 =
5.Hard
23 is prime. Use Fermat’s little theorem to find 720920 mod 23.
p = 23k = 20920
720920 mod 23 =
6.Hard
Use repeated squaring to find 231 mod 35.
a = 2k = 31n = 35
231 mod 35 =
Answer key
- 1. lcm(159, 33) = 1749
- 2. (−74) mod 6 = 4
- 3. x = 15
- 4. 39−1 mod 74 = 19
- 5. 720920 mod 23 = 8
- 6. 231 mod 35 = 23
Full step-by-step solutions: practise this topic on examproblems.com.