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 ( \bmod 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 ( \bmod m )\]
Brand: Quizplus
Rating: 5.0 (35 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 ( \bmod m )$$

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

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 ( \bmod m )$