How negative can $\boldsymbol{\sum}_{\textbf{n}\le \textbf{x}}\frac{\textbf{f}(\textbf{n})}{\textbf{n}}$ be?

Abstract Turán observed that logarithmic partial sums $\sum_{n\le x}{f(n)}/{n}$ of completely multiplicative functions (in the particular case of the Liouville function $f(n)=\lambda(n)$ ) tend to be positive. We develop a general approach to prove two results aiming to explain this phenomena. Firstly, we show that there exist constants $C, x_0\ge 1,$ such that for any completely multiplicative function f satisfying $-1\le f(n)\le 1$ , we have \begin{equation*}\sum_{n\le x}\frac{f(n)}{n}\ge -\frac{C(\log\log\log{x})^2}{(\log\log{x})}, \quad x\ge x_0.\end{equation*} This improves a previous bound due to Granville and Soundararajan. Secondly, we show that if f is a typical (random) completely multiplicative function $f:\mathbb{N}\to \{-1,1\}$ , the probability that $\sum_{n\le x}{f(n)}/{n}$ is negative for a given large x , is $O(\exp(-\exp({\log x\cdot \log\log\log x}/{C\log \log x}))).$ This improves on recent work of Angelo and Xu.

Authors

Institutions

Publication Details

Journal
Mathematical Proceedings of the Cambridge Philosophical Society
Published
2026-01-05
DOI
https://doi.org/10.1017/s0305004125101837
Primary Topic
Analytic Number Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

How negative can $\boldsymbol{\sum}_{\textbf{n}\le \textbf{x}}\frac{\textbf{f}(\textbf{n})}{\textbf{n}}$ be?

Oleksiy Klurman, Bryce Kerr
Mathematical Proceedings of the Cambridge Philosophical Society
Analytic Number Theory Research
article

How negative can $\boldsymbol{\sum}_{\textbf{n}\le \textbf{x}}\frac{\textbf{f}(\textbf{n})}{\textbf{n}}$ be?

Oleksiy Klurman, Bryce Kerr
article en

Abstract

Abstract Turán observed that logarithmic partial sums $\sum_{n\le x}{f(n)}/{n}$ of completely multiplicative functions (in the particular case of the Liouville function $f(n)=\lambda(n)$ ) tend to be positive. We develop a general approach to prove two results aiming to explain this phenomena. Firstly, we show that there exist constants $C, x_0\ge 1,$ such that for any completely multiplicative function f satisfying $-1\le f(n)\le 1$ , we have \begin{equation*}\sum_{n\le x}\frac{f(n)}{n}\ge -\frac{C(\log\log\log{x})^2}{(\log\log{x})}, \quad x\ge x_0.\end{equation*} This improves a previous bound due to Granville and Soundararajan. Secondly, we show that if f is a typical (random) completely multiplicative function $f:\mathbb{N}\to \{-1,1\}$ , the probability that $\sum_{n\le x}{f(n)}/{n}$ is negative for a given large x , is $O(\exp(-\exp({\log x\cdot \log\log\log x}/{C\log \log x}))).$ This improves on recent work of Angelo and Xu.

Mathematical Proceedings of the Cambridge Philosophical Society
UNSW Sydney (AU), University of Bristol (GB)
Openalex Percentile: Top 94%
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.