On sums of arithmetic functions involving the greatest common divisor

Abstract

Let (d1,…,dk) be the greatest common divisor of the positive integers d1,…,dk, for any integer k≥ 2, and let τ and μ denote the divisor function and the M\"obius function, respectively. For an arbitrary arithmetic function g and for any real number x>5 and any integer k≥ 3, we define the sum Sg,k(x) :=Σn≤ xΣd1·s dk=n g((d1,…,dk)) In this paper, we give asymptotic formulas for Sτ,k(x) and Sμ,k(x) for k≥ 3.

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…