New bounds and progress towards a conjecture on the summatory function of (-2)(n)
Abstract
In this article, we study the summatory function equation* W(x)=Σn≤ x(-2)(n), equation* where (n) counts the number of prime factors of n, with multiplicity. We prove W(x)=O(x), and in particular, that |W(x)|<2260x for all x≥ 1. This result provides new progress towards a conjecture of Sun, which asks whether |W(x)|<x for all x≥ 3078. To obtain our results, we computed new explicit bounds on the Mertens function M(x). These may be of independent interest. Moreover, we obtain similar results and make further conjectures that pertain to the more general function equation* Wa(x)=Σn≤ x(-a)(n) equation* for any real a>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.