Hardy-Littlewood Conjecture F (Primes in Quadratic Polynomials)
Statement
For a polynomial with , , and discriminant not a perfect square, the polynomial takes infinitely many prime values. Furthermore, the number of primes of the form satisfies an asymptotic formula where depends on but not on .
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.