Let $P_{k}(\mathbb{N}) = \{ A \subset \mathbb{N} \ | \ |A|=k \}$. I want to prove that $P_k$ is countable for each $k$.
So I showed that this was a set of countable subsets, but I am not sure how to construct a one to one function to naturals.
I was also wondering how to prove that the set of all finite subsets of $\mathbb{N}$ is countable to make the proof easier, so I constructed the function $g = r^n$ from $r = 1$ to infinity where $n \in f$ where $f$ is a function that maps the elements of the finite countable sets into $\mathbb{N}$