What would you like to understand?

To verify $a \equiv b \pmod{n}$, divide $a$ by the modulus $n$ using long division and check if the remainder is $b$. If the remainder matches $b$, the congruence is valid.

Conditions: The method is demonstrated for positive dividends and positive moduli.; The speaker calls it a colloquial explanation.

To verify $a \equiv b \pmod{n}$, divide $a$ by the modulus $n$ using long division and check if the remainder is $b$. If the remainder matches $b$, the congruence is valid.

Conditions: The method is demonstrated for positive dividends and positive moduli.; The speaker calls it a colloquial explanation.