2000 character limit reached
On a family of arithmetic series related to the Möbius function
Published 4 Sep 2024 in math.NT | (2409.02754v4)
Abstract: Let $P-(n)$ denote the smallest prime factor of a natural integer $n>1$. Furthermore let $\mu$ and $\omega$ denote respectively the M\"obius function and the number of distinct prime factors function. We show that, given any set ${{\scr P}}$ of prime numbers with a natural density, we have $\sum_{P-(n)\in \scr P}\mu(n)\omega(n)/n=0$ and provide a effective estimate for the rate of convergence. This extends a recent result of Alladi and Johnson, who considered the case when ${\scr P}$ is an arithmetic progression.
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.