Thread: May 2021 View Single Post
 2021-05-02, 18:03 #5 LaurV Romulan Interpreter     Jun 2011 Thailand 263016 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))