a mod n (remainder)
—
Non-negative form
—
Quotient
—
Step by step
This modulo calculator finds a mod n — the remainder after dividing a by n — with the quotient and a non-negative form shown.
Step by step
Enter the dividend a and the divisor n.
a is the number being divided, n is what you divide by.
a mod n is what is left over after taking out as many whole n as possible.
When a is negative, the plain remainder is negative; the non-negative form wraps it into 0…n−1.