Note on Fractional Sums with Fixed GCD
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 f be an arithmetic function satisfying f(n) nα for some 0 α < 1. For r 2, let τr(n) denote the number of representations of n as a product of r positive integers, and more generally, τr(d)(n) the number of representations with factors equal to d. We establish asymptotic formulas for the fractional sums \[ Sf,r(d)(x) = Σn x τr(d)(n) f\!( xn ), \] in the cases r=2 and r=3.
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.