betaFeedback

WorksMathematics

Linnik's constant is at most 3.993.99

Abstract

Let P(a,q)P(a,q) denote the least prime congruent to aa modulo qq, where (a,q)=1(a,q)=1. We give a computer-assisted proof that P(a,q)≪q3.99P(a,q)\ll q^{3.99}, improving the exponent 55 of Xylouris. More precisely, P(a,q)<q3.99P(a,q)<q^{3.99} for every sufficiently large qq, uniformly in aa. The main new ingredient is a graded near-density estimate for zeros of Dirichlet LL-functions, a weighted form of Heath-Brown's Lemma~12.1 of the kind he asked for in 1992. We combine it with the zero-location estimates and far-density method of Heath-Brown and Xylouris. The second novelty is the scale of the case analysis. Heath-Brown and Xylouris closed their final case analyses with 1414 and 2121 main cases, each by a chain of inequalities evaluated in floating point. In this paper, with the help of advanced AI models, we can push this much further. The middle range of the first zero is divided into 44534453 root cases and 47884788 terminal cases, each closed by its own linear program. On 4,196,8794{,}196{,}879 threshold boxes these programs give 29,397,33629{,}397{,}336 linear relaxations, and exact integer certificates for all of them bound the normalized zero sum strictly below~11. Exceptional zeros and the remaining exterior range are treated separately. This case analysis is a kind of systematic brute force enabled by AI: an analysis of this size, with parameters tuned to each case, would be very laborious or nearly impossible to carry out by hand, and it lets the new estimate be applied separately in each case. The near-density lemma, certificate soundness, and a conditional passage from a certified case to a prime are formalized in Lean, assuming published analytic inputs and specified facts about zeros (PALOMAR-2026-10-01-000020 v1).

Introduction

The result

For an integer q≥2q \ge2 and an integer aa with (a,q)=1(a,q)=1, let P(a,q)P(a,q) be the least prime congruent to aa modulo qq. Dirichlet’s theorem [31] ensures that this prime exists. Linnik [77, 78] proved that there are absolute constants CC and LL such that

P(a,q)≤CqL(1)P(a,q) \le Cq^{L} \tag*{(1)}

for every reduced residue class. An exponent LL for which such a constant CC exists is called admissible; Linnik’s constant is the infimum of the admissible exponents.

Theorem 1.1 (Least prime in a reduced residue class). There is an absolute constant q0≥2q_{0} \ge2 such that, for every integer q≥q0q \ge q_{0} and every integer aa with (a,q)=1(a,q)=1, there is a prime pp satisfying

p≡a(modq),p<q3.99.p \equiv a \pmod{q}, \qquad p < q^{3.99}.

Consequently, there is an absolute constant C>0C>0 such that P(a,q)≤Cq3.99P(a,q) \le Cq^{3.99} for all q≥2q \ge2 and (a,q)=1(a,q)=1. In particular, Linnik’s constant is at most 3.99.

We do not compute q0q_{0} or CC; the issue of effectivity is discussed at the end of Section 13. Except in the presence of an extremely close real zero, the proof finds a prime in the smaller interval

q3.156342<p<q3.99.q^{3.156342} < p < q^{3.99}.

The lower endpoint comes from the support of the weight used to detect primes. When a real zero is extremely close to 1, Heath-Brown’s theorem on Siegel zeros [50] instead gives P(a,q)≤q3.5P(a,q) \le q^{3.5}.

The argument combines published analytic estimates, new lemmas proved here, and exact finite computations. The theorem requires all three parts. In particular, checking a numerical certificate proves a bound for its specified configuration of zeros; the analytic argument must also show that every modulus gives a configuration covered by one of the certificates. We make this passage explicit in Sections 11 and 13.

Earlier work

The admissible exponents in Table 1 record the main numerical developments. Heath-Brown [51] obtained 5.5, and Xylouris [143, 144, 145, 146] subsequently obtained 5.2, 5.18, and 5. Before them, Pan [98, 99] gave the first numerical values, and Chen, Jutila, Graham and Wang lowered them in a long series of papers, which includes Graham’s introduction of Selberg sieve weights into zero-density estimates [39, 41]. Our proof uses the framework of these works. It rests on the three principles that Heath-Brown isolates at the start of his paper: a zero-free region with at most one exceptional zero [27, 43, 74, 97], the repulsion of other zeros by an exceptional zero, known as the Deuring–Heilbronn phenomenon [30, 53, 78], and a log-free zero-density estimate [77]. The last means that the density bound has no additional power of log⁡q\log q, a feature needed when studying zeros at distance O(1/log⁡q)O(1/\log q) from 1. Simpler proofs of these principles, and of Linnik’s theorem, were given by Rodosskiĭ [111], Turán [133, 135], Knapowski [71], Fogels [32], Gallagher [37], Jutila [65], Motohashi [91, 92] and Bombieri [10], among others; accounts are in the books [110, 84, 62, 34].

LLYearAuthor(s)Reference
100001957Pan (announced)[98]
54481958Pan[99]
7771965Chen[18]
6301971Jutila (reported by Turán)[134]
5501970Jutila[64]
1681977Chen[19]
801977Jutila[66]
361977Graham[39]
201981Graham[41]
171979Chen[20]
161986Wang[139]
13.51989Chen and Liu[21, 22]
11.51991Chen and Liu[23]
81991Wang[140]
5.51992Heath-Brown[51]
5.22009Xylouris[143]
5.182011Xylouris[144]
52011Xylouris[145, 146]
3.992026this paper

Table 1. Admissible values of Linnik’s constant, following the tables in [51] and [144], in order of the bound. Graham’s value 20 was submitted before Chen’s 17 appeared.

