# Congruence and Remainder

True or False?

For any integers $$x, a$$ and $$n$$ (with $$n\geq2$$), $x \equiv a\pmod n \implies a \text{ is the remainder when } x \text{ is divided by } n$.

×