December 24, 2022
Útulek Series, 4 | CF1761D Chapter, 4
Last time, I investigated the runtime of the Sieve of Eratosthenes, and left off with an introduction of Euler’s Product Formula (EPF). I have since come to realize that the domain for which EPF holds is nuanced and may greatly complicate the proof. Thus, instead of providing anything rigorous, I will instead quickly give intuition to EPF.
Recall the Prime Factorization Theorem (PFT), also known as the Fundamental Theorem of Arithmetic:
Theorem 0.1 (Prime Factorization Theorem): Every positive integer can be written as a product of prime numbers, and this product is unique up to the order of the factors.
We have, then, that every positive integer may be uniquely represented in the following form:
for all primes and non-negative exponents . Recognizing the RHS of Euler’s product formula as a geometric series, we have
As intuition, should , every positive integer occurs on the LHS exactly once. Similarly, by PFT, the positive integers must form a bijection with the RHS terms. For positive real in general, any -power can be represented with each an integer multiple of . Hence, Euler’s product formula should still hold.
Theorem 0.2 (Euler’s Product Formula): For positive real ,
As the harmonic series (the limit of which is ) is , and the RHS of Euler’s Product Formula is remarkably close to the prime harmonic series , which we suspect to be , we are inspired to take of both sides:
The RHS is actually remarkably similar to the prime harmonic series. Should we take the Taylor series about of , we have
There is a lot of abuse of notation going on here. First, taking of a divergent series in is no good, and similarly as goes to , we do not want to use it explicitly in showing the growth rate of . Still, should the be convergent, the result is intuitively within grasp.
Unfortunately, I’m a little short on time today, so I’ll leave the Taylor series for next time.