
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 modulus m, find the least j ≥ 1 with 10^j 1 or 10^j -1 m, reducing each power of 10 from the one before.m = 33m = 27m = 77m = 91m = 73
- Lucas finds the remainder of 52,739,168 on division by 11 by signing its digits from the left:
- The first thirteen digits of π form the number N = 3,141,592,653,589.
- Maya multiplies 8,173 · 4,906 and writes the product, but one digit gets smudged:
- Write $S_b
- For n ≥ 1 let R_n be the repunit 11…1 written with n ones, so R_n = 1 + 10 + 10² + ·s + 10^n-1.
- For a positive integer n, let n be the number whose base-ten digits are those of n in reverse order, any leading zeros dropped (for example 52,317 =…
Teach it first
The free lesson teaches it with worked examples and practice problems.
Where the divisibility tests come from: 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