Congruence modulo n

Definition 10

Congruent

$a \equiv b \pmod{n}$ means $n \mid (a - b)$ .

Congruent numbers leave the same remainder on division by $n$ . You can add congruences, as the next proof shows.