Related papers: On the sum-of-squares function

We improve a previous unconditional result about the asymptotic behavior of $\sum_{n\le x} r(n)r(n+m)$ with $r(n)$ the number of representations of $n$ as a sum of two squares when $m$ may vary with $x$.

Let $x$ be a real number satisfying $x \geq 2$. For any positive integer $n$, we define $s(n)$ as the smallest non-negative integer such that $n + s(n)$ is a perfect square. In this paper, we derive an asymptotic formula for the sum…

Let $\Lambda\left(n\right)$ be the von Mangoldt function and $r_{SP}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}\Lambda\left(m_{1}\right)\Lambda\left(m_{2}\right)\Lambda\left(m_{3}\right)$ be the counting function for the numbers that…

Let $R_{m, \mathrm{sq-full}}(N)$ be a representation function for the sum of a prime and a square-full number. In this article, we prove an asymptotic formula for the sum of $R_{m, \mathrm{sq-full}}(N)$ over positive integers $N$ in a short…

Let $\mathcal L^+$ be the set of all primes $p$ for which the sums of $\left(\frac{n}{p}\right)$ over the interval $[1,N]$ are non-negative for all $N$. We prove that the estimate \[ |\mathcal L^+\cap [1,x]|\ll \frac{x}{\ln x(\ln\ln…

Let $R(N)$ be the number of representations of $N$ as a sum of a prime and a square-full number weighted with logarithmic function. In $2024$, the author and Y. Suzuki obtained an asymptotic formula for the sum of $R(N)$ over positive…

In this paper, we can show that \begin{align*} S_{\Lambda}(x)=\sum_{1\leq n\leq x}\Lambda \left(\left[\frac{x}{n}\right]\right)= \sum_{n=1}^{\infty} \frac{\Lambda(n)}{n(n+1)}x +O\left(x^{7/15+1/195+\varepsilon}\right), \end{align*} where…

We show that there is a positive constant $c_0$ such that \[\sum_{n\le x}\mu^2(n^2+1)c_0x+O_{\varepsilon}(x^{7/12+\varepsilon})\] for any fixed $\varepsilon>0$. This improves a result of Estermann [3] from 1931, in which the error term had…

The Mertens' first theorem gives us the following asymptotic formula \begin{equation*} \sum_{\substack{p\leq x\\ p~prime}}\frac{lnp}{p}=lnx+O(1), \end{equation*} and the Mertens' second theorem indicates that there exists a constant…

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…

Let $b > a > 0$. We prove the following asymptotic formula $$\sum_{n\ge 0} \big\lvert\{x/(n+a)\} - \{x/(n+b)\}\big\rvert = \frac{2}{\pi}\zeta(3/2)\sqrt{cx} + O(c^{2/9}x^{4/9}),$$ with $c=b-a$, uniformly for $x \ge 40 c^{-5}(1+b)^{27/2}$.

Let $r_{k}(n)$ denote the number of representations of the integer $n$ as a sum of $k$ squares. In this paper, we give an asymptotic for $r_{k}(n)$ when $n$ grows linearly with $k$. As a special case, we find that \[ r_{n}(n) \sim \frac{B…

We study the arithmetic function sopfr$(n)$ (OEIS A001414) which gives the sum of prime factors (with repetition) of a number $n$. In particular we obtain the asymptotic formula $$ \sum_{n \leq x} \rm{sopfr}(n) \sim \frac{\pi^2}{12}…

We deduce an asymptotic formula with error term for the sum $\sum_{n_1,\ldots,n_k \le x} f([n_1,\ldots, n_k])$, where $[n_1,\ldots, n_k]$ stands for the least common multiple of the positive integers $n_1,\ldots, n_k$ ($k\ge 2$) and $f$…

We give a relatively simple proof that \[ \int _0^1\left |\sum _{n\leq x}d(n)e(n\alpha )\right |d\alpha \asymp \sqrt x.\]

We obtain new Poisson type summation formulas with nodes $\pm \sqrt{n}$ and with weights involving the function $r_k(n)$ that gives the number of representations of a positive integer $n$ as the sum of $k$ squares. Our results extend…

Using Fermat's two squares theorem and properties of cyclotomic polynomials, we prove assertions about when numbers of the form $a^{n}+1$ can be expressed as the sum of two integer squares. We prove that $a^n + 1$ is the sum of two squares…

For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ as a sum of $r = 2^n + 1$ summands, each of which is an $n$-th power of natural numbers $x_i$, $i = \overline{1,…

Let f be an arithmetic function satisfying certain conditions. In this paper, we give an asymptotic formula for the sum \[\sum_{n_1 n_2 \cdots n_r \leq x} f\left(\left\lfloor \frac{x}{n_1 n_2 \cdots n_r} \right\rfloor\right), \quad r \geq…

Let $\Lambda(n)$ be the von Mangoldt function, and let $[t]$ be the integral part of real number $t$. In this note, we prove that for any $\varepsilon>0$ the asymptotic formula $$ \sum_{n\le x} \Lambda\Big(\Big[\frac{x}{n}\Big]\Big) =…