Related papers: On the sum-of-squares function

We prove that when $f$ is a Rademacher random multiplicative function for any $\epsilon>0$, then $\sum_{n \leqslant x}\frac{f(n)}{\sqrt{n}} \ll (\log\log(x))^{3/4+\epsilon}$ for almost all $f$. We also show that there exist arbitrarily…

We investigate fractional sums of arithmetic functions over products of two or three integers, with emphasis on fixed greatest common divisors and multiplicative weights. Let $f$ be an arithmetic function satisfying $f(n) \ll n^\alpha$ for…

We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…

We study the asymptotic behaviour of $\sum_{m,n\le x} \tau_{1,2}(mn)$, where $\tau_{1,2}(n) = \sum_{a b^2 = n} 1$, using multidimensional Perron formula and complex integration method. An asymptotic formula with an error term $O(x^{10/7})$…

Let $k\ge 2$ be a fixed integer. We consider sums of type $\sum_{n_1^2+\cdots+ n_k^2\le x} F(n_1,\ldots,n_k)$, taken over the $k$-dimensional spherical region $\{(n_1,\ldots,n_k)\in {\Bbb Z}^k: n_1^2+\cdots+ n_k^2\le x\}$, where $F:{\Bbb…

Let $p_{-r}(n)$ denote the $r$-coloured partition function, and $\sigma(n)=\sum_{d|n}d$ denote the sum of positive divisors of $n$. The aim of this note is to prove the following $$…

Let $r_{k}(n)$ denote the number of representations of the positive integer $n$ as the sum of $k$ squares. We prove a new summation formula involving $r_{k}(n)$ and the Bessel functions of the first kind, which constitutes an analogue of a…

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…

A summation formula is derived for the hypergeometric series of unit argument ${}_3F_2(1,1,c;d,n+2;1)$, where $n=0, 1, 2, \ldots$ and $\Re (d-c+n)>0$.

We prove that every sufficiently large integer $n$ can be written as the sum of a prime and an integer that is not square-free. In addition, we expect this result holds for every $n > 24$ and prove two results to support this claim. First,…

We prove that the greatest positive integer that is not expressible as a linear combination with integer coefficients of elements of the set $\{n^2,(n+1)^2,\ldots \}$ is asymptotically $O(n^2)$, verifying thus a conjecture of Dutch and…

In this paper we establish a general asymptotic formula for the sum of the first $n$ prime numbers, which leads to a generalization of the most accurate asymptotic formula given by Massias and Robin. Further we prove a series of results…

We study the sums $$ S_f(x) = \sum_{n\leq x} f\left(\left\lfloor\frac{x}{n}\right\rfloor\right) $$ when $f$ is supported on $r$th powers with $r\geq 2$. This restriction allows us to give nontrivial estimates for one of the error terms in…

We prove a Poisson summation formula for the zero locus of a quadratic form in an even number of variables with no assumption on the support of the functions involved. The key novelty in the formula is that all ``boundary terms'' are given…

This paper is concerned with finite sequences of integers that may be written as sums of squares of two nonzero integers. We first find infinitely many integers $n$ such that $n, n+h$ and $n+k$ are all sums of two squares where $h$ and $k$…

In this paper, we discuss an alternative approach to determine an asymptotic equivalent of the partial sum of the reciprocals of prime numbers. This well-known result, related to Merten's second theorem, is usually derived through methods…

It is proved that for any non-empty finite subset $Q$ of the square numbers, $ |Q+Q|\geq C'|Q|(\log |Q|)^{1/3+o(1)} $. This result essentially is proved -- with the same tools -- by Mei-Chu Chang. See in J. Funct. Anal. 207 (2004), no 2,…

We deduce asymptotic formulas for the sums $\sum_{n_1,\ldots,n_r\le x} f(n_1\cdots n_r)$ and $\sum_{n_1,\ldots,n_r\le x} f([n_1\cdots n_r])$, where $r\ge 2$ is a fixed integer, $[n_1,\ldots,n_r]$ stands for the least common multiple of the…

We derive an asymptotic formula for the sum $$ H = \sum_{0<\gamma_k\leqslant T,\, 1\leqslant k\leqslant m}h(a_1\gamma_1+a_2\gamma_2+\cdots + a_m\gamma_m), $$ where $a_1, a_2, \ldots, a_m$ are integers whose sum equals zero, $\gamma_1,…

We continue our recent work on additive problems with prime summands: we already studied the \emph{average} number of representations of an integer as a sum of two primes, and also considered individual integers. Furthermore, we dealt with…