We show how Selberg's symmetry formulas and the recent finding that there are no Landau–Siegel zeros connect to give a radically elementary proof of Linnik's theorem on the least prime in an arithmetic progression.
Introduction
The purpose of this note is to give a simple proof of a celebrated 1944 theorem of Linnik [16, 17].
Theorem 1. There is an absolute, effectively computable constant L such that, for every q≥2 and every a coprime to q, some prime p≡a(modq) satisfies p≤qL.
The traditional proofs of Theorem 1 go through zero-free regions, log-free zero-density estimates, and zero-repulsion phenomena; see, e.g., Iwaniec–Kowalski [12 Chapter 18]. Beginning with work of Elliott [3, 4], several authors have given proofs where the analytic burden is shifted onto sieve methods and the theory of mean values of multiplicative functions. See, for instance, the treatments of Koukoulopoulos [15 Chapter 27] (cf. [14, 21]), Friedlander and Iwaniec [6, 7, 8], and Matomäki, Merikoski, and Teräväinen [18]. Our new proof of Linnik’s theorem is short, elementary (no zeros of L-functions were harmed in the course of the argument), and “unpretentious.”
This argument comes out of recent breakthrough work announced by OpenAI [20]. Specifically, we need the following arithmetic encoding of the nonexistence of Siegel zeros.
Proposition 2 (Anti-concentration on ψ=−1). For everyε>0there is an effectively computableAεsuch that, for every primitive nonprincipal real characterψof conductorf,
p≤xψ(p)=−1∑plogp≤(21+ε)logx(x≥fAε).
For many decades, Proposition 2 was thought to lie very deep. However, Green [11] has recently propounded a proof of (a slightly stronger version of) Proposition 2 that fits in under 5 pages.1 A technically simpler approach, using only undergraduate mathematics, has been presented by van Dijk [26]. We include a version of his argument in Appendix 1. See also Banks [1], Barreto [2], Kerr [13], and Tao [25].
In addition to Proposition 2, we require certain variants of Selberg’s symmetry formula [22]. Let B be a sufficiently large integer, and put
Key words and phrases. Linnik’s theorem, least prime in an arithmetic progression, Selberg’s symmetry formula, sieve methods, Landau–Siegel zeros.
Below, o(1) indicates a quantity that tends (effectively!) to zero as B→∞, uniformly in q≥2 and in the choice of reduced residue class. In sums and products, p, r, s, ℓ denote primes unless otherwise indicated.
Proposition 3 (Two- and three-prime symmetry formulas). Uniformly for (c,q)=1 and x≥Z,
For fixed modulus, corresponding formulas without the restrictions p, r, s>Y appear in Selberg [22 (3.4) and (3.6)]. A related uniform two-prime symmetry formula was given by Friedlander [5, §2]. To keep the paper reasonably self-contained, we prove both formulas (1) and (2) in § 3 below.
The overarching strategy of the proof goes back to Selberg [22, §§5–6] (see also [23 §3]): The two-prime symmetry formula suggests that primes are either well distributed in progressions or concentrated in the nontrivial coset of an index-two subgroup. (This connection is also explained and extensively developed by Granville in [9] and [10 §2].) Using also the three-prime formula, one shows such concentration is forced by the existence of a coprime progression with no small primes (or with few small primes). This is then ruled out by an anti-concentration estimate—in Selberg’s paper [22], this is his Lemma 1, while in ours, it is Proposition 2. Selberg’s regime of uniformity is different from ours (the paper [22] considers only fixed q) but the philosophy is the same!
Use of Super Intelligence
This is intended as a work of exposition rather than (traditional) research. All of the novel mathematics emerged from dialogues with ChatGPT Astra, with prompting from the human author (P. P.) to nudge the proof in the direction of his own mathematical aesthetic. Astra also drafted the first version of the paper, with the human author revising the text for the benefit of fellow Earth persons. P. P. claims no credit for the underlying mathematics but takes responsibility for the final manuscript.
Lean formalizations of the main results and the arguments in the appendices, together with verification records and instructions for reproducing the checks, are available at https://github.com/twonth/missing-linnik-lean. The formalized results use only Lean’s standard axioms of propositional extensionality (propext), classical choice (Classical.choice), and quotient soundness (Quot.sound).
P. P. thanks OpenAI and Anthropic for providing complimentary access through the ChatGPT for Academic Researchers program and the Claude Team plan for scientists, respectively.
Not from concentrate: Proof of Theorem 1 modulo the symmetry formulas
The case q=2 is immediate, so assume q≥3. We suppose that there is no prime p≤Z3 with p≡a(modq) and derive a contradiction once B is sufficiently large.
For each character χ modulo q, put
bχ=logZ1Y<p≤Z∑pχ(p)logp;
ends_mid=1 this is essentially a weighted average of χ along the primes in (Y,Z]. Note that by the choice of Y, every prime p appearing in the sum is larger than q, and so each χ(p)=0. We have
bχ0=1+o(1),∣bχ∣≤bχ0.
Here is how the proof will go. Using the three-prime symmetry formula, we show that a residue class containing no small primes forces ∑χ=χ0∣bχ∣3 to be large. Comparing this with the bound for ∑χ=χ0∣bχ∣2 obtained from Parseval’s identity and the Brun–Titchmarsh inequality, we find that there must be a nonprincipal real character χ with bχ=±(1+o(1)). The two-prime symmetry formula rules out the plus sign, forcing bχ=−(1+o(1)), contrary to the anti-concentration estimate of Proposition 2.
Down to business. Apply the three-prime symmetry formula (2) with c=a and x=Z3. On the one hand, our assumption that there are no small primes a mod q implies that the single-prime sum there vanishes, so that
where the middle inequality uses a weak consequence of the Brun–Titchmarsh theorem (we prove what we need below, in (14)). Hence E:=∑χ=χ0∣bχ∣2≤1+o(1). But
1−o(1)≤χ=χ0∑∣bχ∣3≤(χ=χ0max∣bχ∣)E.
It follows that ∣bχ∣=1+o(1) for some nonprincipal χ. Moreover, χ must be real: Otherwise E≥∣bχ∣2+∣bχ∣2=2∣bχ∣2≥2−o(1).
There are two possibilities: Either bχ=−1+o(1) or bχ=1+o(1). We now rule out the latter. Since exactly half the reduced residue classes satisfy χ(c)=−1, the two-prime symmetry formula (1) implies that
But then the left-hand side of (4) is at most M−logZ+2M−∑Y<r≤Zrlogr=o(log2Z), contradicting (4) for large B. We use here that χ(pr)=−1 implies χ(p)=−1 or χ(r)=−1.
We conclude that bχ=−1+o(1), and therefore
Y<p≤Zχ(p)=−1∑plogp=(1−o(1))logZ.(5)
Let ψ be the primitive nonprincipal real character inducing χ, of conductor f∣q. Then ψ(p)=χ(p) for all primes p>Y. Choose B so large that the 1−o(1) coefficient in (5) exceeds 3/4 and so that, in the notation of Proposition 2, B2≥A1/4. Then
Absurd! Thus, there must be some prime p≡a(modq) with p≤Z3=q3B2. We have shown Theorem 1 with L=3B2. □
Unbreaking symmetry: Proof of Proposition 3
Once we know that Y-rough numbers (numbers all of whose prime factors exceed Y) are sufficiently equidistributed in progressions, elementary divisor-sum manipulations give the symmetry formulas. To establish this latter fact, we use the following consequence of the Fundamental Lemma of the Sieve (for which see, e.g., [15 Theorem 18.11(a)]). Write P−(n) for the least prime factor of n, with P−(1)=∞, and let
V(z):=p≤z∏(1−1/p).
Lemma 4 (Estimate for the count of rough numbers in progressions). For (b,q)=1, z≥max(2,q), t>0, and all sufficiently large real h,
For (b,q)=1, let Ab(t) count the Y-rough integers n≤t with n≡b(modq), and let A(t) count all Y-rough integers n≤t. Applying Lemma 4 with h a sufficiently large, fixed constant, and z=Y1/(6h), we deduce that
Ab(t)≪φ(q)logYt,A(t)≪logYt(t≥Y).(7)
(Here the O(Y1/2) error term gets absorbed, since t≥Y=qB and φ(q)logY≪Y1/2 for sufficiently large B. The condition z≥q required by Lemma 4 is satisfied once B≥6h, which we may assume.)
Moreover, we have the uniform distribution estimate
When logt/logY is sufficiently large, (8) follows from (6) with z=Y and h=6logYlogt. (The O(t1/2) error is again easily absorbed.) When logt/logY is bounded, (8) is immediate from (7).
The extra uniformity in x will be needed when establishing the three-prime formula (2).
Taking inspiration from H. N. Shapiro [24 §10.4, pp. 417–418], we start from the classical identity logn=∑d∣nΛ(d). Multiplying by logn and splitting logn=logd+log(n/d) gives
In the double sum on d,v, group terms according to the value of m=dv; this yields
log2n=m∣n∑(Λ(m)logm+uv=m∑Λ(u)Λ(v)),
so that by Möbius inversion,
d∣n∑μ(d)log2(n/d)=Λ(n)logn+uv=n∑Λ(u)Λ(v).(10)
We use (8) to compare the average of (10), taken over Y-rough numbers in a given residue class mod q, with the corresponding average over unrestricted Y-rough numbers. First we argue that, uniformly for v≥1 and (b,q)=1,
To prove (11), we note that t1log2t vanishes at t=1, so that the left-hand side is unchanged upon adding the restriction m>Y. For v≤Y, the left-hand side is zero. For v>Y, we evaluate by integrating t1log2t against d(Ab(t)−φ(q)−1A(t)), from t=Y to t=v. Proceeding by parts, the t=Y and t=v contributions fit comfortably inside the claimed error in (11), while the remaining integral contributes
Letting d run over Y-rough numbers not exceeding x (so that (d,q)=1), we apply (11) with v=x/d and b≡cd−1(modq), multiply by μ(d)/d, and sum on d. We find that
The same estimate holds if we remove the contributions to the Λ-terms from proper prime powers. Indeed, the total contribution of such terms is ≪logx∑p>Y,j≥2logp/pj≪logx/Y, which fits comfortably inside the existing error.
It remains to evaluate the parenthesized main term on the right-hand side of (13), with n,u,v restricted to primes. By partial summation and Mertens’ estimate for the partial sums of logp/p,
These are almost the sums we want; we still have to impose p,r>Y. This is no trouble at all: Removing the primes at most Y from either sum costs only O(logYlogx). This proves (9) and hence (1).
Remark 5 (a crude Brun–Titchmarsh inequality). The two-prime symmetry formula also yields logp/p-weighted estimates for primes in progressions (cf. [22 §3, eqns. (3.4) and (3.7)]). For example, forget about the (nonnegative) contribution of prime pairs and use partial summation to introduce a weight of 1/logt. This gives
Again, we follow Shapiro (compare the derivation of equation (10.4.23) in [24 §10.4, pp. 421–422]; see also Exercise 7, p. 424). Let x≥Z. Introducing a weight of logt into (9) gives
(The final equality follows from Mertens’ theorem for the partial sums of logp/p, after introducing a weight of log2(x/t). Swapping p and r shows that twice the pair sum in (15) is the pair sum in (14). We subtract twice (15) from (14). The pair terms and main terms both cancel, completing the proof of (2).
Proof of Proposition 2
Following van Dijk [26], we prove the following slightly more precise version of Proposition 2.
Proposition 6. For every integer t≥3 and every primitive real Dirichlet character ψ of conductor f≥2,
p≤xψ(p)=−1∑plogp≤(21+O(1/t))logx(x≥ft2),(16)
with an absolute, effective implied constant.
First, a little groundwork. All implied constants below are absolute and effective.
Let t≥3 be an integer, and let x≥ft2, as in the proposition. We may assume there is a prime p∈(8t,x] with ψ(p)=−1; otherwise,
By the classification of primitive real characters, we can identify ψ with a Kronecker symbol: ψ(⋅)=(⋅d), where d:=ψ(−1)f is a fundamental discriminant. See, for instance, [19 Theorem 9.13]. In particular, ψ(p)=−1 for an odd prime p precisely when d is a nonsquare modulo p.
Our proof of Proposition 6 proceeds in three steps:
Construct a matrix over Z[d] having a nonzero minor.
Show that small primes p having ψ(p)=−1 divide this minor to large powers.
Bound the absolute value of this minor under each embedding of Q(d).
If the left-hand side of (16) is too large, the size bounds of Step 3 will contradict the divisibility obtained in Step 2.
Step 1. A matrix with a nonzero minor
We take our matrix to have rows indexed by the formal monomials ZrWs, where r,s are nonnegative integers with r+ts<L, and columns indexed by integers j,u,v with 0≤j≤L/t and 0≤u,v≤L. Here the (j,u,v)-th entry of the ZrWs-th row is the jth Z-derivative of ZrWs evaluated at
(Z,W)=(u+vd,u−vd),(17)
that is, (r−j)!r!(u+vd)r−j(u−vd)s if j≤r, and 0 otherwise.
We let
N:=number of rows of our matrix,
E:=sum of the Z-degrees of the monomials indexing the rows.
Suppose p is an odd prime for which (pd)=−1. Then working in Z[d] mod p amounts to working in the field of p2 elements. Indeed,
Z[d]/(p)≃Z[T]/(T2−d,p)≃(Z/pZ)[T]/(T2−d)≃Fp2.
The argument below makes essential use of the fact, familiar to students of algebraic number theory, that the pth power map on Fp2 is induced by conjugation on Z[d]. The “freshman’s binomial theorem” yields a down-to-earth proof: For all u+vd∈Z[d],
where the second step uses Fermat’s little theorem and the last uses Euler’s congruence d(p−1)/2≡(pd)(modp).
Reduce the matrix modulo L. We claim that its rows are linearly independent over FL2. Supposing otherwise, we choose coefficients cr,s∈FL2, not all zero, giving a zero linear combination of the rows. Put
C(Z):=r+ts<L∑cr,sZr+Ls∈FL2[Z].
Since 0≤r<L, the exponents r+Ls are distinct, and so C(Z)=0.
In characteristic L, differentiation treats ZL as a constant. Thus, taking the jth derivative of Zr+Ls gives the same result as differentiating ZrWsj times with respect to Z and then setting W=ZL. By (18), (u+vd)L=u−vd in FL2, so the assumed linear dependence gives
C(j)(u+vd)=0
for all 0≤j≤L/t and all 0≤u,v≤L. Since ⌊L/t⌋<L, the factorials j! for 0≤j≤L/t are invertible in FL2. It follows that C vanishes to order at least ⌊L/t⌋+1>L/t at each of the (1+⌊L⌋)2>L distinct elements u+vd. (These are distinct because 1,d are linearly independent over FL and 0≤u,v<L.) As C=0, this forces degC>L2/t. On the other hand, every exponent appearing in C satisfies
r+Ls≤tL(r+ts)<L2/t,
so that degC<L2/t. Contradiction.
Hence, the rows are independent modulo L, and there is a minor Δ of order N which is nonzero modulo L and hence also nonzero in Z[d].
Step 2. Divisibility by small primes
Fix a prime p with t≤p≤L and ψ(p)=−1. We determine a power of p dividing Δ. For the row indexed by (r,s), put h=⌊r/p⌋, and replace its monomial ZrWs by
Zr−phWs(pZp−W)h.
As before, the new entries are obtained by taking Z-derivatives and evaluating at the conjugate pairs in (17).
We first check that all the new entries belong to Z[d]. By (18),
pZp−W∈Z[d]when(Z,W)=(u+vd,u−vd).
Moreover, its first Z-derivative is Zp−1, so all its positive-order Z-derivatives have integer coefficients. The product rule now shows that every Z-derivative of the replacement polynomial takes values in Z[d] at these pairs, as desired.
To see what these replacements do to the determinant, expand:
Every monomial on the right indexes an original row. Indeed, r−pk≥0, and
(r−pk)+t(s+k)=r+ts−k(p−t)≤r+ts<L.
Furthermore, every term in the sum has Z-degree less than r.
Order the rows by increasing r, breaking ties arbitrarily, and make the replacements from last to first. Each replacement multiplies the current row by p−h and adds a linear combination of earlier, unchanged rows. Thus, on the columns defining our minor Δ, the new determinant is
p∑r+ts<L⌊r/p⌋Δ.
Since all its entries belong to Z[d], so does this determinant. Hence p∑r+ts<L⌊r/p⌋ divides Δ. Since these prime powers are pairwise coprime, their product also divides Δ. Thus
D:=t≤p≤Lψ(p)=−1∏p∑r+ts<L⌊r/p⌋
divides Δ.
Let us estimate the size of D. Since ⌊r/p⌋≥r/p−1, we have ∑r+ts<L⌊r/p⌋≥E/p−N, and so
logD≥Et≤p≤Lψ(p)=−1∑plogp−Np≤L∑logp.(19)
Bounds under both embeddings
We begin with a few estimates for the rows of our matrix. Since 0≤r<L and 0≤s<L/t, we have N≪L2/t. For a lower bound on E, consider the rows with L/4≤r<L/2 and 0≤s<L/(4t). All these pairs satisfy r+ts<L. There are ≫L2/t of them, each contributing at least L/4 to E. Thus E≫L3/t, and so N≪E/L. Also, the sum of the W-degrees of the monomials indexing the rows is at most LN/t≪E/t.
We now bound the entries of our matrix in either embedding of Q(d) into C. Since ∣d∣=f, the grid coordinates u±vd have absolute value at most L(1+f)≤4Lf. The entry in row ZrWs and column (j,u,v) is zero if j>r; otherwise, its absolute value is at most
(r−j)!r!(4Lf)r+s−j≤Lj(4Lf)r+s≤LL/t(4Lf)r+s.
Each term in the determinant expansion contains one entry from each row and each column, and there are N! terms. Writing Δ for the conjugate of Δ, we obtain
Wrap-up. Now for the big finish. We compare (19) and (20), noting that N∑p≤Llogp≪NL≪E. If
t≤p≤Lψ(p)=−1∑plogp>21logL+C(tlogL+logf+1)
for a sufficiently large absolute effective C, both conjugates of Δ/D have absolute value less than 1. But Δ/D is a nonzero element of Z[d], so its norm is a nonzero integer of absolute value less than 1, a contradiction.
Adding the contribution of primes below t, keeping in mind the definition of L, we obtain
p≤xψ(p)=−1∑plogp≤21logx+O(tlogx+logf+t).
Since x≥ft2 and f≥2, both logf and t are O(logx/t). This gives (16) and completes the proof of Proposition 6. □
Remark 7. The strategy may be compared with Selberg’s proof of Lemma 1 in [22 §4], where he compares the size of a product of norms u2−dv2 over a rectangular grid with its prime factorization. Such products are closely connected with Vandermonde determinants on grid points u+vd. But the two arguments run in opposite directions. Selberg bounds his product from below and observes that an odd prime p with (pd)=−1 divides u2−dv2 only when it divides both u and v, so such primes barely show up in the factorization; the split primes are left to pick up the slack. We instead use the Frobenius congruence (18) to force the primes with ψ(p)=−1 to divide Δ many times over, and then let the size bound on Δ tell us there cannot be too many of them.
Appendix 2. Proof of Lemma 4
We give a proof using Selberg’s upper bound sieve. Although we make no claim of human originality for any part of this paper, this deserves particular emphasis here: All ingredients are standard.
Proposition 8 (Sieving progressions, à la Selberg). Let q be a positive integer, let P be a product of distinct primes, none dividing q, let R≥1, and put
H:=m∣Pm≤R∑φ(m)1.
Then, for every v>0 and integer a,
#{n≤v:n≡a(modq),(n,P)=1}≤qHv+R2.(21)
Proof. For d∣P, choose
ρd:=φ(d)Hμ(d)dk∣P(k,d)=1dk≤R∑φ(k)1.
and put ρd=0 otherwise. Thus ρ1=1 and ρd=0 for d>R. (This initially strange-seeming choice of coefficients arises naturally from a minimization problem; see [6, §7.1, pp. 90–92].) If (n,P)=1, then ∑d∣nρd=ρ1=1. Consequently,
In the last line, we use that [d,e] is coprime to q, so that the number of multiples of [d,e] in our progression is v/(q[d,e]), up to an error at most 1.
Continuing, observe that the products jk with j∣d, (k,d)=1, and dk≤R are distinct divisors of P at most R. Hence,
Comparing with the definition of ρd shows that each ∣ρd∣≤1. In particular, (∑d∣P∣ρd∣)2≤R2. Hence, Proposition 8 will be proved once we show that the double sum over d,e in (22) is 1/H.
Put b=dk. Since (d,k)=1, we have b∣P and φ(d)φ(k)=φ(b). Conversely, for each b∣P, every divisor d of b gives a coprime factorization b=d(b/d), since b is squarefree. Hence
Hence, H0−H≪H0e−logR/logz, and H=H0{1+O(e−logR/logz)}. So, once h=logR/logz is sufficiently large,
H1=H01{1+O(e−logR/logz)}.
But
H0−1=p∣P∏(1−p1)=p≤zp∤q∏(1−p1)=V(z)φ(q)q
(using in the last step that z≥q), and (24) follows.
Proof of the lower bound in (6)
Proof of the lower bound in (6). An integer n≡b(modq) removed by the sieve has least prime factor p≤z, where necessarily p∤q. Write n=pm, where m≤t/p, m≡bp−1(modq), and m is not divisible by any primes ℓ<p not dividing q. For each p≤z with p∤q, we use Proposition 8 to bound the number of removed integers with least prime factor p, by taking
v=t/p,P:=ℓ<pℓ∤q∏ℓ,R=zh.
(So the choice of R is unchanged from before.) Write
Vq:=p≤zp∤q∏(1−p1),Wp:=ℓ<pℓ∤q∏(1−ℓ1).
Arguing as in the proof of the upper bound, we find that the number of removed integers corresponding to a given p≤z is at most
pqtWp{1+O(e−logR/logp)}+R2.
Subtracting these counts from the total number t/q+O(1) of integers in our progression yields a main term of
1−p≤zp∤q∑pWpqt.
The parenthesized expression on the left simplifies to Vq (Buchstab’s identity): Indeed, Vq can be viewed as the density of integers not divisible by any prime p≤z, p∤q. The set of such integers is obtained by removing, for each p≤z, p∤q, those whose least prime factor not dividing q is p. (This is the same observation we made above, wearing a mustache and wig.) Each such set has density Wp/p.
Since Vq/q=V(z)/φ(q), the main term here is precisely tV(z)/φ(q). Also, zR2=z2h+1≤z3h. Thus, we will have our lower bound once we check that the sum in the first O-error is ≪e−hVq.
Uniformly for primes p≤z, we have
VqWp=p≤ℓ≤zℓ∤q∏(1−ℓ1)−1≪logplogz.
Put u=logz/logp≥1. For h≥2, the function u2e−hu is decreasing on [1,∞), so u2e−hu≤e−h. Since logR=hlogz,
[1]W. D. Banks, *On the OpenAI proof that Landau–Siegel zeros do not exist*, 2026, [arXiv:2610.15483](https://arxiv.org/abs/2610.15483).
[2]Barreto, K. (n.d.). An elementary proof of the non-existence of Landau–Siegel zeros.
[3]P. D. T. A. Elliott, *Multiplicative functions on arithmetic progressions. VII. Large moduli*, J. London Math. Soc. (2) 66 (2002), 14–28.DOI
[4]Elliott, P. D. T. A. (2002). The least prime primitive root and Linnik’s theorem. In Number Theory for the Millennium, I (pp. 393–418).
[6]J. Friedlander and H. Iwaniec, *Opera de Cribro*, Amer. Math. Soc. Colloq. Publ., vol. 57, American Mathematical Society, Providence, RI, 2010.DOI
[7]———, *Sifting for small primes from an arithmetic progression*, Sci. China Math. 66 (2023), 2715–2730; [arXiv:2303.06122](https://arxiv.org/abs/2303.06122).
[9]A. Granville, *On elementary proofs of the prime number theorem for arithmetic progressions, without characters*, Proceedings of the Amalfi Conference on Analytic Number Theory (Maiori, 1989), Università di Salerno, Salerno, 1992, 157–194.
[10]———, *Different approaches to the distribution of primes*, Milan J. Math. 78 (2010), 65–84; author’s version.DOI
[11]Green, B. (2026). On Landau–Siegel zeros. <a href="https://doi.org/https://hexagonmath.com/" rel="noopener noreferrer" target="_blank">https://doi.org/https://hexagonmath.com/</a>
[12]Iwaniec, H., & Kowalski, E. (2004). Analytic Number Theory. In Amer. Math. Soc. Colloq. Publ. (Vol. 53).
[13]B. Kerr, *A simpler proof that there are no Landau–Siegel zeros*, 2026, arXiv:2610.21099v1.arXiv
[14]D. Koukoulopoulos, *Pretentious multiplicative functions and the prime number theorem for arithmetic progressions*, Compos. Math. 149 (2013), 1129–1149.DOI
[15]D. Koukoulopoulos, *The Distribution of Prime Numbers*, Grad. Stud. Math., vol. 203, American Mathematical Society, Providence, RI, 2019.DOI
[16]Linnik, U. V. (1944). On the least prime in an arithmetic progression. I. The basic theorem. Rec. Math. [Mat. Sbornik], 15(57)(2), 139–178.
[17]Linnik, U. V. (1944). On the least prime in an arithmetic progression. II. The Deuring–Heilbronn phenomenon. Rec. Math. [Mat. Sbornik], 15(57)(3), 347–368.
[18]K. Matomäki, J. Merikoski, and J. Teräväinen, *Primes in arithmetic progressions and short intervals without L-functions*, 2024, arXiv:2401.17570.arXiv
[19]H. L. Montgomery and R. C. Vaughan, *Multiplicative Number Theory I. Classical Theory*, Cambridge Studies in Advanced Mathematics, vol. 97, Cambridge University Press, Cambridge, 2007.
[20]OpenAI, *Uniform exclusion of Landau–Siegel zeros*, OpenAI Math Release, October 1, 2026, online preprint.hub.valency.io/works/W_6sm4yjzs
[21]S. Sachpazis, *A pretentious proof of Linnik’s estimate for primes in arithmetic progressions*, Mathematika 69 (2023), no. 3, 879–902; doi:10.1112/mtk.12211.DOI
[22]A. Selberg, *An elementary proof of Dirichlet’s theorem about primes in an arithmetic progression*, Ann. of Math. (2) 50 (1949), 297–304.DOI
[23]—, *An elementary proof of the prime number theorem for arithmetic progressions*, Canad. J. Math. 2 (1950), 66–78.DOI
[24]H. N. Shapiro, *Introduction to the Theory of Numbers*, Wiley, New York, 1983.
[25]Tao, T. (2026). A sketch of the proof of non-existence of Siegel zeroes. What’s New.
[26]van Dijk, R. (2026). A Frobenius determinant proof of the non-existence of Landau–Siegel zeros. hexagon:2610.00409v2