7
$\begingroup$

We know that if set $S$ is countable then this set and set of all natural numbers are equivalent, which means that there must be some bijection between this two sets $F:S\rightarrow N$.

We know that set of all Prime numbers is countable as well as set of all Natural numbers.
So how to find bijection between Prime numbers and Natural numbers in an easy way?

  • 22
    Send $n$th prime to $n$?2012-10-31
  • 0
    Is the question about how to prove that there is one?2012-10-31
  • 0
    An "easy way" probably indicates desire for a *formula*. There are several [formulas for primes](http://en.wikipedia.org/wiki/Formula_for_primes), but none of them is really useful.2014-07-15

2 Answers 2