English

An almost sure upper bound for random multiplicative functions on integers with a large prime factor

Number Theory 2021-05-21 v1

Abstract

Let ff be a Rademacher or a Steinhaus random multiplicative function. Let ε>0\varepsilon>0 small. We prove that, as x+x\rightarrow +\infty, we almost surely have nxP(n)>xf(n)x(loglogx)1/4+ε,\bigg|\sum_{\substack{n\leq x\\ P(n)>\sqrt{x}}}f(n)\bigg|\leq\sqrt{x}(\log\log x)^{1/4+\varepsilon}, where P(n)P(n) stands for the largest prime factor of nn. This gives an indication of the almost sure size of the largest fluctuations of ff.

Keywords

Cite

@article{arxiv.2105.09565,
  title  = {An almost sure upper bound for random multiplicative functions on integers with a large prime factor},
  author = {Daniele Mastrostefano},
  journal= {arXiv preprint arXiv:2105.09565},
  year   = {2021}
}

Comments

25 pages, with a 6 pages long introduction

R2 v1 2026-06-24T02:17:27.457Z