- #1
PsychonautQQ
- 784
- 10
Homework Statement
≈ → equivalence
"In general, if a is an integer, the division algorithm gives a = qn + r, where 0 ≤ r ≤ n-1 so a≈r (mod n). Thus every residue class module n appears in the list [0], [1]...,[n-1]. In fact, it appears exactly once.
I'm having trouble connecting the dots here, can anyone help me explain what this is saying exactly?