TypeFirst character and zeronnα\alpha
rrχ1\chi_{1} real, ρ1\rho_{1} real1111
rcχ1\chi_{1} real, ρ1\rho_{1} nonreal1122
complexχ1\chi_{1} nonreal2211

Table 1.

The conjectured scale is much smaller. Chowla [24] conjectured P(a,q)≪εq1+εP(a,q)\ll_{\varepsilon}q^{1+\varepsilon} for every ε>0\varepsilon>0; the maximum over reduced classes is conjecturally of order φ(q)(log⁡q)2\varphi(q)(\log q)^2 [138, 109, 42, 76]. The Generalized Riemann Hypothesis gives admissible exponents 2+ε2+\varepsilon; see [4, 73, 15] for explicit conditional bounds. Explicit [9] and uniform [128] unconditional estimates for primes in progressions are also known. In the other direction, an exceptional (Siegel) zero helps: Heath-Brown [50] showed that a sufficiently strong exceptional zero forces P(a,q)≤q3+δP(a,q)\leq q^{3+\delta}, in an effective form that we use below, and q2+δq^{2+\delta} ineffectively; see also [33, 61, 147]. Other proofs of Linnik’s theorem use pretentious methods [114], sieve methods [36], or avoid LL-functions [80], but give larger exponents. For moduli with special multiplicative structure there are stronger zero-free regions [7, 38, 59], and much smaller exponents are known [16].

From zeros to primes

Write L=log⁡q\mathcal{L}=\log q and express a zero of a Dirichlet LL-function as

ρ=1−λL+iμL.\rho=1-\frac{\lambda}{\mathcal{L}}+i\frac{\mu}{\mathcal{L}}.

Thus small λ\lambda means that the zero is close to the line σ=1\sigma=1; μ\mu is its height multiplied by log⁡q\log q. We group each nonprincipal character with its complex conjugate and call this a family. The parameters λ1,λ2,λ3\lambda_{1},\lambda_{2},\lambda_{3} record the first zero of successive families in a specified rectangle near 1. The parameter λ′\lambda^{\prime} records the next zero occurrence in the first family, after removing the distinguished zero and its conjugate where appropriate. Precise definitions, including multiplicities and ties, are given in Section 2.

A nonnegative weight hh, supported in [A,L][A,L] with A=L−2TA=L-2T and T=0.416829T=0.416829, detects primes between qAq^{A} and qLq^{L}. Let HH be its Laplace transform. Xylouris’s positivity criterion [145] (3.57) gives

∑p≡a (q)log⁡pph(log⁡pL)≥LH(0)φ(q)(1−W−η),\sum_{p\equiv a\ (q)}\frac{\log p}{p}h\left(\frac{\log p}{\mathcal{L}}\right)\geq\frac{\mathcal{L}H(0)}{\varphi(q)}(1-W-\eta),

where η=10−6\eta=10^{-6} and

W=1H(0)∑χ≠χ0∑ρ∈RP∣H((1−ρ)L)∣.W=\frac{1}{H(0)}\sum_{\chi\ne\chi_{0}}\sum_{\rho\in R_{P}}\left|H((1-\rho)\mathcal{L})\right|.

Here RPR_{P} is a fixed square in the normalized coordinates, and zeros are counted with multiplicity. It is therefore enough to prove W≤1−2ηW\leq1-2\eta. The contribution of an individual zero decays exponentially with λ\lambda, so zeros close to 1 require the most accurate estimates.

We combine three kinds of information about these zeros. First, a per-character bound estimates the total contribution of one LL-function from a lower bound for the parameters of its zeros. Second, a far-density bound limits a weighted sum over characters, with weight depending on a selected zero of each character. Third, near-density bounds constrain the characters whose selected zeros lie closest to 1. Zero-location estimates for λ1\lambda_{1}, λ′\lambda', λ2\lambda_{2}, and λ3\lambda_{3} determine which of these bounds are available in a given case.

The new near-density estimate.

Heath-Brown’s near-density estimate [51] bounds the number N(λ)N(\lambda) of characters with a zero in σ≥1−λ/L\sigma\ge1-\lambda/\mathcal{L}, ∣t∣≤1|t|\le1. Its proof applies the Cauchy–Schwarz inequality to a prime sum at the single point β1=1−λ1/L\beta_{1}=1-\lambda_{1}/\mathcal{L}, and compares the resulting Gram form of the characters with the diagonal. Because every character is tested at the same point, a zero at distance λ\lambda counts only through the single number N(λ)N(\lambda), and the bound is weaker than the density estimate of Heath-Brown’s §11 as soon as λ≥1.1\lambda\ge1.1 and void soon after. That density estimate, proved with Selberg sieve weights after Graham, has the form eq:11.4 of a sum over characters of a weight that depends on each character’s own distance λ(k)\lambda^{(k)}, and it contains the count eq:11.5 of the characters with λ(k)≤λ\lambda^{(k)}\le\lambda. In his closing list of possible improvements Heath-Brown writes [51]:

It would be nice to have a weighted version of Lemma 12.1, in the way that eq:11.4 is a weighted version of eq:11.5. Unfortunately, no neat way of achieving this seems available.

The graded near-density lemma (Theorem 8.4) supplies such an estimate. We test each character at its own anchor, a real parameter determining the point at which a smoothed prime sum is evaluated. Cauchy–Schwarz relates these prime sums to a Gram form of the characters. We estimate its off-diagonal terms by the local explicit formula and, where sieve weights are used, Burgess’s bound; Graham’s sieve asymptotic controls the diagonal terms. Allowing the anchors to vary is the grading in the name of the lemma.

After normalization, the resulting constraint has the form

(∑jajvj)+2≤∑jDjaj2+d(∑jaj)2(aj≥0).\left(\sum_{j} a_{j}v_{j}\right)_{+}^{2} \le\sum_{j} D_{j}a_{j}^{2} + d\left(\sum_{j} a_{j}\right)^{2} \qquad(a_{j} \ge0).

