Related papers: Higher moments of the error term in the divisor pr…

Let $\Delta(x)$ denote the error term in the Dirichlet divisor problem. Our main results are the asymptotic formulas $$ \int_1^X \Delta^3(x){\rm d}x = BX^{7/4} + O_\epsilon(X^{\beta+\epsilon}) \qquad(B > 0) $$ and $$ \int_1^X…

We study the function $\Delta_k(x):=\sum_{n\leq x} d_k(n) - \mbox{Res}_{s=1} ( \zeta^k(s) x^s/s )$, where $k\geq 3$ is an integer, $d_k(n)$ is the $k$-fold divisor function, and $\zeta(s)$ is the Riemann zeta-function. For a large parameter…

Let $\Delta(x)$ be the error term of the Dirichlet divisor problem. An asymptotic formula with the error term $O(T^{53/28+\epsilon})$ is established for the integral $\int_1^T\Delta^4(x)dx.$ Similar results are also established for some…

Let $\Delta(x)$ be the error term of the Dirichlet divisor problem. The asymptotic formula of the integral $\int_1^T\Delta^k(x)dx$ is established for any integer $3\leq k\leq 9$ by an unified method. Similar results are also established for…

Let $3\leqslant k\leqslant9$ be a fixed integer, $p$ be a prime and $d(n)$ denote the Dirichlet divisor function. We use $\Delta(x)$ to denote the error term in the asymptotic formula of the summatory function of $d(n)$. The aim of this…

Let $\Delta(x)$ denote the error term in the classical Dirichlet divisor problem, and let the modified error term in the divisor problem be $\Delta^*(x) = -\Delta(x) + 2\Delta(2x) - \frac{1}{2}\Delta(4x)$. We show that $$…

Let $d(n)$ be the number of divisors of $n$, let $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote the Riemann zeta-function. Several…

We present several new results involving $\Delta(x+U)-\Delta(x)$, where $U = o(x)$ and $$ \Delta(x):=\sum_{n\le x}d(n)-x\log x-(2\gamma-1)x $$ is the error term in the classical Dirichlet divisor problem.

We prove that $$ \int_1^X\Delta(x)\Delta_3(x)\,dx \ll X^{13/9}\log^{10/3}X, \quad \int_1^X\Delta(x)\Delta_4(x)\,dx \ll_\varepsilon X^{25/16+\varepsilon}, $$ where $\Delta_k(x)$ is the error term in the asymptotic formula for the summatory…

Let $\Delta^{(k)}(x)$ denote the error term of the $k$-free divisor problem for $k\geq 2$. In this paper we establish an asymptotic formula of the integral $\int_1^T|\Delta^{(k)}(x)|^2dx$ for each $k\geq 4.$

Let $\Delta(x)$ denote the error term in the Dirichlet divisor problem, and $E(T)$ the error term in the asymptotic formula for the mean square of $|\zeta(1/2 + it)|$. If $E^*(t) = E(t) - 2\pi\Delta^*(t/(2\pi))$ with $\Delta^*(x) = -…

We provide upper bounds for the mean square integral $$ \int_X^{2X}(\Delta_k(x+h) - \Delta_k(x))^2 dx \qquad(h = h(X)\gg1, h = o(x) {\roman{as}} X\to\infty) $$ where $h$ lies in a suitable range. For $k\ge2$ a fixed integer, $\Delta_k(x)$…

If $$ \Delta(x) := \sum_{n\le x}c_n - Cx $$ denotes the error term in the classical Rankin-Selberg problem, then it is proved that $$ \int_0^X \Delta^4(x)\d x \ll_\epsilon X^{3+\epsilon},\quad \int_0^X \Delta_1^4(x)\d x \ll_\epsilon…

We improve unconditional estimates on $\Delta_k(x)$, the remainder term of the generalised divisor function, for large $k$. In particular, we show that $\Delta_k(x) \ll x^{1 - 1.889k^{-2/3}}$ for all sufficiently large fixed $k$.

Let $d(n)$ be the number of divisors of $n$, let $\gamma$ denote Euler's constant and $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote…

Several results are obtained concerning the function $\Delta_k(x)$, which represents the error term in the general Dirichlet divisor problem. These include the estimates for the integral of this function, as well as for the corresponding…

Suppose $k\geqslant3$ is an integer. Let $\tau_k(n)$ be the number of ways $n$ can be written as a product of $k$ fixed factors. For any fixed integer $r\geqslant2$, we have the asymptotic formula \begin{equation*}…

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…

We obtain a new upper bound for $\sum_{h\le H}\Delta_k(N,h)$ for $1\le H\le N$, $k\in \N$, $k\ge3$, where $\Delta_k(N,h)$ is the (expected) error term in the asymptotic formula for $\sum_{N < n\le2N}d_k(n)d_k(n+h)$, and $d_k(n)$ is the…

Let $\Delta(x)$ denote the error term in the Dirichlet divisor problem, and let $E(T)$ denote the error term in the asymptotic formula for the mean square of $|\zeta(1/2+it)|$. If $E^*(t) := E(t) - 2\pi\Delta^*(t/(2\pi))$ with $\Delta^*(x)…