We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

math.NT

Change to browse by:

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Mathematics > Number Theory

Title: The summatory function of the Möbius function involving the greatest common divisor

Abstract: Let $\gcd(m,n)$ denote the greatest common divisor of the positive integers $m$ and $n$, and let $\mu$ represent the M\" obius function. For any real number $x>5$, we define the summatory function of the M\" obius function involving the greatest common divisor as $ S_{\mu}(x) := \sum_{mn\leq x} \mu(\gcd(m,n)). $ In this paper, we present an asymptotic formula for $S_{\mu}(x)$. Assuming the Riemann Hypothesis, we delve further into the asymptotic behavior of $S_{\mu}(x)$ and derive a mean square estimate for its error term. Our proof employs the Perron formula, Parseval's theorem, complex integration techniques, and the properties of the Riemann zeta-function.
Comments: 14 pages
Subjects: Number Theory (math.NT)
MSC classes: 11N37, 11A25, 11M99
Cite as: arXiv:2403.02792 [math.NT]
  (or arXiv:2403.02792v1 [math.NT] for this version)

Submission history

From: Sumaia Saad Eddin [view email]
[v1] Tue, 5 Mar 2024 09:06:39 GMT (11kb)

Link back to: arXiv, form interface, contact.