Modular Arithmetic

Arithmetic with remainders: $(a+b)\bmod m$, $(a\cdot b)\bmod m$, and modular inverses.

Intermediate

Answers "mod $10^9+7$ " keep numbers small. Inverse of $a$ mod prime $p$ is $a^{p-2} \bmod p$ (Fermat).

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)