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

Let's define an infinite sequence of positive integers as :

$a_n=k^2+(2n-1)k+2n-1 $ , where $ k,n \in \mathbf{Z^{+}}$

Suppose that one can prove that this sequence contains infinitely many prime numbers for any particular $k$. The first term of the sequence for any $k$ is of the form :


My question is : what is sufficient condition to prove that this polynomial produces primes for infinitely many values of $k$ ?

Note that there is strong experimental evidence that $k^2+k+1$ is prime for infinitely many values of $k$ and that this polynomial satisfies conditions of Bunyakovsky's conjecture.

share|cite|improve this question
I assumed that you knew that no quadratic polynomial is known that represents infinitely many primes. So I thought the question could not be about fixed $n$. The primality of $k^2+k+1$ for infinitely many $k$ is a well-known open problem. I am therefore deleting the answer, which dealt with fixed $k$ and variable $n$. – André Nicolas Nov 5 '11 at 7:40
@Andre,I know that it isn't known whether such polynomial exist, that's why I have involved this sequence in my question.. – pedja Nov 5 '11 at 7:44
Supposing isn't necessary; Andre answered that fixing $k$ allows infinitely primes in $a_n$ due to Dirichlet's Theorem (his answer is now deleted). Now would you mind explaining what $n$ and $a_n$ have to do with anything if your question is about $k^2+k+1$? Why the irrelevant, misleading build-up? – anon Nov 5 '11 at 7:45
@pedja: I see, you are hoping that the additional parameter can help in settling the $k^2+k+1$ problem. Unfortunately each value of $n$ leads to another open problem. The fact that for each $k$, there are infinitely many $n$ for which we get a prime gives no information about $n=1$, or any other value of $n$. Each "row" can have infinitely many primes, while each "column" has only finitely many. It is not hard to come up with examples of such situations, though I certainly cannot for your two-parameter family. – André Nicolas Nov 5 '11 at 7:59
I think if we could make such a claim, someone would have done so some time in the last 200 years. As no one has.... – Gerry Myerson Nov 5 '11 at 8:18

I don't think there is any comprehensive conjecture on the distribution of prime values of polynomials in two or more variables. Other than simply being more general, when there are multiple variables there are algebraic curves along which the density of primes is higher or lower. This is analogous to algebraic surfaces in which it is possible for all the rational points to lie on a lower-dimensional subset such as a line, or for the surface to have many rational points but some curves on the surface will have no rational points at all.

Iwaniec and Friedlander proved that there are infinitely primes of the form $x^2 + y^4$ but there are infinitely many values of $x$ for which the polynomial is always composite. Any asymptotic prediction of the distribution of prime values in the sequence must have some non-uniformity when expressed in terms of $x$ and $y$, and there is no known way to "concentrate" the theorem down to statements about infinitely many primes in subsequences with $x$ (or $y$) constant.

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.