learn.howToCalculate

learn.whatIsHeading

Modular arithmetic wraps numbers around after reaching a modulus. a mod m is the remainder when a is divided by m. Foundational in cryptography, checksums, and number theory.

Guide étape par étape

1. 1a mod m = remainder of a ÷ m
2. 2(a+b) mod m = ((a mod m)+(b mod m)) mod m
3. 3Modular exponentiation: fast algorithm for aⁿ mod m

Exemples résolus