x \pmod aThe modulo operation, denoted as x \pmod a, finds the remainder when x is divided by a. It is a fundamental concept in number theory and is used to determine congruence between numbers.
7 divided by 3 leaves a remainder of 1.
7 \pmod 3 = 110 divided by 4 leaves a remainder of 2.
10 \pmod 4 = 215 is exactly divisible by 5, leaving a remainder of 0.
15 \pmod 5 = 0