ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a polynomial f(x)=ax2+bx+cf(x) = ax^2 + bx + c with a>0a > 0, gcd⁡(a,b,c)=1\gcd(a,b,c) = 1, and discriminant Δ=b2−4ac\Delta = b^2 - 4ac not a perfect square, the polynomial takes infinitely many prime values. Furthermore, the number P(n)P(n) of primes of the form f(x)≤nf(x) \leq n satisfies an asymptotic formula P(n)∼A⋅nlog⁡nP(n) \sim A \cdot \frac{\sqrt{n}}{\log n} where AA depends on a,b,ca, b, c but not on nn.

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.