Show That If A, B, K and M Are Integers $$k \geq 1 , m \geq 2 , \text { and } a \equiv b ( \bmod m ) , \text { then } k a \equiv k b$$

Short Answer

Show that if a, b, k and m are integers such that $$k \geq 1 , m \geq 2 , \text { and } a \equiv b ( \bmod m ) , \text { then } k a \equiv k b$$ (mod m).