Infinitely Many Primes Using Generating Functions
From MaRDI portal
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 page was built for publication: Infinitely Many Primes Using Generating Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6310450)
