
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 order of a modulo n is the smallest positive integer t with a^t 1 n.3 modulo 167 modulo 185 modulo 214 modulo 27
- Owen needs several powers of 7 modulo 101, so he builds one table of squares and uses it again and again.
- Find the remainder of 1 + 3 + 3² + 3³ + \cdots + 3^{200} on division by 11.
- Let n ≥ 2 be an integer, let a be an integer whose order modulo n is t (so t is the smallest positive integer with a^t 1 n), and let e and f be…
Teach it first
The free lesson teaches it with worked examples and practice problems.
Powers modulo n: 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