
Page 1 of 3
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 greatest common divisor and write it as an integer combination of the two numbers, by back substitution or by the table form.\gcd(1073, 851)\gcd(546, 399)\gcd(97, 61)
- Hiro ran the table form on a = 1001 and b = 221, meaning to keep the promise r = 1001x + 221y in every row.
- Elena is inventing a calendar for a story world.
- Find every point (x, y) with integer coordinates on the line 15x - 21y = 33 that lies in the square -10 ≤ x ≤ 10, -10 ≤ y ≤ 10.
- Decide whether each statement is true for every integer n.
- Let a and b be integers with b ≥ 1 and (a, b) = 1.
Teach it first
The free lesson teaches it with worked examples and practice problems.
Bezout's identity and the extended Euclidean algorithm: 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