The \(k\)-free divisor problem (Q1568798)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The \(k\)-free divisor problem |
scientific article |
Statements
The \(k\)-free divisor problem (English)
0 references
16 January 2001
0 references
Let \(d^{(k)}(n)\) be the number of \(k\)-free divisors of \(n\). Then there is an asymptotic formula \[ \sum_{n\leq x} d^{(k)}(n)= A_k x\log x+B_k x+ \Delta^{(k)}(x). \] When \(k\geq 4\) the size of \(\Delta^{(k)}(x)\) seems to be related to the size of the error term in the Dirichlet divisor problem. However for \(k=2\) and \(k=3\) the problem is more complex, and zeros, of the Riemann zeta-function play a role. Thus one has \(\Delta^{(2)}(x) \ll x^{1/2}\) unconditionally, while \textit{R. C. Baker} [Q. J. Math., Oxf. Ser. (2) 47, 133-146 (1996; Zbl 0866.11053)] improved the exponent to \(4/11+ \varepsilon\), for any \(\varepsilon> 0\), under the Riemann Hypothesis. The present paper proves a corresponding result for \(k=3\), namely that \(\Delta^{(3)} (x)\ll x^{27/85+ \varepsilon}\) under the Riemann Hypothesis. Here the unconditional result has exponent \(1/3\). The proof uses exponential sum methods. The paper also investigates short interval problems, and shows that \[ \sum_{x< n\leq x+y} d^{(k)}(n)\sim y\{A_k\log x+A_k+ B_k\}, \] for any \(k\), for \(x^{23/73+ \varepsilon}\leq y\leq x\). Here the exponent comes from \textit{M. N. Huxley}'s work [Proc. Lond., Math. Soc. (3) 66, 279-301 (1993; Zbl 0820.11060)].
0 references
divisor problems
0 references
\(k\)-free numbers
0 references
error terms
0 references
short intervals
0 references
Riemann hypothesis
0 references
exponential sum methods
0 references