A new upper bound on the smallest counterexample to the Mertens conjecture

Abstract

We report the finding of the new upper bound on the lowest positive integer x for which the Mertens conjecture equation* | Σ1 ≤ n ≤ x μ(n) | < x equation* fails to hold: x < (1.017 × 1029), an improvement over previously known (1.59 × 1040) due to Kotnik and te Riele [7].

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…