1

As far as I know, no one has been able to find an onto function $f:\mathbb{N} \rightarrow P$ where $P$ is the set of all primes. Does there exist an onto function $f: \mathbb{N}\times \mathbb{N} \rightarrow P$ where $P$ is the set of all primes? Finally, is there any general onto function $f:\mathbb{N}^k \rightarrow P$, where $k \in \mathbb{N}$? Of course what i want is a closed form that is, something like a formula. Not a function like f(n)= nth prime number.

Fawkes4494d3
  • 2,984
  • 9
    Sure there is an onto function $f:\mathbb N \rightarrow P$. Take for instance $f(n) = p_n$, the $n$th prime. If you want a formula instead, that's a different question. – TonyK Sep 29 '15 at 18:45
  • @TonyK obviously I am talking about a function with a close form, something like a formula. – Fawkes4494d3 Sep 30 '15 at 10:13
  • Yes, obviously. But if you are going to ask such questions, it's important that you get the terminology right. – TonyK Sep 30 '15 at 11:58
  • @TonyK I apologize for my mistake, yeah I should have said closed form... Sorry.... Yes a open form is what i want..... :) – Fawkes4494d3 Oct 01 '15 at 09:20
  • Any answers, please people!! @tonyk i have edited the question. – Fawkes4494d3 Oct 06 '15 at 17:03
  • 1
    Your question is too broad to admit a precise answer (are you only interested in polynomials, or some broader class of "formulas"?), but this might be a good place to do some background reading: https://en.wikipedia.org/wiki/Formula_for_primes – Gregory J. Puleo Oct 06 '15 at 17:09

0 Answers0