Question

The linear congruence ax = b (mod m)
has a solution if and only if (a,m) |b.
Prove it.​

Answer 1

Answer:

hmm quite confusing wait a minutes let me solve

please mark to brainlist and do follow

Answer 2

Answer:

If (a, m)=1, then the congruence ax ≡ b mod m phas exactly one solution modulo m. ... Note that ax ≡ b (mod m) implies ax = b + qm for some integer q. So a common divisor of a, m also divides b.