2000 character limit reached
Infinitely Many Primes Using Generating Functions (1811.12441v3)
Published 29 Nov 2018 in math.HO and math.NT
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.
Collections
Sign up for free to add this paper to one or more collections.