Author
Rachid Caich
0 works0 citations
Recent research
- AI & ComputingOpen access
Almost sure upper bound for random multiplicative functions
Let ε>0. Let f be a Steinhaus or Rademacher random multiplicative function. We prove that almost surely, as x→+∞, ∑n⩽xf(n)≪x√(log2x)3/4+ε.