Modulo

Rare card · No. 52198

In mathematics and computing, modulo is the binary operation of which the value is the remainder or signed remainder of a division of one number by another, the latter being called the modulus of the operation. Given two positive numbers a and m, a modulo m (often written as a mod m {\displaystyle a{\bmod {m}}} ) is the remainder of the Euclidean division of a by m, where a is the dividend and m is the divisor. For example, 5 mod 2 = 1 {\displaystyle 5{\bmod {2}}=1} , because dividing 5 by 2 yields a remainder of 1 (besides the quotient of 2), while 9 mod 3 = 0 {\displaystyle 9{\bmod {3}}=0} , because 3 divides evenly into 9, thus leaving a remainder...

Read on Wikipedia