Sommes friables de fonctions multiplicatives al\'eatoires
Abstract
We consider a sequence \f(p)\p\ prime of independent random variables taking values 1 with probability 1/2, and extend f to a multiplicative arithmetic function defined on the squarefree integers. We investigate upper bounds for f(x,y), the summatory function of f on y-friable integers ≤ x. We obtain estimations of the type f(x,y) (x,y)1/2+ε, more precise formulas being given in suitable regions for x,y. In the special case y=x, this leads to the estimate Mf(x) = Σn ≤ x f(n) x\, ( x)2+ε, which improves on previous bounds.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.