Related papers: The Mean Square of Divisor Function

An integer $n$ is called practical if every $m\le n$ can be written as a sum of distinct divisors of $n$. We show that the number of practical numbers below $x$ is asymptotic to $c x/\log x$, as conjectured by Margenstern. We also give an…

In this article, we prove an asymptotic formula for the mean value of long smoothed Dirichlet polynomials with divisor coefficients. Our result has a main term that includes all lower order terms and a power saving error term. This is…

Let $V(x)$ be the number of sign changes of the partial sums up to $x$, say $M_f(x)$, of a Rademacher random multiplicative function $f$. We prove that the averaged value of $V(x)$ is at least $\gg (\log x)(\log\log x)^{-1/2-\epsilon}$. Our…

For a fixed natural number $h$, we prove meromorphic continuation of the two-variable Dirichlet series $\sum_m r_2(m) \sigma_w(m + h) (m + h)^{-s + w}$ to $\mathbb{C}^2$ and use this to obtain asymptotics for $\sum_{m^2 + n^2 \leq X}…

Let $\Delta(a,b;x)$ denote the error term of the general two-dimensional divisor problem. In this paper we shall study the relation between the discrete mean value $\sum_{n\leq T}\Delta^2(a,b;n)$ and the continuous mean value…

We show that the $L^1$ norm of an exponential sum of length $X$ and with coefficients equal to the Liouville or M\"{o}bius function is at least $\gg_{\varepsilon} X^{1/4 - \varepsilon}$ for any given $\varepsilon$. For the Liouville…

We study averages along the integers using the divisor function $d(n)$, and defined as $$K_N f (x) = \frac{1}{D(N)} \sum _{n \leq N} d(n) \,f(x+n) , $$ where $D(N) = \sum _{n=1} ^N d(n) $. We shall show that these averages satisfy a…

Let A be an n by n matrix with determinant 1. We show that for all n > 2 there exist dimensional strictly positive constants C_n such that the average over the orthogonal group of log rho(A X) d X > C_n log ||A||, where ||A|| denotes the…

Erd\"os and Nicolas [erdos1976methodes] introduced an arithmetical function $F(n)$ related to divisors of $n$ in short intervals $\left] \frac{t}{2}, t\right]$. The aim of this note is to prove that $F(n)$ is the largest coefficient of…

In the study of Ramanujan sums, the so-called regular $A$-function is a set-valued multiplicative function that tracks certain subsets of the divisor sets of natural numbers. McCarthy provided a generalization of the Ramanujan sum using…

Let $\Lambda$ be the von Mangoldt function and $r_{Q}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}\Lambda\left(m_{1}\right)$ be the counting function for the numbers that can be written as sum of a prime and two squares (that we will…

Given a multiplicative function $f$, we let $S(x,f)=\sum_{n\leq x}f(n)$ be the associated partial sum. In this note, we show that lower bounds on partial sums of divisor-bounded functions result in lower bounds on the partial sums…

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*}…

We prove some distribution results for the $k$-fold divisor function in arithmetic progressions to moduli that exceed the square-root of length $X$ of the sum, with appropriate constrains and averaging on the moduli, saving a power of $X$…

The purpose of this paper is to obtain asymptotics of shifted sums of Hecke eigenvalue squares on average. We show that for $X^{\frac{2}{3}+\epsilon} < H <X^{1-\epsilon},$ there are constants $B_{h}$ such that $$ \sum_{X\leq n \leq 2X}…

For Dirichlet characters $\chi$ mod $k$ where $k\geq 3$, we here give a computable formula for evaluating the mean square sums $\sum\limits_{\substack{\chi \text{ mod }k\\\chi(-1)=(-1)^r}}|L(r,\chi)|^2$ for any positive integer $r\geq 3$.…

The polynomial Ramanujan sum was first introduced by Carlitz [7], and a generalized version by Cohen [10]. In this paper, we study the arithmetical and analytic properties of these sums, derive various fundamental identities, such as H…

We will show that the number of integers $\leq x$ that can be written as the square of an integer plus the square of a prime equals $\frac{\pi}{2} \cdot \frac {x}{\log x}$ minus a secondary term of size $x/(\log x)^{ 1+\delta+o(1)}$, where…

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…

We study the mean square of sums of the $k$th divisor function $d_k(n)$ over short intervals and arithmetic progressions for the rational function field over a finite field of $q$ elements. In the limit as $q\rightarrow\infty$ we establish…