An infinitude of proofs of the infinitude of primes

2006/10/02 by L. J. P. Kilford, Kilford, L. J. P.
Mathematics · #11A41 #Analytic Number Theory Research #FOS: Mathematics #History and Theory of Mathematics #Mathematics and Applications #Number Theory (math.NT)

paper · pdf · doi:10.48550/arxiv.math/0610066

openalex publication_date 2006/10/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.

Related

• A Very Short Proof of the Infinitude of Primes
• Infinitely Many Primes Using Generating Functions
• A combinatorial theorem of Schur implies infinitude of primes
• Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 B.C.--2022) and another new proof
• Folkman's theorem and the primes