Remainder Patterns
Remainders combine cleanly, which lets you replace giant numbers with their small remainders before computing. The rules: the remainder of a sum is the sum of the remainders (then reduced), and the remainder of a product is the product of the remainders (then reduced). So to find the remainder of 17 × 23 on division by 5, replace 17 by 2 and 23 by 3: 2 × 3 = 6, which leaves remainder 1. For powers, first find the remainder of the base, then look for a short cycle in the powers of that remainder. A useful special case: any power of a number ending in the same digit as the divisor pattern can collapse quickly — for division by 5, only the units digit matters (units 0 or 5 → remainder 0; units 1 or 6 → remainder 1, and so on). Reducing early is the whole trick; it keeps every number small enough for mental math.
✅ Solved examples
✏️ Practice — try these, take hints as needed
📝 Topic test — 8 questions
Auto-graded with full solutions; saved to your dashboard. Use the calculator and formula sheet (top-right) any time.
Formula Reference Sheet
Division & remainders
| Division identity | N = d·q + r, 0 ≤ r < d |
|---|---|
| Remainder range | 0 to (divisor − 1) |
| Remainder of a sum | (r₁ + r₂) mod d |
| Remainder of a product | (r₁ × r₂) mod d |
Units-digit cycles
| Cycle of 2 | 2, 4, 8, 6 (length 4) |
|---|---|
| Cycle of 3 | 3, 9, 7, 1 (length 4) |
| Cycle of 7 | 7, 9, 3, 1 (length 4) |
| Cycle of 8 | 8, 4, 2, 6 (length 4) |
| Stable digits | 0,1,5,6 repeat unchanged |