An almost sure upper bound for random multiplicative functions on integers with a large prime factor
Number Theory
2021-05-21 v1
Abstract
Let be a Rademacher or a Steinhaus random multiplicative function. Let small. We prove that, as , we almost surely have where stands for the largest prime factor of . This gives an indication of the almost sure size of the largest fluctuations of .
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