[Congruence class] Proof of modular arithmetic theorem

2 replies · 2K views · last reply
Leo Liu
Messages
353
Reaction score
156
TL;DR
.
Screenshot of a typeset theorem: Theorem 11, Modular Arithmetic Theorem, stating [a][x] = [c] in Z_m has a solution iff d | c where d = gcd(a, m), with d solutions listed; below, the proof text with the phrase 'if and only if' boxed in red.

Could someone explain why ##[a][x_0]=[c]\iff ax_0\equiv c\, (mod\, m)##?
My instructor said it came from the definition of congruence class. But I am not convinced.
 
Recall that ##[x] = [y]## if ##x \equiv y \ (\mathrm{mod \ m})##. Then it's just a case of using ##[a][x_0] = [ax_0]##.
 
  • Like
Likes   Reactions: jedishrfu and Leo Liu
ergospherical said:
Recall that ##[x] = [y]## if ##x \equiv y \ (\mathrm{mod \ m})##. Then it's just a case of using ##[a][x_0] = [ax_0]##.
Wonderful. I didn't know this form of definition but after seeing its justification (transitivity and symmetry) I am convinced.