MihsabaHow to use
Remainder conventions can differ for negative integers. The calculator therefore shows both truncating programming-style remainder and non-negative Euclidean modulo.
- Enter integer dividend a and divisor b.
- The divisor must not be zero.
- Compare programming and Euclidean remainders and verify a=bq+r.
How it is calculated
a=bq+r; Euclidean remainder satisfies 0≤r<|b|
Example
17 mod 5 is 2 under both conventions. For −17 and 5, truncating remainder is −2 while Euclidean modulo is 3.
Important notes
Inputs are parsed as integer strings and computed with BigInt so integers larger than JavaScript’s safe-number range remain exact.
Frequently asked questions
What is the difference between modulo and remainder?
They usually agree for non-negative integers; negative operands expose the convention difference.
Does it support integers above 2^53?
Yes, integer arithmetic uses BigInt.
Can the divisor be zero?
No.
Is this calculator free?
Yes. It is free to use and requires no account.