How this calculation works
The table follows the same bring-down and subtract procedure used on paper. An exact integer engine retains every digit and verifies the remainder stays below the divisor at each step.
At each digit, divide the carried remainder × 10 plus the next digit, then subtract the quotient digit × divisor.A worked example
987 divided by 16 gives 61 remainder 11, since 16 × 61 + 11 = 987.
Good to know
Nonnegative integer dividends and positive integer divisors up to 80 digits. The decimal view is rounded to 24 significant digits.
How the inputs affect the result
A zero quotient digit is meaningful inside the quotient. Keep it when a brought-down value is smaller than the divisor and later digits remain.
The final subtraction leaves zero remainder.
Where the calculation applies
Nonnegative integer dividends and positive integer divisors up to 80 digits. The decimal view is rounded to 24 significant digits.
For a related calculation, see the Fraction to decimal converter with repeating blocks.
A few questions, answered
What if the dividend is smaller than the divisor?
The quotient is zero and the entire dividend is the remainder.
What does the “Exact division” setting illustrate?
The final subtraction leaves zero remainder.