English

On sums of arithmetic functions involving the greatest common divisor

Number Theory 2021-02-09 v1

Abstract

Let gcd(d1,,dk)\gcd(d_{1},\ldots,d_{k}) be the greatest common divisor of the positive integers d1,,dkd_{1},\ldots,d_{k}, for any integer k2k\geq 2, and let τ\tau and μ\mu denote the divisor function and the M\"{o}bius function, respectively. For an arbitrary arithmetic function gg and for any real number x>5x>5 and any integer k3k\geq 3, we define the sum Sg,k(x):=nxd1dk=ng(gcd(d1,,dk)) S_{g,k}(x) :=\sum_{n\leq x}\sum_{d_{1}\cdots d_{k}=n} g(\gcd(d_{1},\ldots,d_{k})) In this paper, we give asymptotic formulas for Sτ,k(x)S_{\tau,k}(x) and Sμ,k(x)S_{\mu,k}(x) for k3k\geq 3.

Keywords

Cite

@article{arxiv.2102.03714,
  title  = {On sums of arithmetic functions involving the greatest common divisor},
  author = {Isao Kiuchi and Sumaia Saad Eddin},
  journal= {arXiv preprint arXiv:2102.03714},
  year   = {2021}
}

Comments

13 pages