# [Discrete] Prove that |nZ| = |Z| for any postive integer n

piareround
I have been studying discrete mathematics for fun and I am kind of stuck on this bijection problem.

1. Homework Statement

I wanted to apologize in advance if i put this homework question in the wrong part of the forums. Discrete Math and much logic math is a computer science type math of logic and boolean. Still its a college level math, so I was hoping that this was the right place. I also thought about posting in the math forums, but because I am trying to teach myself discrete mathematics, I figure it might be technically self-defined ""homework""

Let nℤ denote the set {x ∈ ℤ |∃k ∈ ℤ, x = kn } (ie. 2Z contains multiples of 2, 3Z contains multiples of 3, etc.). Prove that |nℤ| = |ℤ| for any positive integer n. (Hint: You should have a bijection should include n)

## Homework Equations

and concepts[/B]
1. It must involve the Theory or Concept of Bijection and either showing the bijection or proving the bijection
2. Actually I wanted advice, because I am not sure about the steps of writing a discrete math proof. I get stuck on all the new math symbols which are confusing >-<; To me they seem to be special (bijection case, limit theorem case, iteration case, orthogonality case)
3. X = kn ∈ ℤ
4. nℤ

## The Attempt at a Solution

I am not really good with proofs or how to write a proofs. I feel like unlike physics problems and derivations which have a very specific series of steps... logic seems to lack steps...
I know bijection involves having tables of values can showing that their is one dependant value for every indepent value... so I made a table then expanded it for the infinite case of K and K+1:
VVVVVV
^^^^^^^
However, I am not sure if my attempted solution is the right way to go about it or how to turn the answer into a proper proof for discrete mathematics.

Let me know what you guys think.