2000 character limit reached
Mertens' prime product formula, dissected
Published 9 Feb 2020 in math.NT and math.CO | (2002.03361v3)
Abstract: In 1874, Mertens famously proved an asymptotic formula for the product $p/(p-1)$ over all primes $p$ up to $x$. On the other hand, one may expand Mertens' prime product into series over numbers $n$ with only small prime factors. It is natural to restrict such series to numbers $n$ with a fixed number $k$ of prime factors. In this article, we obtain formulae for these series for each $k$, which together dissect Mertens' original estimate. The proof is by elementary methods of a combinatorial flavor.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.