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

Name: 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).
Brand: Quizplus
Rating: 4.8 (42 reviews)

Question

Quizplus · Accepted Answer

The Answer of 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).

Show That If A, B, K and M Are Integers k≥1,m≥2, and a≡b( mod m), then ka≡kbk \geq 1 , m \geq 2 , \text { and } a \equiv b ( \bmod m ) , \text { then } k a \equiv k bk≥1,m≥2, and a≡b(modm), then ka≡kb

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$