Congruence and Remainder

Number Theory Level 3

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$ .

False True

1 solution

Muhammad Rasel Parvej
Dec 19, 2016

You may recall the theorem:

$x\equiv a\text{ (mod } n) \iff x \text{ mod }n=a\text{ mod }n$ .