Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Is there a generating function for nth prime that is easy to deal with? i.e. is there a simple closed form for the series $p_1x + p_2x^2 + ...$ or of the form $\sum_{n = 1}^\infty x^{p_n}$

share|improve this question
Mayank Pandey, you are truly an optimist –  John Wiltshire-Gordon Nov 4 '13 at 18:05
The short answer is 'no'. Relevant reading material: en.wikipedia.org/wiki/Formula_for_primes Did you research this question before asking it? –  user43208 Nov 4 '13 at 18:09
add comment

migrated from mathoverflow.net Nov 4 '13 at 21:05

This question came from our site for professional mathematicians.

2 Answers

How about a generating function of the form $$ \left(1-p_1^{-s}\right)\left(1-p_2^{-s}\right)\left(1-p_3^{-s}\right)\cdots = \frac{1}{\zeta(s)},\qquad \mathrm{Re}\;s > 1 $$

share|improve this answer
add comment

No, at least there is none known which would give you what you seem to be looking for. Otherwise it would be so well-known that I think you would know it as well! -- Though if you are actually happy with much weaker results in this direction, I suggest that you specify this in the question.

share|improve this answer
add comment

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.