Prove that the set of all $n$-tuples taken over a countable set is countable.
Attempt: We know that the number of primes is infinite and countable. We enumerate it as $p_1, p_2, p_3,..., p_n, ...$. Now, define $f: B_n \to \mathbb{N}$ such that $f(a_1, a_2, a_3, ..., a_n)={p_1}^{a_1} {p_2}^{a_2} ... {p_n}^{a_n}$, which is injective. [$B_n$ is the set of all $n$ tuples]. Now, $R(f) \subset \mathbb{N}$, so it is at most countable