Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

What are some interesting sequences that contain infinitely many primes?

If it takes form of a polynomial, Dirichlet's theorem answer the question completely for linear polynomial. What about polynomials of degree more than 1? Is there a known polynomial of degree more than 1 that contains infinitely many primes?

What about more complicated sequences like $2^n+3^n$, $n!+1$, etc?

Please provide examples that are as interesting as possible, accompanied with proofs (or reference to proofs) if not too difficult.

Thanks in advanced.

share|cite|improve this question
Bunyakovsky conjecture – pedja Feb 6 '12 at 10:17

A polynomial formula for the primes (with 26 variables) was presented by Jones, J., Sato, D., Wada, H. and Wiens, D. (1976). Diophantine representation of the set of prime numbers. American Mathematical Monthly, 83, 449-464.

The set of prime numbers is identical with the set of positive values taken on by the polynomial


as the variables range over the nonnegative integers.

share|cite|improve this answer

Look here

The formula is, unfortunately, of little practical value because the constant must be known to tremendous many digits to produce $15-20$ primes, and the sequence grwos too fast, but theoretically, it is beautiful.

share|cite|improve this answer

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.