So my teacher's notes say this:
An equivalence class consists of those integers which have the same remainder on division by n. They are also known as "congruence classes modulo n"
Since no example was stated, I decided to make up my own. Let n = 2. I took a series of numbers from 0 to 10 to put them into "equivalence classes" and here is what I ended up with:
{Remainder = 0 {0,2,4,6,8,10} , Remainder = 1 {1,3,5,7,9}}
I do not know whether it is right or not. based on the definition it is right, I suppose.
Here is what the notes say about residue class:
The set of all the integers congruent to modulo n is called residue class [a]
My understanding is that "equivalence classes" are formed based on what 'input' has been provided, in my case 0 to 10. Residue classes, on the other hand, will contain all the possible inputs that would have remainder either 0 or 1 (because I chose n =2).
Am I right?