Related papers: The Mean Square of Divisor Function

We have developed a heuristic showing that in the Dirichlet divisor problem for the almost all $n \in \mathbb{N}^{+}$: $$ R(n) \leq O(\psi(n)n^{\frac{1}{4}}) $$ where $$ R(n) = \Big\lvert \sum_{x=1}^{n}\Big\lfloor\frac{n}{x}\Big\rfloor -…

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \varphi(n)$ be the Euler totient function. The result $ \sum_{n\leq x}\varphi([x/n])=(6/\pi^2)x\log x+O\left ( x(\log x)^{2/3}(\log\log…

We investigate a fifty-year-old conjecture of Erd\H{o}s and Graham concerning whether the binomial coefficient ${n \choose k}$ with $1 \leq k \leq \frac{n}{2}$ must always have a divisor $\leq n$ that is ``close'' to $n$: that is, bigger…

Let $f(n)$ be a multiplicative function satisfying $|f(n)|\leq 1$, $q$ $(\leq N^2)$ be a positive integer and $a$ be an integer with $(a,\,q)=1$. In this paper, we shall prove that $$\sum_{\substack{n\leq N\\ (n,\,q)=1}}f(n)e({a\bar{n}\over…

Let $\lambda$ denote the Liouville function. Assuming the Riemann Hypothesis, we prove that $$\int_X^{2X}\Big|\sum_{x\leq n \leq x+h}\lambda(n) \Big|^2 dx \ll Xh(\log X)^6,$$ as $X\rightarrow \infty$, provided $h=h(X)\leq…

Let $ k,l \geq 2$ be natural numbers, and let $d_k,d_l$ denote the $k$-fold and $l$-fold divisor functions, respectively. We analyse the asymptotic behavior of the sum $\sum_{x<n\leq x+H_1}d_k(n)d_l(n+h)$. More precisely, let…

Suppose that $a$ and $b$ are positive integers subject to $(a,b)=1$. For $n\in\mathbb{Z}^+$, denote by $\tau_{a,b}(n;\ell_1,M_1,l_2,M_2)$ the asymmetric two--dimensional divisor function with congruence conditions, i.e., \begin{equation*}…

In this paper, we evaluate the sum $\sum_{m,n}\leg {m}{n}d(n)$, where $\leg {m}{n}$ is the Kronecker symbol and $d(n)$ is the divisor function.

N. Minculete has introduced a concept of divisors of order $r$: integer $d=p_1^{b_1}\cdots p_k^{b_k} $ is called a divisor of order $r$ of $n=p_1^{a_1}\cdots p_k^{a_k}$ if $d \mid n$ and $b_j\in\{r, a_j\}$ for $j=1,\ldots,k$. One can…

In 1991, Baker and Harman proved, under the assumption of the generalized Riemann hypothesis, that $\max_{ \theta \in [0,1) }\left|\sum_{ n \leq x } \mu(n) e(n \theta) \right| \ll_\epsilon x^{3/4 + \epsilon}$. The purpose of this note is to…

We obtain, for $T^\epsilon \le U=U(T)\le T^{1/2-\epsilon}$, asymptotic formulas for $$ \int_T^{2T}(E(t+U) - E(t))^2 dt,\quad \int_T^{2T}(\Delta(t+U) - \Delta(t))^2 dt, $$ where $\Delta(x)$ is the error term in the classical divisor problem,…

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…

We prove new exact formulas for the generalized sum-of-divisors functions, $\sigma_{\alpha}(x) := \sum_{d|x} d^{\alpha}$. The formulas for $\sigma_{\alpha}(x)$ when $\alpha \in \mathbb{C}$ is fixed and $x \geq 1$ involves a finite sum over…

In 1920, P. A. MacMahon generalized the (classical) notion of divisor sums by relating it to the theory of partitions of integers. In this paper, we extend the idea of MacMahon. In doing so we reveal a wealth of divisibility theorems and…

Let A_N be an N-point distribution in the unit square in the Euclidean plane. We consider the Discrepancy function D_N(x) in two dimensions with respect to rectangles with lower left corner anchored at the origin and upper right corner at…

A positive integer $n$ is called an abundant number if $\sigma (n)\ge 2n$, where $\sigma (n)$ is the sum of all positive divisors of $n$. Let $E(x)$ be the largest number of consecutive abundant numbers not exceeding $x$. In 1935, P. Erd\H…

Let $\tau_3(n)$ be the triple divisor function which is the number of solutions of the equation $d_1d_2d_3=n$ in natural numbers. It is shown that $$ \sum_{1\leq n_1,n_2,n_3\leq \sqrt{x}}\tau_3(n_1^2+n_2^2+n_3^2)=c_1x^{\frac{3}{2}}(\log…

Let $d_k(n) = \sum_{n_1 \cdots n_k = n}1$ be the $k$-fold divisor function. We call a function $f:\mathbb{N} \to \mathbb{C}$ a $d_k$-bounded multiplicative function, if $f$ is multiplicative and $|f(n)| \leq d_k(n)$ for every $n \in…

Let $\mathbf{P} \subset [H_0,H]$ be a set of primes, where $\log H_0 \geq (\log H)^{2/3 + \epsilon}$. Let $\mathscr{L} = \sum_{p \in \mathbf{P}} 1/p$. Let $N$ be such that $\log H \leq (\log N)^{1/2-\epsilon}$. We show there exists a subset…

Erd\H{o}s and Szekeres showed in 1978 that for any four positive integers satisfying m_1+m_2 = n_1+n_2, the two binomial coefficients (m_1+m_2)!/m_1! m_2! and (n_1+n_2)!/n_1! n_2! have a common divisor >1. The analogous statement for…