There is a famous Dirichlet's result, which says: There are infinitely many primes of form $an+b$, where $(a,b)=1$ and $n\in \mathbb{N}$.

Denote the set of all primes by $\mathbb{P}$. Given two coprime numbers $a$, $b$, how many primes of form $ap+b$, where $p\in\mathbb{P}$? For example, how many primes of form $2p+1$, where $p\in\mathbb{P}$?

More generally, for a given irreducible primitive polynomial $f(x)$, is $\{f(p)~|~p\in\mathbb{P}\}\cap\mathbb{P}$ a finite set? Did somebody study this problem?

I also need to cite this Dirichlet's result. Could anyone tell me from which book or article I can cite this theorem?

No univariate polynomial with integer coefficients and degree greater than $1$ is known to produce infinite many primes.

But many such polynomials , as $x^2+1$ are conjectured to produce infinite many primes.

For more details, see here : https://en.wikipedia.org/wiki/Bunyakovsky_conjecture

  • Thanks. It's very helpful. @Peter – user44312 Mar 4 '17 at 8:38

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

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