Calculate the remainder when one number is divided by another. Also known as the modulo operation.
The modulo operation (mod) returns the remainder after division of one number by another. It's commonly used in programming, cryptography, and number theory.
0 ≤ (a mod b) < |b|
(a + b) mod m = a mod m
(a × b) mod m = ((a mod m) × (b mod m)) mod m
-a mod b = (b - (a mod b)) mod b