Daboussi's elementary proof of the prime number theorem, reconsidered

A mix of human-written and AI-generated textHuman understanding: all partsmath.NT — Number Theorymath.HO — History and Overview

Contributed by Paul Pollack ↗

Version 1 / Nov 19, 2026 / CC BY 4.0

Abstract

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.

Tools used

Anthropic
Claude Opus
OpenAI
ChatGPT

References

  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/.link
  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.
  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.
  5. A. Hildebrand, The prime number theorem via the large sieve , Mathematika 33 (1986), 23--30.
  6. E. Landau, Neuer Beweis der Gleichung ∑k=1∞μ(k)/k=0\sum_{k=1}^{\infty}\mu(k)/k=0 , Inauguraldissertation, Berlin, 1899.
  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=1∞μ(k)/k=0\sum_{k=1}^{\infty}\mu(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.
  10. A. Selberg, An elementary proof of the prime-number theorem , Ann. of Math. (2) 50 (1949), 305--313.
Show all 13 referencesShow fewer references
  1. H.\,N. Shapiro, Introduction to the Theory of Numbers , John Wiley & Sons, New York, 1983; reprinted by Dover Publications, Mineola, NY, 2008.
  2. J. Spencer and R. Graham, The elementary proof of the prime number theorem , Math. Intelligencer 31 (2009), no. 3, 18--23.
  3. 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.

Version history

  1. v1 · 9 pagesSubmitted by Paul PollackInitial depositCurrentNov 19, 2026