FoxCalculators - Free Calculators Online!

In mathmatics and computing, the modulos operation finds the remainder of division of one number by another.

There are two positive numbers: a and b. a is the dividend, n is the divisor, the modulo n is the remainder of the Euclidean division of a by n.

For example, "9 mod 2" is 1, because 9 divided by 2 leaves a remainder of 1. "7 mod 1" because the division of 7 by 1 leaves a remainder of 0..

Modulo formula

Modulo Remainder of Division Value (a % b)
where,
a is dividend, b is divisor.