
Page 1 of 2
Download
Get this sheet
SubscriptionOpen any sheet in any course, up to 40 a month, keys included. Or $40 month to month.
$25/mo, billed yearly
SubscribeTry one first: a free Chapter 1 worksheet (PDF, no sign-in).
What's on the worksheet
- For each pair, find (a, n) with the Euclidean algorithm.a = 8, n = 27a = 21, n = 91a = 38, n = 105a = 64, n = 99a = 91, n = 130
- Modulo a prime p, a fraction ab with p b can be given a meaning:
- An affine cipher numbers the letters A = 0, B = 1, , Z = 25, and replaces the letter numbered x by the letter numbered (11x + 4) 26.
- A Ferris wheel has 40 cars, numbered 0 to 39 in order around the wheel.
- Let p ≥ 3 be a prime.
Teach it first
The free lesson teaches it with worked examples and practice problems.
Modular inverses and linear congruences: the lesson ›More Chapter 8 worksheets: Number theory and modular arithmetic
- 8.1Every number has exactly one prime factorization
- 8.2The division algorithm
- 8.3Numbers in other bases
- 8.4The Euclidean algorithm and coprime numbers
- 8.5Bezout's identity and the extended Euclidean algorithm
- 8.6Congruence modulo n and its arithmetic
- 8.7Relations, equivalence classes and partitions
- 8.8Where the divisibility tests come from
- 8.9Powers modulo n
- 8.10Modular inverses and linear congruences
- 8.11The Chinese remainder theorem
- 8.12Fermat's little theorem
- 8.13RSA public-key encryption