On the Cesàro average of the "Linnik numbers"
Abstract: 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 call Linnik numbers, for brevity). Let $N$ a sufficiently large integer, let $k>3/2$ and let $M_{i}\left(N,k\right),\, i=1,\dots,k$ suitable parameters depending on $J_{v}\left(u\right)$, where $J_{v}\left(u\right)$ denotes the Bessel function of complex order $v$ and real argument $u$. We prove that $$ \sum_{n\leq N}r_{Q}\left(n\right)\frac{\left(N-n\right){k}}{\Gamma\left(k+1\right)}=M_{1}\left(N,k\right)+M_{2}\left(N,k\right)+M_{3}\left(N,k\right)+M_{4}\left(N,k\right)+O\left(N{k+1}\right).$$ We also prove that with this technique the bound $k>3/2$ is optimal.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.