Division usually gets all the attention, but the remainder is often the more useful part. When you divide 17 by 5, the quotient is 3 and the remainder is 2. That remainder is the modulo, written 17 mod 5 = 2. The Modulo Calculator computes remainders like this, and although the operation looks elementary, it quietly runs clocks, calendars, weekly schedules, and a great deal of computer programming. Understanding modulo means understanding cycles, and cycles are everywhere once you start looking for them.
The definition is simple: a mod b is the remainder left when a is divided by b. The divisor, b, is called the modulus. The result always lies in a fixed range determined by the modulus. For a positive modulus, the usual mathematical result lies between 0 and b minus 1. So any number mod 7 gives an answer from 0 to 6, and any number mod 12 gives an answer from 0 to 11. That bounded range is the whole point. Modulo takes an unbounded input, any integer at all, and folds it into a small set of possible outputs, which is exactly what you need when something repeats. Days of the week repeat every 7, hours repeat every 12 or 24, and months repeat every 12, so modulo is the natural arithmetic of repeating things.
Clocks are the friendliest example. If it is 10 o'clock now, what time will it be in 5 hours? Ten plus five is 15, and 15 mod 12 is 3, so the answer is 3 o'clock. The clock does the modulo for you by wrapping around. Calendars work the same way. If today is Wednesday and an event repeats every 10 days, the weekday shifts by 10 mod 7, which is 3, so the next occurrence falls on a Saturday. Programmers use modulo for equally practical jobs: checking whether a number is even (n mod 2 equals 0), cycling through items in a list, wrapping an index back to the start, and generating repeating patterns. None of these jobs needs the quotient; the remainder is the entire answer.
A worked example
Work through 29 mod 6 by hand. Six goes into 29 four times, because 6 times 4 is 24. Subtracting 24 from 29 leaves 5, so 29 mod 6 equals 5. You can verify this by the reconstruction check: quotient times modulus plus remainder should equal the original number, and 4 times 6 plus 5 is indeed 29. A second example uses a larger modulus. For 100 mod 7, seven goes into 100 fourteen times, because 7 times 14 is 98, leaving a remainder of 2, so 100 mod 7 equals 2. In calendar terms, 100 days from a Monday is a Wednesday, because the weekday advances by 2. These are sample values chosen for clarity, but the method is identical for any integers: find the largest multiple of the modulus that does not exceed the number, subtract, and the difference is the remainder.
Negative numbers are where modulo gets interesting, and where different tools can disagree. Mathematically, the remainder is usually defined to be non-negative when the modulus is positive, so -7 mod 5 equals 3, because -7 plus 10 is 3, and 3 is the value in the range 0 to 4 that differs from -7 by a multiple of 5. Some programming languages, however, return a remainder with the sign of the dividend, giving -2 for the same calculation. Both conventions are internally consistent, but they answer slightly different questions, and mixing them up causes real bugs. Before relying on a modulo result involving negative numbers, check which convention your tool or language uses. If you are doing calendar arithmetic backwards in time, the non-negative convention is usually the one that matches intuition, since weekdays do not have negative names.
Common mistakes
The most common mistake is confusing the remainder with the quotient, reporting 3 instead of 2 for 17 mod 5. The second mistake is forgetting that modulo by zero is undefined: there is no remainder when dividing by zero, because division by zero has no meaning. The third mistake is assuming remainders are always smaller than the original number in absolute terms without checking the sign convention for negatives. The fourth mistake is applying modulo to decimals without care. Some tools extend modulo to non-integers, but the classic definition and most everyday uses involve whole numbers, and decimal remainders can behave surprisingly. The fifth mistake is using modulo where a different operation is needed, for example using a remainder to split a bill, where division and rounding are the right tools instead. Modulo answers "what is left over" and "where in the cycle are we"; if your question is neither of those, another operation probably fits better.
Honest limitations
A modulo calculator answers a single arithmetic question. It does not know whether your cycle genuinely repeats with the modulus you chose, and choosing the wrong modulus is the most consequential error available. A weekly rota repeats every 7 days only if nobody works weekends differently; a monthly cycle is not exactly every 30 days; a clock modulo 12 loses the distinction between morning and evening. The calculator also cannot resolve the sign-convention question for you; it implements one convention, and you must confirm it matches your purpose when negatives are involved. Finally, modulo is a tool for integers and cycles, not a general-purpose problem solver. It will not tell you why a schedule clashes or whether a pattern is fair; it will only tell you where in a cycle a number falls, and the interpretation remains yours.
Closing
Modulo earns its place by turning repetition into arithmetic: find the remainder, and you know the position in the cycle. Learn the definition, check the sign convention for negatives, and verify with the reconstruction check, and remainders become a reliable everyday tool. For neighbouring jobs, the Percentage Calculator handles proportional arithmetic and the Average Calculator summarises sets of numbers, while Average Calculator Guide explains how a single summary number can mislead when the underlying values vary widely.