betaFeedback

WorksMathematics

Primes and the Möbius function over quadratic polynomials

Abstract

We prove an asymptotic formula for the number of primes p≤Xp\leq X of the form n2+hn^2+h for almost all h≤X1/2−o(1)h \leq X^{1/2-o(1)}. We prove that, for almost all h≤X2/5h \leq X^{2/5}, the number of primes satisfies a correct-order lower bound. We also show cancellation of the Möbius function over n2+hn^2+h for almost all h<X1/2−o(1)h < X^{1/2-o(1)}.

Introduction

A famous open question asks if there are infinitely many prime numbers represented by any non-constant irreducible polynomial P∈Z[X]P \in\mathbb{Z}[X] with positive leading coefficient and no fixed prime divisor. The case deg⁡P=1\deg P = 1 is Dirichlet’s theorem on primes in arithmetic progressions, but already for deg⁡P=2\deg P = 2 the conjecture appears to be far beyond our current methods.

Let Sh=∏p1−ρh(p)/p1−1/p\mathfrak{S}_h = \prod_p \frac{1-\rho_h(p)/p}{1-1/p} denote the singular series constant for primes of the form n2+hn^2+h, where ρh(p)\rho_h(p) denotes the number of solutions x(modp)x \pmod p to the congruence x2+h≡0(modp)x^2+h \equiv0 \pmod p. Baier and Zhao [1] have shown that for X1/2+ε<H<X/2X^{1/2+\varepsilon} < H < X/2 and any C>0C > 0 we have

∑n2+h≤XΛ(n2+h)=Sh(X−h)1/2+OC(X1/2(log⁡X)C)(1)\sum_{n^2+h\le X} \Lambda(n^2+h) = \mathfrak{S}_h(X-h)^{1/2} + O_C\left(\frac{X^{1/2}}{(\log X)^C}\right) \tag*{(1)}

for all but ≪CH/(log⁡X)C\ll_C H/(\log X)^C values of h≤Hh \le H.

The value X1/2X^{1/2} is a natural barrier since for H>2X1/2H > 2X^{1/2} the intervals [n2,n2+H][n^2,n^2+H] overlap. The method of Baier and Zhao fails completely past this threshold and does not even give lower bounds for the number of primes. Our main theorem breaks this barrier.

Theorem 1.1. Let ν>0\nu> 0 and H=X1/2−νH = X^{1/2-\nu}. Then

∑n2+h≤XΛ(n2+h)=(1+O(ν))ShX1/2\sum_{n^2+h\le X} \Lambda(n^2+h)=(1+O(\nu))\mathfrak{S}_hX^{1/2}

for all but ≪CH/(log⁡X)C\ll_C H/(\log X)^C values of h≤Hh\le H. In particular, for H=X1/2−o(1)H=X^{1/2-o(1)} we have

∑n2+h≤XΛ(n2+h)=(1+o(1))ShX1/2\sum_{n^2+h\le X} \Lambda(n^2+h)=(1+o(1))\mathfrak{S}_hX^{1/2}

for all but ≪CH/(log⁡X)C\ll_C H/(\log X)^C values of $h\le H.

The error term O(νShX1/2)O(\nu\mathfrak{S}_hX^{1/2}) can be made more precise. In particular, we prove the following lower bound result.

Theorem 1.2. Let X2/5≤H≤X/2X^{2/5}\le H\le X/2 and C>0C>0. Then

∑n2+h≤XΛ(n2+h)≥0.098Sh(X−h)1/2\sum_{n^2+h\le X} \Lambda(n^2+h)\ge0.098\mathfrak{S}_h(X-h)^{1/2}

for all but ≪CH/(log⁡X)C\ll_C H/(\log X)^C values of h≤Hh\le H.

