
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
- Find each value.389 \bmod 12-389 \bmod 12-5 \bmod 131001 \bmod 13-1001 \bmod 14
- In music the twelve notes of an octave are numbered by pitch class:
- Find the remainder when $1!
- Find every modulus n ≥ 2 for which 100 37 n and 58 16 n, but 50 1 n.
- Decide whether each statement is true for all integers a, b, c, d and all positive integers n and k (in
- The Lucas numbers are L_1 = 1, L_2 = 3 and L_k+1 = L_k + L_k-1 for every integer k ≥ 2, so the list starts 1, 3, 4, 7, 11, 18, 29, 47, 76, …
Teach it first
The free lesson teaches it with worked examples and practice problems.
Congruence modulo n and its arithmetic: 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