Share
Explore BrainMass

Linear Congruence : Consider the congruence ax ≡ b mod m When (a,m)=d. Show that ax ≡ b mod m has a solution if and only if d | b.

Consider the congruence ax ≡ b mod m When (a,m)=d. Show that ax ≡ b mod m has a solution if and only if d | b.

Attachments

Solution Summary

A conguece proof is provided. The solution is detailed and well presented. The response received a rating of "5/5" from the student who originally posted the question.

$2.19