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

We, know that there are infinitely many primes of the form $4n-1,4n+1,5n-1,\cdots, \text{etc}$. I saw these things in Apostol's Introduction to Analytic Number theory textbook. I would like to have an argument working for $n^{2}$. The first expression which came to my mind was $4n^{2}+3$, which gives a prime for $n=1,2,3,4,5$. For $n=6$ it gives $147$ which is divisible by 3. For $n=7$ it gives $199$ which is again a prime. Then for $n=11$, it gives $487$ which is again a prime. I would like to know whether there are infinitely many primes of the form $4n^{2}+3$? If yes, then a proof!

share|cite|improve this question
See Schinzel's hypothesis H: No result along these lines has ever been proved :-( – Robin Chapman Sep 13 '10 at 7:03
@Robin: Ever or never! – anonymous Sep 13 '10 at 7:31
@Anonymous: You made a typo in your first five n. The polynomial $F(n)=4n^2+3$ is obviously not prime for $n=3m$. – Tito Piezas III May 15 '13 at 16:42
up vote 12 down vote accepted

Many people "would like to have an argument working for $n^2$", but what is available at the moment (and for the last two centuries) are conjectures. For any list of integer polynomials there is a conjecture on how often all polynomials on the list are prime:

It is extremely hard to prove that any natural set of integers of density 0 contains infinitely many primes. It is known for the set of values of $x^2 + y^4$ but not for the values of any single-variable polynomial of degree higher than one.

The asymptotic formula in the Bateman-Horn conjecture isn't necessarily the most general expression of what people in the field believe to be true (and it is probably a lot older than Bateman and Horn's article that formally codified it), but it does subsume many earlier conjectures on primes of the form $n^2+1$, prime twins and k-tuplets, Schinzel's Hypothesis and Buniakowsy's conjecture. You can calculate from the formula the predicted frequency of $n$ such that $4n^2 + 3$ is prime.

share|cite|improve this answer
@T: I don't understand you. What do you mean by saying natural set of integers of density 0 – anonymous Sep 13 '10 at 7:26
The set should be defined without reference to primes or to an obvious disguise for primes. Squares-plus-one is a natural set of integers for this purpose, but "integers with EulerPhi[n] divisible by (n-1)" is not natural because primality is expressible in terms of the Phi function. – T.. Sep 13 '10 at 7:40
Link to $x^2 + y^4$ theorem: – sdcvvc Oct 10 '11 at 15:44

Your Answer


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