How this instrument works
The modulo operation a mod b answers one question: what remainder is left over once you divide a by b as many whole times as you can, throwing away the quotient and keeping only what didn't fit? Split 17 objects into groups of 5 and you get three full groups with two objects left on the table — that leftover, 2, is 17 mod 5. Ordinary division tells you how many whole groups exist; modulo discards that count and reports only the scraps.
The idea is both old and formal. Carl Friedrich Gauss built a branch of number theory on it in 1801, writing a ≡ r (mod b) to say two numbers leave the same remainder under b. Geometrically it wraps a number line into a loop of length b — count upward from zero and once you pass b you land back near zero and keep going, which is exactly why a 24-hour clock, a seven-day week, and a hash table's bucket index all lean on the same operation.
Two edges are worth knowing before you type numbers in. When a divides evenly, the remainder collapses to exactly zero — 20 mod 5 = 0 — the standard test for divisibility used throughout number theory. And b can never be zero, since 'how many objects fit in a group of nothing' has no answer; this sheet's b field enforces a minimum just above zero to keep the operation defined.
- Type the number being divided into the a field — this is the dividend, the total you're splitting into groups.
- Type the group size into the b field — this is the divisor, and it must be a positive number.
- Read the a mod b field for the result: the remainder left over after dividing as many whole times as possible, quotient discarded.
- Change either value and the remainder recalculates instantly, so you can check a whole run of divisors against one dividend in seconds.
Worked example — 17 mod 5
Set a to 17 and b to 5. Five goes into seventeen three whole times — 5 × 3 = 15 — leaving 17 − 15 = 2 remaining, so the a mod b field reports 2, exactly the golden value this sheet is checked against on every deploy. The quotient, 3, never appears in the output; modulo deliberately discards it and keeps only the leftover.
Picture the same numbers as 17 unit squares stacked into rows of 5: three rows fill completely using 15 squares, and a fourth row starts with just 2 squares before running out — that incomplete row is the remainder made visible. Change b to 6 with a still 17 and the rows resize to six squares each, leaving a different remainder, 5, which a fresh calculation confirms instantly.
Questions
What does a mod b actually compute?
It is the remainder after dividing a by b as many whole times as possible — whatever is left once every full group of size b has been removed. For 17 mod 5, three groups of 5 use 15, leaving a remainder of 2.
Why is modulo used for clock arithmetic?
A clock face resets every 12 or 24 hours, which is exactly what modulo models: 13 mod 12 = 1, so 13:00 reads as 1:00. Any cycle that repeats after a fixed count — days of the week, hash buckets, pixel wraparound — is modulo in disguise.
How can I tell if a number is even using modulo?
Compute n mod 2. A remainder of 0 means n divides evenly by 2, so it is even; a remainder of 1 means one unit is left over, so n is odd. This is the standard divisibility test number theory builds on for any divisor, not just 2.
What happens when a mod b equals zero?
A remainder of exactly zero means b divides a with nothing left over — 20 mod 5 = 0, because 5 fits into 20 exactly four times with no remainder. That zero result is the formal definition of 'b divides a' used throughout number theory.
Does modulo work the same way with negative numbers?
The definition still holds, but the sign of the result depends on convention: this engine matches the divisor's sign, which can surprise anyone used to a tool that matches the dividend instead. A dedicated sheet on negative dividends works through exactly that case in detail.
Is a mod b the same thing as a divided by b?
No — ordinary division gives the quotient, how many whole groups fit; modulo gives only the remainder, what is left over. The two are partners in one identity: a equals b times the quotient plus the remainder, always.