Infinitely Many Primes Using Generating Functions
classification
🧮 math.HO
math.NT
keywords
proofprimeselementaryfunctionsgeneratingadditioncalculusdiverges
read the original abstract
In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only uses tools from elementary number theory and calculus. In addition, our proof highlights an interesting use of generating functions.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.