Why the remainder is always smaller
This is the one rule worth internalising: a remainder is always less than the divisor. If you get 47 ÷ 5 = 8 remainder 7, the answer is wrong, because another 5 fits inside that 7.
It follows from what the quotient is. The quotient is the LARGEST whole number of copies that fit. If the leftover were as big as the divisor, one more copy would fit, and the quotient would not have been the largest.
That is also why the pair is unique. For any dividend and any positive divisor there is exactly one quotient and one remainder satisfying both conditions — the identity and the size limit. This is the division algorithm, and it is a theorem rather than a convention.
Reading the check line
The page shows quotient × divisor + remainder next to the answer. For 47 ÷ 5 that is 9 × 5 + 2, which is 47.
This single line catches almost every mistake a long division can make. A quotient digit written in the wrong column, a subtraction slip, a forgotten zero — all of them break the check, because the reconstructed dividend comes out wrong.
It is worth doing by hand even when a calculator produced the answer, because it verifies the numbers you actually wrote down rather than the ones you meant to type.
Long division is this, digit by digit
Long division is not a different operation. It is the same subtraction, done one place value at a time so the numbers stay small enough to handle.
Dividing 4728 by 5, you ask how many fives fit in 47 (nine, leaving 2), bring down the 2 to make 22 (four fives, leaving 2), bring down the 8 to make 28 (five fives, leaving 3). Quotient 945, remainder 3. Each step is the same question asked of a two-digit number.
The repeated-subtraction view on this page is the version underneath that. It is slower, and it is the one that shows why the process ends: each subtraction makes the number strictly smaller, so it must eventually drop below the divisor.
Two divisions worked in full: zeros in the quotient, then remainders that become units
Both examples are the calculator’s own output, and every quotient and remainder below is pinned as a test in its engine suite, so the working here cannot drift from what the tool computes.
7,039 ÷ 7
Go digit by digit. Seven goes into 7 once, leaving 0. Bring down the 0: seven goes into 0 zero times, so the quotient gets a 0. Bring down the 3: seven goes into 3 zero times again, another 0. Bring down the 9 to make 39: five sevens are 35, leaving 4.
The quotient is 1,005 and the remainder is 4. The check line reads 1,005 × 7 + 4 = 7,039, and the fraction form is 1,005 + 4/7.
The two zeros are the whole difficulty. Skip the first and you write 105 remainder 4; the check gives 105 × 7 + 4 = 739, and 739 is not the number you started with. Skip both and you get 15 remainder 4, which checks back to 109. Each zero marks a step where the divisor did not fit, and each one still needs a digit.
12,345 seconds in hours, minutes and seconds
Divide by 60 first: 12,345 ÷ 60 = 205 remainder 45. The remainder is the seconds, 45, and the quotient, 205, is a count of whole minutes. Divide that by 60: 205 ÷ 60 = 3 remainder 25. The answer is 3 hours, 25 minutes and 45 seconds.
A second route has to agree. 12,345 ÷ 3,600 = 3 remainder 1,545, so 3 whole hours and 1,545 seconds over. Then 1,545 ÷ 60 = 25 remainder 45. Both routes land on the same three numbers, which is the check.
The tempting shortcut is the decimal. 12,345 ÷ 3,600 = 3.4291… hours, and reading that as “3 hours 42 minutes” is wrong by more than 16 minutes, because the digits after the point are a fraction of an hour, not minutes. The fraction is 1,545/3,600, and 1,545 ÷ 60 = 25.75 minutes, which is 25 minutes and 45 seconds.
How a remainder comes out wrong
- A remainder as large as the divisor. If the leftover is 7 or more when dividing by 7, the quotient digit above it is one too small.
- A dropped zero. Any step where the divisor does not fit still writes a 0 in the quotient. The check line exposes it in one multiplication.
- Decimal digits read as a remainder. 7,039 ÷ 7 = 1,005.571…, and the remainder is not 571 or 0.571. It is 0.571… × 7 = 4, and only the exact fraction gives that without a rounding error.
- Mixing units mid-chain. In a unit conversion each remainder belongs to the smaller unit. Carry the quotient to the next division and write the remainder down.
Negative dividends
Ask for −47 divided by 5 and two answers are defensible. Rounding the quotient towards zero gives −9 remainder −2. Rounding it down gives −10 remainder 3.
Both satisfy the identity: −9×5 + (−2) = −47, and −10×5 + 3 = −47. School arithmetic usually means the first, number theory usually means the second, and programming languages are split.
When the dividend is negative the page shows both rather than choosing. If you are matching a particular language or a particular textbook, the Modulo Calculator names which convention each one uses.
Where remainders are the answer
Packing. 1,000 items into boxes of 24 gives 41 full boxes and 16 left over. The remainder is what you have to do something about.
Splitting a bill or a rota. Seven shifts among three people is two each with one left over — and the remainder is exactly the part that needs a decision.
Testing divisibility. A remainder of zero is what “divides exactly” means. It is the definition every divisibility rule is a shortcut for.
Converting units that do not divide evenly. 200 minutes is 3 hours remainder 20 minutes. The quotient is the big unit, the remainder is the small one, and no decimal is involved.
Remainder, modulo and fraction
Three ways to answer the same division, and which one is right depends on what the leftover means.
Remainder keeps the leftover whole. Sixteen items left over is sixteen items; you cannot ship 0.67 of a box.
Modulo throws away the quotient and keeps only the position. Nobody asks how many full weeks are in 365 days — they ask which weekday it lands on.
Fraction or decimal divides the leftover up. 47 ÷ 5 = 9.4, and the .4 is the remainder 2 expressed as two fifths. Right for a measurement, wrong for a count of boxes.
Sources and methodology
The division algorithm is a theorem rather than a convention — these are the references.
Method. One division produces the quotient and the remainder together, on arbitrary-precision integers, so a twenty-digit dividend is exact rather than rounded. The check line is computed from the returned pair rather than restated from the input, so a wrong pair would fail to reproduce the dividend. Where the quotient is small enough to be readable, the repeated subtraction is generated from the same numbers. That engine is verified on every change against 77 hand-written assertions, including that quotient times divisor plus remainder returns the dividend across twenty thousand random pairs, with negatives on both sides. The count and the per-case breakdown are published on the formula verification page.
Read the guide
If what you actually want is a position on a cycle — a weekday, an array index, a check digit — the Modulo Calculator frames the same division that way and gives all three sign conventions.