Note on Fractional Sums with Fixed GCD

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Karras, Meselem
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866917272011931648
author Karras, Meselem
author_facet Karras, Meselem
contents 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) \ll n^α$ for some $0 \le α< 1$. For $r \ge 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 $\gcd$ factors equal to $d$. We establish asymptotic formulas for the fractional sums \[ S_{f,r}^{(d)}(x) = \sum_{n \le x} τ_r^{(d)}(n) f\!\left(\left\lfloor \frac{x}{n}\right\rfloor \right), \] in the cases $r=2$ and $r=3$.
format Preprint
id arxiv_https___arxiv_org_abs_2602_12377
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Note on Fractional Sums with Fixed GCD
Karras, Meselem
Number Theory
11A25, 11N37
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) \ll n^α$ for some $0 \le α< 1$. For $r \ge 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 $\gcd$ factors equal to $d$. We establish asymptotic formulas for the fractional sums \[ S_{f,r}^{(d)}(x) = \sum_{n \le x} τ_r^{(d)}(n) f\!\left(\left\lfloor \frac{x}{n}\right\rfloor \right), \] in the cases $r=2$ and $r=3$.
title Note on Fractional Sums with Fixed GCD
topic Number Theory
11A25, 11N37
url https://arxiv.org/abs/2602.12377