⌘+K

Pulse Explore Communities Researchers Journals

Home Communities Explore

September 17, 2026Acta ArithmeticaOpen Access

Almost sure upper bound for random multiplicative functions

View Full Paper

Ask AI

Bookmark

Share

Abstract

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+ε.

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Rachid Caich (2026) studied this question.

synapsesocial.com/papers/6aad09f007b74b2d3c24bf8c https://doi.org/10.4064/aa250225-20-2

View Full Paper

Ask AI

Bookmark

Share

Keep reading

Synapse has enriched 5 related papers. Consider them for comparative context:

1Minimal zero-free regions for results on primes between consecutive perfect kth powersActa Arithmetica · Thu,
2Correlations of error terms for weighted prime counting functionsActa Arithmetica · Thu,
3Ramification groups of Galois extensions over local fields of positive characteristic with Galois group isomorphic to the group of unitriangular matricesActa Arithmetica · Tue,
4Indices of nilpotency in certain spaces of modular formsActa Arithmetica · Fri,
5On the distance between factorials and repunitsActa Arithmetica · Tue,

More from Acta Arithmetica

A note on Laurent’s paper on linear forms in two logarithms: the argument of an algebraic powerFri,
Vanishing properties of Fourier coefficients of holomorphic η-quotientsFri,
Resultant measures and minimal resultant loci for non-archimedean polynomial dynamicsFri,
A note on p-adic higher Mahler measuresTue,
Correlations of Farey fractions with square-free denominatorsTue,