Proving Countability of {m+n, m,n \inZ} Using a NxN Scheme

[aaaa202]

Homework Statement

Prove that {m+n, m,n \inZ} is countable

Homework Equations

The Attempt at a Solution

I Can prove it if I make a nxn scheme and put 1,-1,2,-2 along each side. This generates a table which when counted a long first,second etc. Diagonal hits all the numsers in the given set. But is this the formal Way to prove these kinds of things?

 

[johnqwertyful]

Isn't that set just equal to Z again? Maybe I'm just misunderstanding notation...

 

[Mark44]

Homework Statement

Prove that {m+n, m,n \inZ} is countable

Homework Equations

The Attempt at a Solution

I Can prove it if I make a nxn scheme and put 1,-1,2,-2 along each side. This generates a table which when counted a long first,second etc. Diagonal hits all the numsers in the given set. But is this the formal Way to prove these kinds of things?

The set could also be described as {p | p = m + n, where m, n $\in$ Z}. All you need to do is to establish a one-one pairing with the integers. The things in the set are just numbers, not ordered pairs, so based on the notation you've used, your table is way more complicated than what is needed.

Isn't that set just equal to Z again? Maybe I'm just misunderstanding notation...

That's how I read it as well.