2000 character limit reached
A higher order Levin-Feinleib theorem
Published 20 Jan 2022 in math.NT | (2201.08076v1)
Abstract: When restricted to some non-negative multiplicative function, say f, bounded on primes and that vanishes on non square-free integers, our result provides us with an asymptotic for $\sum_{n \le X}f(n)/n$ with error term $O((\log X){\kappa-h-1+\varepsilon})$ (for any positive $\varepsilon>0$) as soon as we have $\sum_{p\le Q}f(p)(\log p)/p=\kappa\log Q+\eta+O(1/(\log2Q)h)$ for a non-negative $\kappa$ and some non-negative integer $h$. The method generalizes the 1967-approach of Levin and Fainleib and uses a differential equation.
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.