An almost sure upper bound for random multiplicative functions on integers with a large prime factor
Abstract
Let f be a Rademacher or a Steinhaus random multiplicative function. Let >0 small. We prove that, as x→ +∞, we almost surely have |Σn≤ x\\ P(n)>xf(n)|≤x( x)1/4+, where P(n) stands for the largest prime factor of n. This gives an indication of the almost sure size of the largest fluctuations of f.
0
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.