Quotient set of an equivalence relation

[Luna=Luna]

On the set of Z of integers define a relation by writing m \triangleright n for m, n \in Z.

m\trianglerightn if m-n is divisble by k, where k is a fixed integer.

Show that the quotient set under this equivalence relation is:

Z/\triangleright = {[0], [1], ... [k-1]}

I'm a bit new the subject of Set Theory so I'm a bit unsure as to how to go about solving this.

 

[mathman]

On the set of Z of integers define a relation by writing m \triangleright n for m, n \in Z.

If m-n is divisble by k, where k is a fixed integer then show that the quotient set under this equivalence relation is:

Z/\triangleright = {[0], [1], ... [k-1]}

I'm a bit new the subject of Set Theory so I'm a bit unsure as to how to go about solving this.

\triangleright seems to be undefined. You say it is a relationship without saying what it is.

 

[Luna=Luna]

sorry it wasn't clear from my post, I've rewritten the post to be a bit more clear.

The relationship is:
m\trianglerightn, if m-n is divisble by k, where k is a fixed integer.

 

[HallsofIvy]

But you also haven't said what "[1]", "[2]", ... "[k]" are. Of course, they are the equivalence classes but unless your question is "why are there k classes" rather than "why are the classes what they are", you need to specify "what they are"! Essentially what you wrote was that you want to prove that the "quotient set" is the "set of equivalence classes" which is basically the definition of "quotient set"!
(Similar to writing "Luna= Luna"!)

Start with k= 1. All numbers in the same equivalence class with it ([1]) are numbers n such that n- 1 is divisible by k. That is the same as saying "n- 1= mk" for some m or n= mk+ 1. That is, all numbers that are 1 more than a multiple of k: [1]= {..., -2k+ 1, -k+ 1, 1, k+ 1, 2k+ 1, ...}. Similarly, [2]= {..., -2k+ 2, -k+ 2, 2, k+ 2, 2k+ 2, ...}. You can do that until you get to [k]= {..., -2k, -k, 0, k, 2k, ...} which is the same as [0]. If we try to do the same thing with k+ 1, we get [k+1]= {..., -2k+ (k+1), -k+ (k+1), k+ 1, k+ (k+ 1), 2k+ (k+ 1), ...}= {..., -k+ 1, 1, k+ 1, 2k+ 1, 3k+ 1, ...} which is exactly the same as [1].