Here x+=max⁡(x,0)x_{+}=\max(x,0), the index jj runs over character–height entries, vjv_{j} is a lower bound for the response of an entry, and Dj>0D_{j}>0 and d>0d>0 bound its diagonal and common correlation costs. Most entries correspond to one selected zero; some retain a second zero of the same character, with an explicit correction for their correlation.

Proposition 8.8 turns this inequality into a form suited to computation: there is a number τ∈[0,d]\tau\in[0,\sqrt{d}] such that

∑j(vj−τ)+2Dj≤1−τ2d.\sum_{j}\frac{(v_{j}-\tau)_{+}^{2}}{D_{j}} \le1-\frac{\tau^{2}}{d}.

A single constraint now distinguishes zeros at different distances from 1. The sieve weighting has precedents in Graham’s work [39, 41], Heath-Brown’s far-density argument, and the sieve-weighted large-sieve inequalities of Motohashi [91].

Where the new lemma enters. In Heath-Brown’s proof the near-density estimate enters at the very end, in the assembly of [51], §15. There the characters with a zero below a level Λ\Lambda are sorted into bins (Λr+1,Λr](\Lambda_{r+1},\Lambda_{r}], with Λr=Λ−0.025r\Lambda_{r}=\Lambda-0.025r; each character is charged the cost of the end of its bin nearer to s=1s=1; and the numbers of characters in the bins are controlled only through the counts N(Λr)N(\Lambda_{r}), bounded one level at a time by Lemma 12.1 (his Table 13). The far-density lemma controls the characters beyond Λ\Lambda. Xylouris’s assembly [145], §6 has the same structure, with a sharper form of Lemma 12.1 (his Lemma 5.3). A count N(λ)N(\lambda) treats all characters with a zero below λ\lambda alike, so it cannot tell a few zeros very close to s=1s=1 from many zeros further away. In our proof this place is taken by the near rows of the leaf programs described below. Each near row is one instance of Theorem 8.4: a single quadratic constraint in which every bin of characters enters with its own feature, computed at its own anchor. The weighted version of Lemma 12.1 that Heath-Brown asked for is thus used exactly where his count was used, in every leaf program, and it is the main source of the improvement (Section 1.6).

The finite case analysis.

We divide the middle range 0.1≤λ1<1.50.1\le\lambda_{1}<1.5 into cases determined by the type of the first family and intervals for the first few zero parameters. There are four levels in the computation, serving different purposes.

  1. A root case specifies a range of possible zero configurations. The 58 parent rows taken from published zero-location tables lead to 4453 root cases, covering the middle range.

  2. A leaf is a terminal case after further subdivision and valid zero-location exclusions. There are 4788 leaves that require numerical bounds.

  3. A leaf program groups characters into bins according to their selected zero parameters. Its nonnegative variables are the numbers of characters in these bins, together with weighted masses for the tails. The objective bounds WW, and its constraints express the far-density bound, restrictions on the first families, and the near-density inequalities. For fixed thresholds these constraints are linear.

  4. A threshold box bounds the auxiliary numbers τ\tau in the near rows. On each box, a linear relaxation is either excluded or bounded by exact dual multipliers. Subdividing these boxes covers every possible choice of thresholds.

The case tree partitions information about zeros; the threshold boxes partition the auxiliary parameters used to bound them. Keeping these two subdivisions distinct is essential to the coverage argument.

Each leaf, or each subcase of a leaf, has its own certificate, a binary tree of threshold boxes. The 4788 leaves give 5591 such certificate trees, because some leaves are subdivided further, and these trees contain 4,196,879 threshold boxes. On each box the near rows are replaced by linear relaxations, some with two alternative forms, and every choice of alternatives, a relaxation case, is certified separately: the boxes carry 29,397,336 relaxation cases, of which 9430 are shown to be infeasible and the others are bounded by their own integer dual multipliers. The largest certified value is 0.9999998223…<10.9999998223\ldots< 1; it bounds the zero sum together with the required error allowance. All certificate inequalities are checked in integer arithmetic. The subdivisions and zero-location arguments of the tree do not depend on the target exponent; only the leaf programs do. Table 2 compares these numbers with the case analyses of Heath-Brown and Xylouris, and Table 10 lists every level of the analysis.

[51][145]This paper
L=5.5L=5.5 (1992)L=5L=5 (2011)L=3.99L=3.99
Near-density inputcounts N(λ)N(\lambda) from Lemma 12.1counts N(λ)N(\lambda) from a sharper Lemma 12.1the weighted (graded) lemma, Theorem 8.4
Numerical tables1211 more58 rows from theirs, plus over 100 new
Final case analysis14 intervals of λ1\lambda_121 cases, each split by two zero counts4453 roots, 4788 leaves
How a case is closedfloating point, without rounding analysisMaple, 10-digit floating pointexact certificates on 4.2 million boxes
Largest value of WW (must be below 1)0.99430.9980.99999982

Table 2. Three proofs of an explicit Linnik constant compared, in the middle range of the first zero (λ1≥0.348\lambda_1 \ge0.348 for Heath-Brown and Xylouris, 0.1≤λ1<1.50.1 \le\lambda_1 < 1.5 here). The last row is the largest bound for the normalized zero sum WW over all cases of the final assembly: for Heath-Brown the largest total he reports, for Xylouris his stated bound, and for this paper the largest certified value, a bound for W+2ηW+2\eta. The entry “without rounding analysis” paraphrases Heath-Brown’s own remark [51], §1, quoted above.

