On the Generalised Divisor Problem

TL;DR

This paper improves explicit bounds on the error term in the divisor problem for k-fold divisor functions using Dirichlet convolution, providing sharper estimates for all k ≥ 3.

Contribution

It introduces improved explicit error bounds for the generalized divisor problem for all k ≥ 3, extending previous results with sharper estimates.

Findings

Error term for k=3: |elta_3(x)|< 2.968x^{2/3}\log^{1/3}x for all x  2

Extended explicit error bounds for all k > 3 with elta_k(x)=O(x^{(k-1)/k}(\log x)^{((k-1)(k-2))/(2k)})

Improved upon previous bounds by Bordellb8s for all x  2

Abstract

In this paper, we apply the Dirichlet convolution method to \begin{equation*} T_{k}(x)=\sum_{n \leq x} d_{k}(n), \end{equation*} for $k\ge 3$, where $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$, the error term $|\Delta_3(x)|< 2.968x^{2/3}\log^{1/3}x$ for all $x\ge 2$. This improves the best-known explicit result established by Bordell{\`e}s for all $x\ge 2$. We extend this for all $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)$.