The reviewed record of science sign in
Pith

arxiv: 2205.05822 · v3 · pith:7YTE4VVW · submitted 2022-05-12 · math.NT · math.PR

On a Tur\'an conjecture and random multiplicative functions

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:7YTE4VVWrecord.jsonopen to challenge →

classification math.NT math.PR
keywords fracmultiplicativepositiveprobabilityrandomasymptoticboundcompletely
0
0 comments X
read the original abstract

We show that if $f$ is the random completely multiplicative function, the probability that $\sum_{n\le x}\frac{f(n)}{n}$ is positive for every $x$ is at least $1-10^{-45}$, while also strictly smaller than $1$. For large $x$, we prove an asymptotic upper bound of $O(\exp(-\exp( \frac{\log x}{C\log \log x })))$ on the exceptional probability that a particular truncation is negative, where $C$ is some positive constant.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.