References

  1. [1]David L. Applegate, William Cook, Sanjeeb Dash, and Daniel G. Espinoza, Exact solutions to linear programming problems, Oper. Res. Lett. 35 (2007), no. 6, 693–699.DOI
  2. [2]Jeremy Avigad, Mathematics and the formal turn, Bull. Amer. Math. Soc. (N.S.) 61 (2024), no. 2, 225–240.arxiv.org/abs/2311.00007
  3. [3]Jeremy Avigad, Kevin Donnelly, David Gray, and Paul Raff, A formally verified proof of the prime number theorem, ACM Trans. Comput. Log. 9 (2007), no. 1, Art. 2.DOI
  4. [4]Eric Bach and Jonathan Sorenson, Explicit bounds for primes in residue classes, Math. Comp. 65 (1996), no. 216, 1717–1735.
  5. [5]Chris Bailey, nanoda lib, GitHub repository ammkrn/nanoda_lib, 2020, an external type checker for Lean 4.
  6. [6]William D. Banks and Igor E. Shparlinski, Bounds on short character sums and L-functions with characters to a powerful modulus, J. Anal. Math. 139 (2019), no. 1, 239–263.DOI
  7. [7]M. B. Barban, Yu. V. Linnik, and N. G. Chudakov, On prime numbers in an arithmetic progression with a prime-power difference, Acta Arith. 9 (1964), no. 4, 375–390.DOI
  8. [8]Kübra Benli, Shivani Goel, Henry Twiss, and Asif Zaman, Explicit Deuring–Heilbronn phenomenon for Dirichlet L-functions, Proc. Amer. Math. Soc. 154 (2026), no. 2, 509–525.DOI
  9. [9]Michael A. Bennett, Greg Martin, Kevin O’Bryant, and Andrew Rechnitzer, Explicit bounds for primes in arithmetic progressions, Illinois J. Math. 62 (2018), no. 1–4, 427–532.arxiv.org/abs/1802.00085
  10. [10]Enrico Bombieri, Le grand crible dans la théorie analytique des nombres, second ed., Astérisque, vol. 18, Société Mathématique de France, Paris, 1987 (French), First edition 1974.
  11. [11]D. A. Burgess, On character sums and L-series, Proc. London Math. Soc. (3) 12 (1962), 193–206.DOI
  12. [12]———, On character sums and primitive roots, Proc. London Math. Soc. (3) 12 (1962), 179–192.DOI
  13. [13]———, On character sums and L-series. II, Proc. London Math. Soc. (3) 13 (1963), 524–536.DOI
  14. [14]———, The character sum estimate with r = 3, J. London Math. Soc. (2) 33 (1986), no. 2, 219–226.DOI
  15. [15]Emanuel Carneiro, Micah B. Milinovich, Emily Quesada-Herrera, and Antonio Pedro Ramos, Fourier optimization, the least quadratic non-residue, and the least prime in an arithmetic progression, Math. Comp. (2025), to appear; published electronically 2 December 2025, doi:10.1090/mcom/4154.DOI
  16. [16]Mei-Chu Chang, Short character sums for composite moduli, J. Anal. Math. 123 (2014), no. 1, 1–33.arxiv.org/abs/1201.0299
  17. [17]Bin Chen, Vishal Gupta, and Yung Chi Li, Large value estimates for Dirichlet polynomials with characters and zero density of Dirichlet L-functions, 2025, arXiv:2507.08296.arxiv.org/abs/2507.08296
  18. [18]Jingrun Chen, On the least prime in an arithmetical progression, Sci. Sinica 14 (1965), 1868–1871. MR 188172
  19. [19]———, On the least prime in an arithmetical progression and two theorems concerning the zeros of Dirichlet’s L-functions, Sci. Sinica 20 (1977), no. 5, 529–562. MR 476668
  20. [20]———, On the least prime in an arithmetical progression and theorems concerning the zeros of Dirichlet’s L-functions. II, Sci. Sinica 22 (1979), no. 8, 859–889. MR 549597
  21. [21]Jingrun Chen and Jianmin Liu, On the least prime in an arithmetical progression. III, Sci. China Ser. A 32 (1989), no. 6, 654–673. MR 1056044
  22. [22]———, On the least prime in an arithmetical progression. IV, Sci. China Ser. A 32 (1989), no. 7, 792–807. MR 1058000
  23. [23]———, On the least prime in an arithmetical progression and theorems concerning the zeros of Dirichlet’s L-functions (V), International Symposium in Memory of Hua Loo Keng, Vol. I: Number Theory (Sheng Gong, Qi-Keng Lu, Yuan Wang, and Lo Yang, eds.), Springer, Berlin, 1991, pp. 19–42.DOI
  24. [24]S. Chowla, On the least prime in an arithmetical progression, J. Indian Math. Soc. (N.S.) 1 (1934), 1–3.DOI
  25. [25]Vašek Chvátal, Linear programming, A Series of Books in the Mathematical Sciences, W. H. Freeman and Company, New York and San Francisco, 1983.
  26. [26]Harold Davenport, Multiplicative number theory, third ed., Graduate Texts in Mathematics, vol. 74, Springer-Verlag, New York, 2000, Revised and with a preface by Hugh L. Montgomery.
  27. [27]Ch.-J. de la Vallée Poussin, Recherches analytiques sur la théorie des nombres premiers, Ann. Soc. Sci. Bruxelles 20 (1896), 183–256, 281–397 (French).
  28. [28]———, Sur la fonction ζ(s) de Riemann et le nombre des nombres premiers inférieurs à une limite donnée, Mém. Couronnés et Autres Mém. Publ. Acad. Roy. Sci. Lett. Beaux-Arts Belg. 59 (1899), 1–74 (French).DOI
  29. [29]Leonardo de Moura and Sebastian Ullrich, The Lean 4 theorem prover and programming language, Automated Deduction – CADE 28 (André Platzer and Geoff Sutcliffe, eds.), Lecture Notes in Comput. Sci., vol. 12699, Springer, 2021, pp. 625–635.DOI
  30. [30]Max Deuring, Imaginäre quadratische Zahlkörper mit der Klassenzahl 1, Math. Z. 37 (1933), no. 1, 405–415.
  31. [31]P. G. Lejeune Dirichlet, Beweis des Satzes, dass jede unbegrenzte arithmetische Progression, deren erstes Glied und Differenz ganze Zahlen ohne gemeinschaftlichen Factor sind, unendlich viele Primzahlen enthält, G. Lejeune Dirichlet’s Werke, Vol. 1 (L. Kronecker, ed.), Reimer, Berlin, 1889, Reissued by Cambridge University Press, 2012, pp. 313–342.
  32. [32]E. Fogels, On the zeros of L-functions, Acta Arith. 11 (1965), no. 1, 67–96.DOI
  33. [33]J. B. Friedlander and H. Iwaniec, Exceptional characters and prime numbers in arithmetic progressions, Int. Math. Res. Not. 2003 (2003), no. 37, 2033–2050.
  34. [34]———, Opera de cribro, Amer. Math. Soc. Colloq. Publ., vol. 57, Amer. Math. Soc., Providence, RI, 2010.DOI
  35. [35]———, Selberg’s sieve of irregular density, Acta Arith. 209 (2023), 385–396.arxiv.org/abs/2206.03479
  36. [36]———, Sifting for small primes from an arithmetic progression, Sci. China Math. 66 (2023), no. 12, 2715–2730.arxiv.org/abs/2303.06122
  37. [37]P. X. Gallagher, A large sieve density estimate near σ = 1, Invent. Math. 11 (1970), no. 4, 329–339.DOI
  38. [38]———, Primes in progressions to prime-power modulus, Invent. Math. 16 (1972), no. 3, 191–201.DOI
  39. [39]S. W. Graham, Applications of sieve methods, Ph.D. thesis, University of Michigan, 1977, 187 pp., ProQuest 7804710. MR 2627480DOI
  40. [40]———, An asymptotic estimate related to Selberg’s sieve, J. Number Theory 10 (1978), no. 1, 83–94.DOI
  41. [41]———, On Linnik’s constant, Acta Arith. 39 (1981), no. 2, 163–179.DOI
  42. [42]Andrew Granville and Carl Pomerance, On the least prime in certain arithmetic progressions, J. London Math. Soc. (2) 41 (1990), no. 2, 193–200.DOI
  43. [43]T. H. Gronwall, Sur les séries de Dirichlet correspondant à des caractères complets, Rend. Circ. Mat. Palermo 35 (1913), 145–159.DOI
  44. [44]Larry Guth and James Maynard, New large value estimates for Dirichlet polynomials, Ann. of Math. (2) 203 (2026), no. 2, 623–675.arxiv.org/abs/2405.20552
  45. [45]H. Halberstam and H.-E. Richert, Sieve methods, London Math. Soc. Monogr., vol. 4, Academic Press, London, 1974.
  46. [46]Thomas Hales, Mark Adams, Gertrud Bauer, Tat Dat Dang, John Harrison, Le Truong Hoang, Cezary Kaliszyk, Victor Magron, Sean McLaughlin, Tat Thang Nguyen, Quang Truong Nguyen, Tobias Nipkow, Steven Obua, Joseph Pleso, Jason Rute, Alexey Solovyev, Thi Hoai An Ta, Nam Trung Tran, Thi Diep Trieu, Josef Urban, Ky Vu, and Roland Zumkeller, A formal proof of the Kepler conjecture, Forum Math. Pi 5 (2017), e2.
  47. [47]John Harrison, Formalizing an analytic proof of the prime number theorem, J. Automat. Reason. 43 (2009), no. 3, 243–261.DOI
  48. [48]D. R. Heath-Brown, Hybrid bounds for Dirichlet L-functions, Invent. Math. 47 (1978), no. 2, 149–170.
  49. [49]———, The density of zeros of Dirichlet’s L-functions, Canad. J. Math. 31 (1979), no. 2, 231–240.
  50. [50]———, Siegel zeros and the least prime in an arithmetic progression, Quart. J. Math. Oxford Ser. (2) 41 (1990), no. 4, 405–418.
  51. [51]———, Zero-free regions for Dirichlet L-functions, and the least prime in an arithmetic progression, Proc. London Math. Soc. (3) 64 (1992), no. 2, 265–338.
  52. [52]———, Burgess’s bounds for character sums, Number Theory and Related Fields: In Memory of Alf van der Poorten (Jonathan M. Borwein, Igor Shparlinski, and Wadim Zudilin, eds.), Springer Proc. Math. Stat., vol. 43, Springer, New York, 2013, pp. 199–213.
  53. [53]Hans Heilbronn, On the class-number in imaginary quadratic fields, Quart. J. Math. Oxford Ser. 5 (1934), no. 1, 150–160.DOI
  54. [54]Harald Andrés Helfgott, The ternary Goldbach problem, 2015, arXiv:1501.05438.arxiv.org/abs/1501.05438
  55. [55]Q. Huangfu and J. A. J. Hall, Parallelizing the dual revised simplex method, Math. Program. Comput. 10 (2018), no. 1, 119–142.arxiv.org/abs/1503.01889
  56. [56]M. N. Huxley, On the difference between consecutive primes, Invent. Math. 15 (1972), no. 2, 164–170.DOI
  57. [57]A. E. Ingham, The distribution of prime numbers, Cambridge Tracts in Mathematics and Mathematical Physics, vol. 30, Cambridge University Press, Cambridge, 1932.
  58. [58]———, On the estimation of N(σ, T), Quart. J. Math. Oxford Ser. 11 (1940), no. 1, 201–202.DOI
  59. [59]H. Iwaniec, On zeros of Dirichlet’s L series, Invent. Math. 23 (1974), no. 2, 97–104.DOI
  60. [60]———, On the Brun–Titchmarsh theorem, J. Math. Soc. Japan 34 (1982), no. 1, 95–123.DOI
  61. [61]———, Conversations on the exceptional character, Analytic Number Theory: Lectures given at the C.I.M.E. Summer School held in Cetraro, Italy, July 11–18, 2002, Lecture Notes in Math., vol. 1891, Springer, Berlin, 2006, pp. 97–132.DOI
  62. [62]H. Iwaniec and Emmanuel Kowalski, Analytic number theory, Amer. Math. Soc. Colloq. Publ., vol. 53, Amer. Math. Soc., Providence, RI, 2004.
  63. [63]Christian Jansson, Rigorous lower and upper bounds in linear programming, SIAM J. Optim. 14 (2004), no. 3, 914–935.DOI
  64. [64]Matti Jutila, A new estimate for Linnik’s constant, Ann. Acad. Sci. Fenn. Ser. A I 471 (1970), 8 pp. MR 271056DOI
  65. [65]———, On a density theorem of H. L. Montgomery for L-functions, Ann. Acad. Sci. Fenn. Ser. A I 520 (1972), 13 pp. MR 327681DOI
  66. [66]———, On Linnik’s constant, Math. Scand. 41 (1977), 45–62.DOI
  67. [67]Habiba Kadiri, Une région explicite sans zéros pour la fonction ζ de Riemann, Acta Arith. 117 (2005), no. 4, 303–339 (French).DOI
  68. [68]———, Explicit zero-free regions for Dirichlet L-functions, Mathematika 64 (2018), no. 2, 445–474.
  69. [69]Anatolij A. Karatsuba, Basic analytic number theory, Springer-Verlag, Berlin, 1993, Translated from the Russian by Melvyn B. Nathanson.DOI
  70. [70]Bryce Kerr, Moments of character sums to composite modulus, 2019, arXiv:1904.04578.arxiv.org/abs/1904.04578
  71. [71]S. Knapowski, On Linnik’s theorem concerning exceptional L-zeros, Publ. Math. Debrecen 9 (1962), 168–178.
  72. [72]Alex Kontorovich, Terence Tao, et al., Prime number theorem and ..., GitHub repository AlexKontorovich/PrimeNumberTheoremAnd blueprint (the PNT+ project), 2024.
  73. [73]Youness Lamzouri, Xiannan Li, and Kannan Soundararajan, Conditional bounds for the least quadratic non-residue and related problems, Math. Comp. 84 (2015), no. 295, 2391–2412, Corrigendum: Math. Comp. 86 (2017), no. 307, 2551–2554, doi:10.1090/mcom/3261.
  74. [74]E. Landau, Über imaginär-quadratische Zahlkörper mit gleicher Klassenzahl, Nachr. Ges. Wiss. Göttingen, Math.-Phys. Kl. (1918), 277–284.
  75. [75]Lean FRO, Comparator, GitHub repository leanprover/comparator, 2025, a trustworthy judge for Lean proofs.
  76. [76]Junxian Li, Kyle Pratt, and George Shakan, A lower bound for the least prime in an arithmetic progression, Quart. J. Math. 68 (2017), no. 3, 729–758.arxiv.org/abs/1607.02543
  77. [77]Yu. V. Linnik, On the least prime in an arithmetic progression. I. The basic theorem, Rec. Math. [Mat. Sbornik] N.S. 15(57) (1944), 139–178. MR 12111
  78. [78]———, On the least prime in an arithmetic progression. II. The Deuring–Heilbronn phenomenon, Rec. Math. [Mat. Sbornik] N.S. 15(57) (1944), 347–368. MR 12112
  79. [79]Ming-Chit Liu and Tianze Wang, A numerical bound for small prime solutions of some ternary linear equations, Acta Arith. 86 (1998), no. 4, 343–383.DOI
  80. [80]Kaisa Matomäki, Jori Merikoski, and Joni Teräväinen, Primes in arithmetic progressions and short intervals without L-functions, 2024, arXiv:2401.17570.arxiv.org/abs/2401.17570
  81. [81]James Maynard, On the Brun–Titchmarsh theorem, Acta Arith. 157 (2013), no. 3, 249–296.arxiv.org/abs/1201.1777
  82. [82]Kevin S. McCurley, Explicit zero-free regions for Dirichlet L-functions, J. Number Theory 19 (1984), no. 1, 7–32.DOI
  83. [83]Zaizhao Meng, A note on the Linnik’s constant, 2010, arXiv:1010.3544.arxiv.org/abs/1010.3544
  84. [84]H. L. Montgomery, Topics in multiplicative number theory, Lecture Notes in Math., vol. 227, Springer-Verlag, Berlin, 1971.
  85. [85]———, Ten lectures on the interface between analytic number theory and harmonic analysis, CBMS Regional Conference Series in Mathematics, vol. 84, Amer. Math. Soc., Providence, RI, 1994.DOI
  86. [86]H. L. Montgomery and R. C. Vaughan, The large sieve, Mathematika 20 (1973), no. 2, 119–134.
  87. [87]———, Multiplicative number theory I. Classical theory, Cambridge Stud. Adv. Math., vol. 97, Cambridge University Press, Cambridge, 2007.
  88. [88]Ramon E. Moore, Interval analysis, Prentice-Hall Series in Automatic Computation, Prentice-Hall, Englewood Cliffs, N. J., 1966.
  89. [89]Ramon E. Moore, R. Baker Kearfott, and Michael J. Cloud, Introduction to interval analysis, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2009.DOI
  90. [90]Michael J. Mossinghoff and Timothy S. Trudgian, Nonnegative trigonometric polynomials and a zero-free region for the Riemann zeta-function, J. Number Theory 157 (2015), 329–349.arxiv.org/abs/1410.3926
  91. [91]Y. Motohashi, On a density theorem of Linnik, Proc. Japan Acad. 51 (1975), 815–817.DOI
  92. [92]———, Primes in arithmetic progressions, Invent. Math. 44 (1978), no. 2, 163–178.DOI
  93. [93]———, Lectures on sieve methods and prime number theory, Tata Inst. Fund. Res. Lectures on Math. and Phys., vol. 72, Tata Institute of Fundamental Research and Springer-Verlag, Berlin, 1983.
  94. [94]Władysław Narkiewicz, The development of prime number theory: From Euclid to Hardy and Littlewood, Springer Monographs in Mathematics, Springer-Verlag, Berlin, 2000.
  95. [95]Arnold Neumaier and Oleg Shcherbina, Safe bounds in linear and mixed-integer linear programming, Math. Program. 99 (2004), no. 2, 283–296.DOI
  96. [96]Steven Obua and Tobias Nipkow, Flyspeck II: the basic linear programs, Ann. Math. Artif. Intell. 56 (2009), no. 3–4, 245–272.DOI
  97. [97]A. Page, On the number of primes in an arithmetic progression, Proc. London Math. Soc. (2) 39 (1935), no. 1, 116–141.DOI
  98. [98]Chengdong Pan, On the least prime in an arithmetical progression, Sci. Record (N.S.) 1 (1957), 311–313. MR 105398
  99. [99]———, On the least prime in an arithmetical progression, Acta Sci. Natur. Univ. Pekinensis (1958), no. 1, 3–36 (Chinese).
  100. [100]Ian Petrow and Matthew P. Young, The Weyl bound for Dirichlet L-functions of cube-free conductor, Ann. of Math. (2) 192 (2020), no. 2, 437–486.DOI
  101. [101]E. Phragmén and Ernst Lindelöf, Sur une extension d’un principe classique de l’analyse et sur quelques propriétés des fonctions monogènes dans le voisinage d’un point singulier, Acta Math. 31 (1908), 381–406.
  102. [102]J. Pintz, Elementary methods in the theory of L-functions, V. The theorems of Landau and Page, Acta Arith. 32 (1977), no. 2, 163–171.DOI
  103. [103]———, Elementary methods in the theory of L-functions, VIII. Real zeros of real L-functions, Acta Arith. 33 (1977), no. 1, 89–98.DOI
  104. [104]———, A new explicit formula in the additive theory of primes with applications II. The exceptional set in Goldbach’s problem, 2018, arXiv:1804.09084.arxiv.org/abs/1804.09084
  105. [105]———, Some new density theorems for Dirichlet L-functions, Banach Center Publ. 118 (2019), 231–244.arxiv.org/abs/1804.05552
  106. [106]D. J. Platt, Numerical computations concerning the GRH, Math. Comp. 85 (2016), no. 302, 3009–3027.arxiv.org/abs/1305.3087
  107. [107]D. J. Platt and Tim Trudgian, The Riemann hypothesis is true up to 3 · 10¹², Bull. Lond. Math. Soc. 53 (2021), no. 3, 792–797.DOI
  108. [108]G. Pólya, Über die Verteilung der quadratischen Reste und Nichtreste, Nachr. Ges. Wiss. Göttingen, Math.-Phys. Kl. (1918), 21–29.
  109. [109]Carl Pomerance, A note on the least prime in an arithmetic progression, J. Number Theory 12 (1980), no. 2, 218–223.DOI
  110. [110]Karl Prachar, Primzahlverteilung, Grundlehren der Mathematischen Wissenschaften, vol. 91, Springer-Verlag, Berlin, 1957 (German).
  111. [111]K. A. Rodosskiĭ, On the least prime number in an arithmetic progression, Mat. Sbornik N.S. 34(76) (1954), 331–356. MR 62156
  112. [112]J. Barkley Rosser and Lowell Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), no. 1, 64–94.
  113. [113]Siegfried M. Rump, Verification methods: rigorous results using floating-point arithmetic, Acta Numer. 19 (2010), 287–449.DOI
  114. [114]Stelios Sachpazis, A pretentious proof of Linnik’s estimate for primes in arithmetic progressions, Mathematika 69 (2023), no. 3, 879–902.
  115. [115]Alexander Schrijver, Theory of linear and integer programming, Wiley-Interscience Series in Discrete Mathematics, John Wiley & Sons, Chichester, 1986.
  116. [116]Atle Selberg, On an elementary method in the theory of primes, Norske Vid. Selsk. Forh., Trondhjem 19 (1947), no. 18, 64–67. MR 22871
  117. [117]———, Lectures on sieves, Collected Papers, Vol. II, Springer-Verlag, Berlin, 1991, pp. 65–247.
  118. [118]C. L. Siegel, Über die Classenzahl quadratischer Zahlkörper, Acta Arith. 1 (1935), no. 1, 83–86.
  119. [119]Alexey Solovyev and Thomas C. Hales, Efficient formal verification of bounds of linear programs, Intelligent Computer Mathematics (Calculemus 2011 and MKM 2011, Bertinoro, Italy) (James H. Davenport, William M. Farmer, Josef Urban, and Florian Rabe, eds.), Lecture Notes in Comput. Sci., vol. 6824, Springer, 2011, pp. 123–132.DOI
  120. [120]Kannan Soundararajan and Jesse Thorner, Weak subconvexity without a Ramanujan hypothesis, Duke Math. J. 168 (2019), no. 7, 1231–1268.DOI
  121. [121]Michael Stoll, Dirichlet’s theorem on primes in arithmetic progression, Lean 4 Mathlib source file Mathlib/NumberTheory/LSeries/PrimesInAP.lean, 2024.
  122. [122]Terence Tao, Tim Trudgian, and Andrew Yang, New exponent pairs, zero density estimates, and zero additive energy estimates: a systematic approach, Math. Comp. 95 (2026), no. 362, 2941–2990.arxiv.org/abs/2501.16779
  123. [123]Tikao Tatuzawa, On a theorem of Siegel, Jpn. J. Math. 21 (1951), 163–178. MR 51262DOI
  124. [124]Gérald Tenenbaum, Introduction to analytic and probabilistic number theory, third ed., Graduate Studies in Mathematics, vol. 163, Amer. Math. Soc., Providence, RI, 2015, Translated from the 2008 French edition by Patrick D. F. Ion. MR 3363366DOI
  125. [125]The mathlib Community, The Lean mathematical library, Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP 2020), ACM, 2020, arXiv:1910.09336, pp. 367–381.DOI
  126. [126]The mpmath development team, mpmath: a Python library for arbitrary-precision floating-point arithmetic (version 1.3.0), 2023, https://mpmath.org/.
  127. [127]Jesse Thorner and Asif Zaman, An explicit version of Bombieri’s log-free density estimate and Sárközy’s theorem for shifted primes, Forum Math. 36 (2024), no. 4, 1059–1080.
  128. [128]———, Refinements to the prime number theorem for arithmetic progressions, Math. Z. 306 (2024), no. 3, Paper No. 54.
  129. [129]E. C. Titchmarsh, A divisor problem, Rend. Circ. Mat. Palermo 54 (1930), 414–429.DOI
  130. [130]———, The theory of functions, second ed., Oxford University Press, Oxford, 1939.
  131. [131]———, The theory of the Riemann zeta-function, second ed., Clarendon Press, Oxford, 1986. Revised by D. R. Heath-Brown.
  132. [132]Warwick Tucker, Validated numerics: A short introduction to rigorous computations, Princeton University Press, Princeton, NJ, 2011.DOI
  133. [133]P. Turán, On a density theorem of Yu. V. Linnik, Magyar Tud. Akad. Mat. Kutató Int. Közl. 6 (1961), 165–179. MR 146155
  134. [134]———, On some recent results in the analytical theory of numbers, 1969 Number Theory Institute (State Univ. New York, Stony Brook, N.Y., 1969), Proc. Sympos. Pure Math., vol. 20, Amer. Math. Soc., Providence, RI, 1971, pp. 359–374. MR 316400DOI
  135. [135]———, On a new method of analysis and its applications, John Wiley & Sons, New York, 1984, a Wiley-Interscience Publication.
  136. [136]I. M. Vinogradov, Sur la distribution des résidus et des nonrésidus des puissances, J. Soc. Phys.-Math. Univ. Perm 1 (1918), 94–98.
  137. [137]Pauli Virtanen, Ralf Gommers, Travis E. Oliphant, Matt Haberland, Tyler Reddy, David Cournapeau, Evgeni Burovski, Pearu Peterson, Warren Weckesser, Jonathan Bright, et al., SciPy 1.0: fundamental algorithms for scientific computing in Python, Nature Methods 17 (2020), no. 3, 261–272.
  138. [138]Samuel S. Wagstaff, Jr., Greatest of the least primes in arithmetic progressions having a given modulus, Math. Comp. 33 (1979), no. 147, 1073–1080.
  139. [139]Wei Wang, On the least prime in an arithmetic progression, Acta Math. Sinica 29 (1986), no. 6, 826–836. MR 888852
  140. [140]———, On the least prime in an arithmetic progression, Acta Math. Sinica (N.S.) 7 (1991), no. 3, 279–289.DOI
  141. [141]André Weil, Sur les ‘formules explicites’ de la théorie des nombres premiers, Comm. Sém. Math. Univ. Lund [Medd. Lunds Univ. Mat. Sem.] (1952), no. Tome supplémentaire, 252–265 (French). MR 53152
  142. [142]David Vernon Widder, The Laplace transform, Princeton Mathematical Series, vol. 6, Princeton University Press, Princeton, N. J., 1941.
  143. [143]Triantafyllos Xylouris, On Linnik’s constant, 2009, arXiv:0906.2749; Diplomarbeit, Universität Bonn (in German; title page: Über die Linnicksche Konstante).arxiv.org/abs/0906.2749
  144. [144]———, On the least prime in an arithmetic progression and estimates for the zeros of Dirichlet L-functions, Acta Arith. 150 (2011), no. 1, 65–91.DOI
  145. [145]———, Über die Nullstellen der Dirichletschen L-Funktionen und die kleinste Primzahl in einer arithmetischen Progression, Dissertation, Universität Bonn, 2011, Bonner Mathematische Schriften 404.DOI
  146. [146]———, Linniks Konstante ist kleiner als 5, Chebyshevskiĭ Sb. 19 (2018), no. 3, 80–94 (German).
  147. [147]Asif Zaman, On the least prime ideal and Siegel zeros, Int. J. Number Theory 12 (2016), no. 8, 2201–2229.DOI
  148. [148]Genheng Zhao, The exceptional set of Goldbach problem and Linnik’s constant, 2025, arXiv:2511.05631.arxiv.org/abs/2511.05631

Paper details

vlnc:W_yqt2gcbh
Version
v1 · latest
Published
Added
License
CC BY 4.0
Usage

views · 17

downloads · 8

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

  • Mathematics

Anthropic Claude Opus 5.5, OpenAI ChatGPT Astra 6, XAi Grok 4.7

View statement
Looking for related papers…
Contents