What does $a \equiv b \pmod{n}$ mean?

Explanation

1. 01

   $a$ is congruent to $b$ modulo $n$ when their difference is a multiple of $n$.

2. 02

   For example, $17 \equiv 2 \pmod{5}$ because $17 - 2 = 15$.