In 1984, Daboussi gave an "elementary" proof of the prime number theorem whose central actors are smooth numbers (numbers with no large prime factors). We explain a variant of his argument that might be considered even more elementary.
Introduction
Let μ denote the Möbius function, and let M(x):=∑n≤xμ(n) be the corresponding summatory function. We will give a simple proof of the following 1897 theorem of von Mangoldt [8].
Theorem 1.M(x)=o(x), as x→∞.
Landau showed that Theorem 1 is “elementarily equivalent” to the prime number theorem (PNT). (His 1899 doctoral thesis proves Theorem 1 from the prime number theorem [6 pp. 6–16]; Landau published the converse implication in 1911 [7 pp. 973–979]. See also the elegant textbook treatment by Shapiro [11 §10.3, pp. 408–414].) Here “equivalent” means that if either statement is assumed, there is a quick proof of the other, significantly shorter than a proof of either statement from scratch. The adverb “elementarily” draws a contrast with the more typical complex function-theoretic methods employed in prime number theory: The quick proofs in question involve only real variables, with Riemann’s zeta function never (explicitly) mentioned.
It was quite a sensation when, in 1948, Erdős and Selberg announced that the prime number theorem itself could be established by elementary means [3, 10]. For historical context, see Spencer and Graham’s article [12], which reproduces notes by Ernst Straus, and Goldfeld’s account [4], which also draws on letters from files Selberg made available to him (cf. the interview [1]). Both Erdős’s and Selberg’s arguments use Selberg’s “symmetry formula”; see [11], eq. (10.4.10), p. 419. In 1984, Daboussi [2] gave a very different elementary proof of the PNT, using smooth numbers. Further elementary proofs were later given by Hildebrand [5], via a large sieve inequality, and — quite recently — Richter [9], through a general result on the distribution of Ω(n), the number of prime factors of n counted with multiplicity.
In this note, we present a simplification of Daboussi’s argument for Theorem 1. Let P+(n) denote the largest prime factor of n, adopting the convention that P+(1):=1. We say n is y-smooth if P+(n)≤y. For x≥1 and y≥2, put
Ψ(x,y):=n≤xP+(n)≤y∑1,M(x,y):=n≤xP+(n)≤y∑μ(n).
Set
a:=x→∞limsupx∣M(x)∣,
so that the PNT is equivalent to proving that a=0.
A central component of Daboussi’s proof is a comparison between ∣M(x,y)∣ and aΨ(x,y), based on slight variants of the “logarithmic” relations
(We prove both of these in § 4 below.) Daboussi extracts what he needs from (1) and (2) by integrating against the same carefully constructed kernel function; see [2 Lemma 2, p. 162, and §III.3 and §IV, pp. 163–164]. Our proof avoids any need to introduce a special kernel function by working directly with the inequality for (∣M(x,y)∣−aΨ(x,y))logx that results from subtracting a copies of (2) from (1).
In their lovely book, Tenenbaum and Mendès France describe a variant of Daboussi’s argument that, like ours, avoids Daboussi’s kernel function [13 Chapter 4, §§5–7, pp. 92–104]. The tradeoff is the need to develop certain ground-floor estimates from the theory of smooth numbers, including that Ψ(xu,x)/xu≈ρ(u) (Dickman’s ρ-function) for bounded u (with a key step in their proof being that ∣M(xu,x)∣/xu⪅aρ(u) in the same range). Our arrangement requires no nontrivial estimates on Ψ(x,y).
Of course, we do need something. We will make free use of the following two estimates of Mertens, valid for x≥2:
p≤x∑plogp=logx+O(1),p≤x∏(1−p1)−1≪logx.
For (elementary) proofs, see for example [11 Chapter 9].
Throughout the paper, the variable p is reserved for primes, and the exponent k on a prime power pk is always assumed to be a positive integer.
Use of LLMs
This is a work of exposition. It is offered as a (hopefully!) human-readable “digestion” of output produced by ChatGPT 6 Astra, as prompted by the author. P. P. takes no credit for the new mathematics but stands with, by, and beside the final manuscript.
Lean formalizations of Theorem 1 and the smooth-number argument presented here, together with verification records and instructions for reproducing the checks, are available at https://github.com/twonth/daboussi-pnt-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.
Other acknowledgements
P. P. presented this argument in a Fall 2026 graduate course offered at the University of Georgia. He thanks the class, and the university, for allowing him this opportunity to workshop the proof.
A Fundamental Lemma and the deduction of Theorem 1
The Möbius function is important in number theory precisely because it provides an elegant, number-theoretically friendly answer to the question of “who is number 1”:
1n=1=d∣n∑μ(d).
Letting x≥1 and summing this identity over n≤x,
1=d≤x∑μ(d)⌊dx⌋=xd≤x∑dμ(d)−d≤x∑μ(d){dx}.
Consequently,
d≤x∑dμ(d)<x1+⌊x⌋≤2(x≥1).
Expressing the same sum by partial summation, we have
n≤x∑nμ(n)=xM(x)+∫1xtM(t)tdt,
and hence
∫1xtM(t)tdt<3(x≥1).(3)
Our proof of Theorem 1 combines (3) with the following estimate, whose proof occupies §§§ 3–§ 4.
Lemma 2 (Fundamental Lemma). As x→∞,
∫1x(a−t∣M(t)∣)tdt=o(logx).
(Here v+=max{v,0} denotes the positive part of $v.)
Roughly speaking, Lemma 2 says that ∣M(t)∣/t spends most of its time close to its limit superior a, with time measured logarithmically (i.e., with respect to the logarithmic measure dt/t).
Proof of Theorem 1, assuming the Fundamental Lemma. Suppose for a contradiction that a>0, and fix B:=exp(12/a). We first use (3) to show that every interval [X,BX], with X≥1, contains a u for which
∣M(u)∣≤2au.(4)
Indeed, if there is no such u, then M(t) is nonzero throughout [X,BX]. Since M takes integer values and jumps by at most 1, it has constant sign there. This gives
∫XBXtM(t)tdt=∫XBXt∣M(t)∣tdt≥2alogB=6.
But (3), applied at BX and at X, bounds the left-hand side strictly below 6.
Now let X≥X0:=8/a, and choose u∈[X,BX] satisfying (4). To obtain a lower bound for the integral in the Fundamental Lemma, we extend this estimate to nearby values of t. For u≤t≤u(1+a/8), the bound ∣μ(n)∣≤1 gives
We apply this bound with X=(2B)jX0, for j=0,…,N−1, noting that the corresponding intervals (X,2BX] are disjoint and contained in (1,(2B)NX0]. Adding these estimates gives
∫1(2B)NX0(a−t∣M(t)∣)tdt≥(4alog(1+a/8))N.
But the Fundamental Lemma implies that our left-hand side is o(log((2B)NX0))=o(N) as N→∞. This contradiction forces a=0. □
Splitting off bounded prime factors
Recall from the introduction that Ψ(x,y)=∑n≤x,P+(n)≤y1 while M(x,y)=∑n≤x,P+(n)≤yμ(n).
Fix y≥2, and put
P=p≤y∏p.
We have ∣M(t,y)∣≤Ψ(t,y) and, since every positive integer at most y is y-smooth,
M(t,y)=M(t),Ψ(t,y)=⌊t⌋(1≤t≤y).
At the other end of the range, only the squarefree y-smooth integers contribute to M(t,y), and these are precisely the divisors of P. Thus, for t≥P,
M(t,y)=d∣P∑μ(d)=0.(5)
Following Daboussi, we compare ∣M(x,y)∣ with aΨ(x,y). The following estimate gets us started.
Proposition 3. For every y≥2,
∫1∞(t∣M(t,y)∣−atΨ(t,y))tdt≥0.(6)
Proof. Each positive integer admits a unique decomposition in the form n=bc, where P+(b)≤y and (c,P)=1. Since (b,c)=1, the multiplicativity of μ gives
M(x)=c≤x(c,P)=1∑μ(c)M(x/c,y).
The terms with c≤x/P vanish by (5). Taking absolute values in the remaining terms and grouping according to the value of j:=⌊x/c⌋<P, we obtain
∣M(x)∣≤j=1∑P−1∣M(j,y)∣x/(j+1)<c≤x/j(c,P)=1∑1.
View y as fixed. Since every block of P consecutive integers c contains precisely φ(P) that satisfy (c,P)=1,
(For the final equality, we use that M(t,y)=M(j,y) on [j,j+1), that M(t,y)=0 for t≥P, and that ∫jj+11/tdt=1/j−1/(j+1). ) Rearranging gives
∫1∞t∣M(t,y)∣tdt≥aφ(P)P=ap≤y∏(1−1/p)−1.(7)
The product on the right also occurs in the integral of Ψ(t,y)/t. In fact,
∫1∞tΨ(t,y)tdt=P+(n)≤y∑n1=p≤y∏(1−1/p)−1.(8)
To see this, observe that by partial summation,
n≤XP+(n)≤y∑n1=XΨ(X,y)+∫1XtΨ(t,y)tdt.(9)
For every positive integer n≤X, and every prime p, the exponent of p in n is at most logX/log2. Hence (keeping in mind that y is fixed),
Ψ(X,y)≤(1+log2logX)π(y)=o(X).
Sending X to infinity in (9) yields the first equality in (8), while the second follows by expanding the Euler product. Finally, the proposition itself follows by comparing (7) and (8). □
To apply Proposition 3 to the Fundamental Lemma, we separate its integrand into positive and negative parts. Define “excess” and “deficit” functions by
using (10) in the last step. We have therefore reduced the Fundamental Lemma to proving that, as y→∞,
∫1∞Ey(t)tdt=o(logy).(11)
Making less of the excess
Proof of Lemma 2. To prove (11), we start with the trivial bounds
0≤Ey(t)≤t∣M(t,y)∣≤tΨ(t,y)≤1.
Together with (8) and Mertens’ estimate, this gives
∫1∞Ey(t)tdt≤p≤y∏(1−1/p)−1≪logy.(12)
So the remaining fight is over the case of a single letter: We must improve O(logy) to o(logy).
We split the integral at y. The required estimate for ∫1yEy(t)dt/t follows from the definition of a. Indeed, given ε>0, choose T≥1 so that ∣M(t)∣/t≤a+ε for t≥T. Then, for T≤t≤y,
Ey(t)=(t∣M(t)∣−a+at{t})+≤ε+ta.
Integrating from 1 to y, using Ey(t)≤1 below T, we get that
∫1yEy(t)tdt≤logT+εlog(y/T)+a
for all y≥T. Hence,
y→∞limsuplogy1∫1yEy(t)tdt≤ε.
As ε>0 is arbitrary,
∫1yEy(t)tdt=o(logy).(13)
To handle the remaining range (y,∞), we need the “logarithmic” relations quoted in the introduction. We begin their derivation with some simple consequences of Möbius inversion. Writing Λ for the von Mangoldt function and starting from
Replacing each difference on the right by its positive part only increases the right-hand side and so preserves the inequality. Since the resulting right-hand side is nonnegative, we may also replace the left-hand side by its positive part. Noting that (∣M(t,y)∣−aΨ(t,y))+=tEy(t), we deduce after dividing by x that
With the factor log(t/y) omitted, we already had an O(logy) bound; the advantage here is that the new factor is sensitive to where the excess occurs.
Let’s mop up. Recall that ∫1yEy(t)dt/t=o(logy). Slightly larger values of t, say y≤t≤y1+ε with ε>0 fixed, pose no trouble. Since Ey(t)≤1,
∫yy1+εEy(t)tdt≤∫yy1+εtdt=εlogy,
which will be acceptable to us upon taking ε small.
It remains to consider t that are substantially larger than y, meaning t≥y1+ε. Moving the contribution from [1,y] in (20) to the right and using (13), we obtain
Combining the estimates for the three ranges gives ∫1∞Ey(t)dt/t≤εlogy+o(logy). Dividing by logy and letting y→∞, we obtain
y→∞limsuplogy1∫1∞Ey(t)tdt≤ε.
But ε>0 is arbitrary, and so ∫1∞Ey(t)dt/t=o(logy), as desired. This proves (11) and hence the Fundamental Lemma. As shown in § 2, it follows that M(x)=o(x). □
Department of Mathematics, University of Georgia, Athens GA 30602
[1]N. A. Baas and C. F. Skau, The lord of the numbers, Atle Selberg. On his life and mathematics, Bull. Amer. Math. Soc. (N.S.) 45 (2008), no. 4, 617–649. An extended version of the interview is available at https://www.math.ntnu.no/Selberg-interview/.
[2]H. Daboussi, Sur le théorème des nombres premiers, C. R. Acad. Sci. Paris Sér. I Math. 298 (1984), no. 8, 161–164.
[3]P. Erdős, On a new method in elementary number theory which leads to an elementary proof of the prime number theorem, Proc. Nat. Acad. Sci. U.S.A. 35 (1949), 374–384.pubmed.ncbi.nlm.nih.gov/16588909
[4]D. Goldfeld, The elementary proof of the prime number theorem: an historical perspective, in Number Theory (New York, 2003), D. Chudnovsky, G. Chudnovsky, and M. Nathanson (eds.), Springer, New York, 2004, 179–192.DOI
[5]A. Hildebrand, The prime number theorem via the large sieve, Mathematika 33 (1948), 23–30.
[7]———, Über die Äquivalenz zweier Hauptsätze der analytischen Zahlentheorie, Sitzungsber. Kaiserl. Akad. Wiss. Wien, Math.-Naturwiss. Kl., Abt. IIa 120 (1911), 973–988.
[8]H. von Mangoldt, Beweis der Gleichung ∑ₖ₌₁∞ μ(k)/k = 0, Sitzungsber. Königl. Preuß. Akad. Wiss. Berlin (1897), 835–852.
[9]F. K. Richter, A new elementary proof of the Prime Number Theorem, Bull. London Math. Soc. 53 (2021), 1365–1375.DOI
[10]A. Selberg, An elementary proof of the prime-number theorem, Ann. of Math. (2) 50 (1949), 305–313.DOI
[11]H. N. Shapiro, Introduction to Theory of Numbers, John Wiley & Sons, New York, 1983; reprinted by Dover Publications, Mineola, NY, 2008.
[12]J. Spencer and R. Graham, The elementary proof of the prime number theorem, Math. Intelligencer 31 (2009), no. 3, 18–23.DOI
[13]G. Tenenbaum and M. Mendès France, The Prime Numbers and Their Distribution, translated by P. G. Spain, Student Mathematical Library, vol. 6, American Mathematical Society, Providence, RI, 2000.DOI