Primes represented by positive definite binary quadratic forms

Abstract

Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let ${\pi }_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for ${\pi }_f(x)$ within a constant factor of its asymptotic size: unconditional, conditional on the Generalized Riemann Hypothesis (GRH), and for almost all discriminants. The key feature of these estimates is that they hold whenever $x$ exceeds a small power of $D$ and, in some cases, this range of $x$ is essentially best possible. In particular, if $f$ is reduced then this optimal range of $x$ is achieved for almost all discriminants or by assuming GRH. We also exhibit an upper bound for the number of primes represented by $f$ in a short interval and a lower bound for the number of small integers represented by $f$ which have few prime factors.

28 pages

References in corpus (4)

• An explicit bound for the least prime ideal in the Chebotarev density theorem
• A Chebotarev variant of the Brun-Titchmarsh theorem and bounds for the Lang-Trotter conjectures
• The $r$th moment of the divisor function: an elementary approach
• Explicit counting of ideals and a Brun-Titchmarsh inequality for the Chebotarev Density Theorem