Related papers: An Explicit Formula For The Divisor Function

We prove an asymptotic formula for the smoothed shifted convolution of the generalised divisor function $d_k(n)$ and the divisor function $d(n)$, with a power-saving error term independent of $k$. In particular, when $k$ is large, this is…

Let $\tau(n)$ denote the classical divisor function. In this paper, we consider the hyperbolic fractional sum of the divisor function defined by $$ T(x) = \sum_{n_1 n_2 \leqslant x} \tau\left( \left[ \frac{x}{n_1 n_2} \right] \right) =…

We prove an asymptotic formula for the shifted convolution of the divisor functions $d_3(n)$ and $d(n)$, which is uniform in the shift parameter and which has a power-saving error term. The method is also applied to give analogous estimates…

This paper concerns exact differential equations. First, I define two types of functions which I have named Basic Function of Type One and Basic Function of Type Two. I then derive the property and theorems of these functions. Finally, by…

Divisor functions have attracted the attention of number theorists from Dirichlet to the present day. Here we consider associated divisor functions $c_j^{(r)}(n)$ which for non-negative integers $j, r$ count the number of ways of…

The sum of proper divisors function $s(n)$ has been studied for more than 2000 years. In this paper we study statistical properties of the related function $S_s(n) := \sum_{d \mid n} s(d)$. This function arises from a generalization of the…

We give a new proof of an approximate functional equation, due to J. R. Wilton, for a trigonometric sum involving the divisor function. This allows us to improve on Wilton's error term and to give an explicit formula for an unspecified…

In [arXiv:2212.04969], the authors stated some conjectures on the variance of certain sums of the divisor function $d_k(n)$ over number fields, which were inspired by analogous results over function fields proven in [arXiv:2107.01437].…

For a fixed $\theta\neq 0$, we define the twisted divisor function $$ \tau(n, \theta):=\sum_{d\mid n}d^{i\theta}\ .$$ In this article we consider the error term $\Delta(x)$ in the following asymptotic formula $$ \sum_{n\leq x}^*|\tau(n,…

Let $$\sum_{\substack{d|n\\ d\equiv 1 (2)}}\frac{1}{d}$$ denote the sum of inverses of odd divisors of a positive integer $n$, and let $c_{r}(n)$ be the number of representations of $n$ as a sum of $r$ squares where representations with…

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.

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…

The integer $d=\prod_{i=1}^s p_i^{b_i}$ is called an exponential divisor of $n=\prod_{i=1}^s p_i^{a_i}>1$ if $b_i \mid a_i$ for every $i\in \{1,2,...,s\}$. Let $\tau^{(e)}(n)$ denote the number of exponential divisors of $n$, where…

We give a formula for the determinant of an $n\times n$ matrix with entries from a commutative ring with unit. The formula can be evaluated by a "straight-line program" performing only additions, subtractions and multiplications of ring…

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…

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$. We extract an asymptotic formula for the average divisor sum in a convenient form, and provide an explicit upper bound for this sum with the correct main…

In this note, we establish a Vorono\"i--Oppenheim summation formula for divisor functions over an arbitrary number field.

The partitions of the integers can be expressed exactly in an iterative and closed-form expression. This equation is derived from distributing the partitions of a number in a network that locates each partition in a unique and orderly…

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…

For any real $t$, the unitary divisor function $\sigma_t^*$ is the multiplicative arithmetic function defined by $\sigma_t^*(p^{\alpha})=1+p^{\alpha t}$ for all primes $p$ and positive integers $\alpha$. Let $\overline{\sigma_t^*(\mathbb…