What you provide
What you provide
- Dividend: Integer being divided.
- Divisor: Non-zero integer used for division.
INTEGER MATH / EUCLIDEAN REMAINDER
Modulo Calculator
Find the non-negative Euclidean remainder and matching integer quotient for signed dividend and divisor inputs.
- 01 Calculated in this tab
- 02 Values stay in this browser tab
- 03 Use boundary
Use boundary
Calculation path
The language remainder is normalized into the range from zero through one less than the absolute divisor.
Calculation path
Dividend = divisor x quotient + remainder, where 0 <= remainder < abs(divisor).
What you receive
What you receive
- Non-negative remainder
- Matching integer quotient
- Dividend and divisor recap
Use boundary
Choose the maximum decimal places shown. This does not increase source accuracy.
Programming languages differ for negative operands; this page explicitly uses the Euclidean non-negative remainder convention.
Results are educational math aids. Check notation, units, rounding, assumptions, and required precision before using an answer in graded, engineering, financial, or safety-critical work.