[Congruence class] Proof of modular arithmetic theorem

Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
2 replies · 2K views
Leo Liu
Messages
353
Reaction score
156
TL;DR
.
157d8fd4ed%2FScreen_Shot_2021-11-22_at_12.31.01_PM.png

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.
 
Reply
  • Like
Likes   Reactions: jedishrfu
Physics news on Phys.org
Recall that ##[x] = [y]## if ##x \equiv y \ (\mathrm{mod \ m})##. Then it's just a case of using ##[a][x_0] = [ax_0]##.
 
Reply
  • 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.
 
Reply
  • Like
Likes   Reactions: jedishrfu