
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 greatest common divisor with the Euclidean algorithm.\gcd(1147, 899)\gcd(2002, 1547)\gcd(611, 425)\gcd(-1728, 1080)
- Priya has three rolls of fabric, 1764, 2520 and 3150 centimeters long.
- Malik packs 1194 pencils into boxes that each hold n pencils, filling as many boxes as he can, and 5 pencils are left over.
- Before division with remainder was common, the algorithm was run by subtraction alone:
- Decide whether each statement is true for all positive integers a, b and c.
- The Fibonacci numbers are F_1 = 1, F_2 = 1 and F_k+1 = F_k + F_k-1 for every integer k ≥ 2, so the list starts 1, 1, 2, 3, 5, 8, 13, … Every F_k is…
Teach it first
The free lesson teaches it with worked examples and practice problems.
The Euclidean algorithm and coprime numbers: 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