Thread: May 2021
View Single Post
Old 2021-05-02, 18:03   #5
Romulan Interpreter
LaurV's Avatar
Jun 2011

24×13×47 Posts

"a (mod m)" is defined as the reminder (an integer number between 0 and m-1, inclusive) that is left when you divide a to m, therefore, a\(\equiv\)b (mod m) is the same as b\(\equiv\)a (mod m), those are "equivalence classes", not numbers, it is just that we are lazy and don't write the "hats" (i.e. \(\hat{a} \equiv \hat{b}\) (mod m))
LaurV is offline   Reply With Quote