LOGIC & PUZZLES / NUMBER SENSE
Modular arithmetic
is clock arithmetic.
When a count wraps around, the remainder tells you where the cycle resumes.
THE MAIN IDEA
Remainders describe repeating cycles.
Ordinary arithmetic continues along an unbounded number line. Modular arithmetic groups numbers by their remainder after division by a fixed positive integer. On a twelve-hour clock, thirteen o'clock is equivalent to one o'clock because adding twelve returns the display to the same position. We say the two numbers are congruent modulo twelve. Days of the week cycle modulo seven, so adding ten days has the same weekday effect as adding three. This idea provides a compact language for repeated patterns without listing every intermediate count. For any integer n divided by m, the remainder lies between zero and m minus one under the usual mathematical convention. Negative numbers can make programming-language remainder operators behave differently from the mathematical modulo operation, so handling negative values requires checking the language's rules. Adding and multiplying congruent remainders preserves congruence: if two counts land on the same clock position, adding the same number of hours to each still lands them together. Exponent cycles often repeat too; checking remainders of small powers can expose a pattern for very large exponents. Modular arithmetic can test divisibility, reason about checksums, and identify possible positions in a sequence. It does not mean that every problem involving a clock has a simple cycle: daylight-saving changes, leap seconds, calendar months, and different time-zone rules complicate real timekeeping. The seven-day weekday cycle is stable, but date arithmetic across months must also include the varying month lengths and leap years. Write down the modulus and what the remainder represents in plain language before manipulating symbols. For example, “remainder three means Wednesday” only after you specify the starting day and whether the count includes today. Off-by-one mistakes are not failures of arithmetic; they usually mean the starting convention was never defined. In code, testing a cycle at zero, one, and just before the wraparound is a good way to catch boundary errors. A clock drawing provides an intuitive first model; the same reasoning generalizes to rotations, repeating machine states, musical beats, and identifiers that intentionally wrap. Whenever something repeats, remainders offer a way to describe its phase without carrying a gigantic count.
TRY THIS
Predict a weekday from a known start.
Choose a known weekday and add 100 days using remainders modulo seven. Write how the remainder maps to the weekday, then verify with a calendar. Be explicit about whether you are counting today as day zero or day one.