The Ramanujan Journal Математика

On the generalised divisor problem

Sebastian Tudzi
Springer Nature · 2026-06-12 · DOI 10.1007/s11139-026-01422-5

Аннотация

Abstract In this paper, we apply the Dirichlet convolution method to $$\begin{aligned} T_{k}(x)=\sum _{n \le x} d_{k}(n), \end{aligned}$$ T k ( x ) = ∑ n ≤ x d k ( n ) , for $$k\ge 3$$ k ≥ 3 , where $$d_{k}(n)$$ d k ( n ) is the number of ways to represent n as a product of k positive integer factors. We prove that for $$k=3$$ k = 3 , the error term $$|\Delta _3(x)| <2.968x^{2/3}\log ^{1/3}x$$ | Δ 3 ( x ) | < 2.968 x 2 / 3 log 1 / 3 x for all $$x\ge 2$$ x ≥ 2 . This improves the best-known explicit result established by Bordellès for all $$x\ge 2$$ x ≥ 2 . We extend this for all $$k>3$$ k > 3 and obtain an explicit error term of the form $$\Delta _{k}(x)=O\left( x^{\frac{k-1}{k}}(\log x)^{\frac{(k-1)(k-2)}{2k}}\right) $$ Δ k ( x ) = O x k - 1 k ( log x ) ( k - 1 ) ( k - 2 ) 2 k .

Читать у издателя →