Related papers: A generalization of the Titchmarsh divisor problem

Let $d(n)$ be the Dirichlet divisor function and $\Delta(x)$ denote the error term of the sum $\sum_{n\leqslant x}d(n)$ for a large real variable $x$. In this paper we focus on the sum $\sum_{p\leqslant x}\Delta^2(p)$, where $p$ runs over…

Let $d(n)$ denote the Dirichlet divisor function. Define \begin{equation*} \mathcal{S}_{k}(x)=\sum_{\substack{1\leqslant n_1,n_2,n_3 \leqslant x^{1/2} \\ 1\leqslant n_4\leqslant x^{1/k} }} d(n_1^2+n_2^2+n_3^2+n_4^k), \qquad 3\leqslant k\in…

Let $k \ge 2$ be a fixed integer. We define the multiplicative function $D_k(n) = d_k(n)/d_k^*(n)$, such that $d_k(n)$ is the Piltz divisor function and $d_k^*(n) = k^{\omega(n)}$ is its unitary analogue, where $\omega(n)$ is the number of…

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \sigma(n)$ be the sum of divisors function. This note presents the first proof of the asymptotic formula for the average order $ \sum_{p\leq…

We establish asymptotic formulae for various correlations involving general divisor functions $d_k(n)$ and partial divisor functions $d_l(n,A)=\sum_{q|n:q\leq n^A}d_{l-1}(q)$, where $A\in[0,1]$ is a parameter and $k,l\in\mathbb{N}$ are…

Asymptotic formulae for Titchmarsh-type divisor sums are obtained with strong error terms that are uniform in the shift parameter. This applies to more general arithmetic functions such as sums of two squares, improving the error term in…

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 $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…

Given a multiplicative function $f$ which is periodic over the primes, we obtain a full asymptotic expansion for the shifted convolution sum $\sum_{|h|<n\leq x} f(n) \tau(n-h)$, where $\tau$ denotes the divisor function and…

We improve existing estimates of moments of the Riemann zeta function. As a consequence, we are able to derive new estimates for the asymptotic behaviour of $\sum_{N \alpha \le x} \mathfrak{t}_k(\alpha)$, where $N$ stands for the norm of a…

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.$

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 study the variance of sums of the $k$-fold divisor function $d_k(n)$ over sparse arithmetic progressions, with averaging over both residue classes and moduli. In a restricted range, we confirm an averaged version of a recent conjecture…

An asymptotic formula is proved for the k-fold divisor function averaged over homogeneous polynomials of degree k in k-1 variables coming from incomplete norm forms.

We study the triple convolution sum of the generalised divisor functions $$\sum_{n\leq x} d_k(n+h)d_l(n)d_m(n-h),$$ where $h \le x^{1-\epsilon}$ for any $\epsilon>0$ and $d_k(n)$ denotes the generalised divisor function which counts the…

Let $F({\bf x})\in\mathbb{Z}[x_1,x_2,\dots,x_n]$ be a quadratic polynomial in $n\geq 3$ variables with a nonsingular quadratic part. Using the circle method we derive an asymptotic formula for the sum $$ \Sigma_{k,F}(X;…

We obtain an asymptotic formula for the average value of the divisor function over the integers $n \le x$ in an arithmetic progression $n \equiv a \pmod q$, where $q=p^k$ for a prime $p\ge 3$ and a sufficiently large integer $k$. In…

Let $\gcd(d_{1},\ldots,d_{k})$ be the greatest common divisor of the positive integers $d_{1},\ldots,d_{k}$, for any integer $k\geq 2$, and let $\tau$ and $\mu$ denote the divisor function and the M\"{o}bius function, respectively. For an…

We consider a binary quadratic variant of the Titchmarsh divisor problem and give an asymptotic formula for $\sum_{p^2+q^2\leq N} \tau(p^2+q^2+1)$, where $p,q$ are primes.

Let $\gcd(k,j)$ be the greatest common divisor of the integers $k$ and $j$. For any arithmetical function $f$, we establish several asymptotic formulas for weighted averages of gcd-sum functions with weight concerning logarithms, that is…