I [Congruence class] Proof of modular arithmetic theorem

Click For Summary
The discussion centers on proving the equivalence between the congruence classes and modular arithmetic, specifically the statement that [a][x_0] = [c] if and only if ax_0 ≡ c (mod m). Participants clarify that this stems from the definition of congruence classes, where [x] = [y] if x ≡ y (mod m). The proof involves demonstrating that [a][x_0] simplifies to [ax_0]. The justification of this relationship relies on the properties of transitivity and symmetry in congruence. Overall, the explanation successfully convinces participants of the theorem's validity.
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.
 
Mathematics 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]##.
 
  • Like
Likes 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.
 

Similar threads

  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 35 ·
2
Replies
35
Views
5K
Replies
4
Views
2K
Replies
1
Views
1K
  • · Replies 12 ·
Replies
12
Views
4K
Replies
21
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K