Paperlane

no. 3 · Tuesday 27 October 2026

A sharp almost sure upper bound for partial sums of random multiplicative functions

Benjamin Durkan and Andrew Pearce-Crump

math.NT · v3

Abstract

We prove that, for either a Steinhaus random multiplicative function or a Rademacher random multiplicative function $f$, and every $\varepsilon>0$, almost surely $|\sum_{n\le x}f(n)|\ll_{\varepsilon,f}\sqrt{x}(\log\log x)^{1/4+\varepsilon}$. Together with Harper's almost sure lower bound, this determines the sharp logarithmic exponent in both models. This settles Harper's conjecture on the large fluctuations of random multiplicative functions.

comments
v3:AI declaration included
fields
Number Theory, Probability
pdf ↗ page arXiv:2607.29429 ↗