English

Note on Fractional Sums with Fixed GCD

Number Theory 2026-02-16 v1

Abstract

We investigate fractional sums of arithmetic functions over products of two or three integers, with emphasis on fixed greatest common divisors and multiplicative weights. Let ff be an arithmetic function satisfying f(n)nαf(n) \ll n^\alpha for some 0α<10 \le \alpha < 1. For r2r \ge 2, let τr(n)\tau_r(n) denote the number of representations of nn as a product of rr positive integers, and more generally, τr(d)(n)\tau_r^{(d)}(n) the number of representations with gcd\gcd factors equal to dd. We establish asymptotic formulas for the fractional sums Sf,r(d)(x)=nxτr(d)(n)f ⁣(xn), S_{f,r}^{(d)}(x) = \sum_{n \le x} \tau_r^{(d)}(n) f\!\left(\left\lfloor \frac{x}{n}\right\rfloor \right), in the cases r=2r=2 and r=3r=3.

Keywords

Cite

@article{arxiv.2602.12377,
  title  = {Note on Fractional Sums with Fixed GCD},
  author = {Meselem Karras},
  journal= {arXiv preprint arXiv:2602.12377},
  year   = {2026}
}

Comments

11 PAGES

R2 v1 2026-07-01T10:34:27.143Z