
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
- The Maya ritual calendar gives each day a number from 1 to 13 and one of 20 day signs, which we number 1 to 20.
- Solve the system \begin{aligned} 5x &\equiv 4 \pmod{11}, \\ 12x &\equiv 7 \pmod{13}.
- Isaac solves the system x 5 6, x 7 8.
- When Hannah's marching band lines up in rows of 5, 4 players are left over.
- Find the smallest positive integer x such that 4 divides x, 9 divides x + 1 and 25 divides x + 2.
- Find the smallest positive integer n such that n2 is a perfect square, n3 is a perfect cube and n5 is a perfect fifth power.
- Prove that for every positive integer k there are k consecutive positive integers each of which is divisible by the square of a prime.
Teach it first
The free lesson teaches it with worked examples and practice problems.
The Chinese remainder theorem: 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