Divide two whole numbers and get the quotient, the remainder, and the modulo result for negative inputs.
How the remainder calculator works
Integer division produces two numbers: how many times the divisor fits, and what is left over. The calculator shows both, along with the decimal and mixed-number forms of the same division.
Remainder and modulo differ when negatives are involved. The remainder takes the sign of the dividend; the modulo result is always non-negative, which is what most programming languages’ modulo operators and clock arithmetic use.
How to fill it in
- Enter the dividend — the number being divided.
- Enter the divisor.
- Read the quotient, remainder and modulo.
The calculation
dividend = quotient × divisor + remainder
modulo = ((a mod b) + |b|) mod |b|
The default scenario, worked through
On the values this calculator opens with, the remainder is 7. Underneath, Quotient comes out at 10 and Modulo at 7. Change any field and every figure updates as you type.
FAQ
What is the difference between remainder and modulo?
For positive numbers they agree. For negatives, the remainder can be negative while the modulo result is always non-negative.
How do I check the answer?
Multiply the quotient by the divisor and add the remainder — you should get the dividend back. The calculator shows this check.
What if the divisor is zero?
Division by zero is undefined, and the calculator reports that rather than returning a number.