I am trying to show that the cardinality of $\mathbb{N}\times \mathbb{N}$ is the same as the cardinality of $\mathbb{N}$.
Let's look at the function $f(a, b)=2^a(2b+1)-1, f:\mathbb{N}\times \mathbb{N}\to \mathbb{N}$. How does one come up with it?
We have to show that $f$ is surjective and injective. For the injectivity if we take $f(a,b)=f(a',b')$, we can see that $a=a'$ and $b=b'$.
How do we prove the surjectivity, though? If we take an arbitrarily $n\in\mathbb{N}$, we are supposed to show that there are $a,b\in\mathbb{N}$ such that $f(a,b)=n$. How do we do that? I don't see that it's necessary for such $a,b$ to exist.
Remark: We consider $0$ to be a natural number, so $0\in\mathbb{N}$.