As a corollary, for X2/5≤H≤X/2X^{2/5}\le H\le X/2 and for any subset H⊆[1,H]∩Z\mathcal{H}\subseteq[1,H]\cap\mathbb{Z} with #H≥H/(log⁡X)C\#\mathcal{H}\ge H/(\log X)^C, we obtain a correct order lower bound for the number of primes p=n2+h≤Xp=n^2+h\le X with h∈Hh\in\mathcal{H}. Theorem 1.2 is then the first time that primes have been detected in a thin polynomial sequence which does not factor over number fields. Previously the density barrier has been overcome only for factorizing polynomials such as X2+Y4X^2+Y^4 by Friedlander and Iwaniec [3] and X3+2Y3X^3+2Y^3 by Heath-Brown [10] (cf. also their descendants [2, 4, 5, 11, 14, 21, 20, 23, 24] and [12, 13, 15, 18]).

The exponent 2/52/5 in Theorem 1.2 can be strengthened slightly by optimizing the sieve more carefully.1 Restricting to H≥X2/5H\ge X^{2/5} simplifies the sieve argument considerably. We face a hard barrier at 1/31/3. The constant 0.0980.098 in Theorem 1.2 can be replaced by the following expression

1−o(1)−(∫1/51/4∫α21/2+∫1/41/3∫α21−2α2)1α1α2(1−α1−α2) dα1dα21-o(1)-\left(\int_{1/5}^{1/4}\int_{\alpha_2}^{1/2}+\int_{1/4}^{1/3}\int_{\alpha_2}^{1-2\alpha_2}\right)\frac{1}{\alpha_1\alpha_2(1-\alpha_1-\alpha_2)}\,d\alpha_1d\alpha_2
−∫1/51/4∫α21−3α2log⁡(1−α1−2α2α2)α1α2(1−α1−α2) dα1dα2−∫1/51/4∫α11/2−α11+log⁡(4−5α1−5α2)α1α2(1−α1−α2) dα2dα1.-\int_{1/5}^{1/4}\int_{\alpha_2}^{1-3\alpha_2}\frac{\log\left(\frac{1-\alpha_1-2\alpha_2}{\alpha_2}\right)}{\alpha_1\alpha_2(1-\alpha_1-\alpha_2)}\,d\alpha_1d\alpha_2-\int_{1/5}^{1/4}\int_{\alpha_1}^{1/2-\alpha_1}\frac{1+\log(4-5\alpha_1-5\alpha_2)}{\alpha_1\alpha_2(1-\alpha_1-\alpha_2)}\,d\alpha_2d\alpha_1.

For the Möbius function we prove cancellation provided that HH is close to X1/2X^{1/2}.

Theorem 1.3. For any ν>0\nu> 0 we have uniformly for H=X1/2−νH = X^{1/2-\nu}

∑h≤H∣∑n2+h≤Xμ(n2+h)∣≪νHX1/2.\sum_{h \le H} \left| \sum_{n^2+h \le X} \mu(n^2+h) \right| \ll\nu H X^{1/2}.

In particular, for H=X1/2−o(1)H = X^{1/2-o(1)} we have

∑h≤H∣∑n2+h≤Xμ(n2+h)∣=o(HX1/2).\sum_{h \le H} \left| \sum_{n^2+h \le X} \mu(n^2+h) \right| = o(HX^{1/2}).

It is instructive to compare these results to the twin prime analogues Λ(n)Λ(n+h)\Lambda(n)\Lambda(n+h) and μ(n)μ(n+h)\mu(n)\mu(n+h) (i.e. replacing n2+hn^2+h by n(n+h)n(n+h)). There it is known that the analogue of (1.1) holds for H≥X8/33+εH \ge X^{8/33+\varepsilon} and that the analogue of Theorem 1.3 holds for HH growing arbitrarily slowly by the works of Matomäki, Radziwiłł, and Tao [16, 17]. Thus, at least from this perspective, the irreducible case n2+hn^2+h appears to be significantly harder.

Finally, we mention the following corollary on the ternary divisor function τ3(n)=∑n=abc1\tau_3(n) = \sum_{n=abc} 1. This can be shown using slight modifications of Propositions 2.1, 2.2, and 2.3. The proof is omitted as the details are standard but laborious. Note that we do not have an asymptotic formula for the sum of τ3\tau_3 over any irreducible quadratic polynomial. In fact, even an almost all result breaking the 1/21/2-barrier is not known for irreducible quadratic polynomials.

