← Divide & Conquer

Micro-Drill #83 — Modular arithmetic

Divide & Conquer Target: 10s

Modular arithmetic prevents overflow in combinatorics. pow(a,b,m) is built-in fast mod-exp.

(a * b) % m
pow(a, b, m)  # fast modular exponentiation

Type it from memory. Go.

Practice Problems

← Micro #82 Micro #84 →