Then a is congruent to b modulo n; a ≡ b (mod n) provided that n divides a − b. Example. 17 ≡ 5 (mod 6). The following theorem tells us that the notion of ...
確定! 回上一頁