References

  1. [1]S. Baier and L. Zhao. On primes in quadratic progressions. International Journal of Number Theory, 05(06):1017–1035, 2009.arxiv.org/abs/math/0701577
  2. [2]E. Fouvry and H. Iwaniec. Gaussian primes. Acta Arith., 79(3):249–287, 1997.DOI
  3. [3]J. Friedlander and H. Iwaniec. The polynomial X² + Y⁴ captures its primes. Ann. of Math. (2), 148(3):945–1040, 1998.
  4. [4]J. Friedlander and H. Iwaniec. Coordinate distribution of Gaussian primes. J. Eur. Math. Soc. (JEMS), 24(3):737–772, 2022.arxiv.org/abs/1811.05507
  5. [5]B. Green and M. Sawhney. Primes of the form p² + nq². Preprint, arXiv:2410.04189, 2024.
  6. [6]L. Grimmelt and J. Merikoski. Twisted correlations of the divisor function via discrete averages of SL₂(ℝ) Poincaré series. https://arxiv.org/abs/2404.08502, 2024.
  7. [7]L. Grimmelt and J. Merikoski. On the greatest prime factor and uniform equidistribution of quadratic polynomials. https://arxiv.org/abs/2505.00493, 2025.
  8. [8]G. Harman. Prime-detecting sieves, volume 33 of London Mathematical Society Monographs Series. Princeton University Press, Princeton, NJ, 2007.
  9. [9]D. R. Heath-Brown. A mean value estimate for real character sums. Acta Arithmetica, 72(3):235–275, 1995.
  10. [10]D. R. Heath-Brown. Primes represented by x³ + 2y³. Acta Math., 186(1):1–84, 2001.
  11. [11]D. R. Heath-Brown and X. Li. Prime values of x² + p⁴. Invent. Math., 208(2):441–499, 2017.
  12. [12]D. R. Heath-Brown and B. Z. Moroz. Primes represented by binary cubic forms. Proc. London Math. Soc. (3), 84(2):257–288, 2002.
  13. [13]D. R. Heath-Brown and B. Z. Moroz. On the representation of primes by cubic polynomials in two variables. Proc. London Math. Soc. (3), 88(2):289–312, 2004.
  14. [14]P. C.-H. Lam, D. Schindler, and S. Y. Xiao. On prime values of binary quadratic forms with a thin variable. J. Lond. Math. Soc. (2), 102(2):749–772, 2020.DOI
  15. [15]X. Li. Prime values of a sparse polynomial sequence. Duke Math. J., 171(1):101–208, 2022.DOI
  16. [16]K. Matomäki, M. Radziwill, and T. Tao. An averaged form of Chowla’s conjecture. Algebra & Number Theory, 9(9):2167–2196, 2015.
  17. [17]K. Matomäki, M. Radziwill, and T. Tao. Correlations of the von mangoldt and higher divisor functions in long shift ranges. Proceedings of the London Mathematical Society, 118(2):284–350, 2019.
  18. [18]J. Maynard. Primes represented by incomplete norm forms. Forum Math. Pi, 8:e3, 2020.arxiv.org/abs/1507.05080
  19. [19]J. Merikoski. On the largest prime factor of n² + 1. J. Eur. Math. Soc. (JEMS), 25(4):1253–1284, 2023.
  20. [20]J. Merikoski. The polynomials X² + (Y² + 1)² and X² + (Y³ + Z³)² also capture their primes. Proc. Lond. Math. Soc. (3), 127(4):1057–1133, 2023.DOI
  21. [21]J. Merikoski. On gaussian primes in sparse sets. Compositio Mathematica, 161(2):181–243, 2025.DOI
  22. [22]J. Merikoski. On primes represented by ax² + by³. https://arxiv.org/abs/2503.05396, 2025.
  23. [23]K. Pratt. Primes from sums of two squares and missing digits. Proc. Lond. Math. Soc. (3), 120(6):770–830, 2020.DOI
  24. [24]S. Y. Xiao. Prime values of f(a, b²) and f(a, p²), f quadratic. Algebra Number Theory, 18(9):1619–1679, 2024.DOI

Paper details

vlnc:W_28p2schc
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 10

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents