English

On the Ces\`aro average of the "Linnik numbers"

Number Theory 2017-08-24 v2

Abstract

Let Λ\Lambda be the von Mangoldt function and rQ(n)=m1+m22+m32=nΛ(m1)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 NN a sufficiently large integer, let k>3/2k>3/2 and let Mi(N,k),i=1,,kM_{i}\left(N,k\right),\, i=1,\dots,k suitable parameters depending on Jv(u)J_{v}\left(u\right), where Jv(u)J_{v}\left(u\right) denotes the Bessel function of complex order vv and real argument uu. We prove that nNrQ(n)(Nn)kΓ(k+1)=M1(N,k)+M2(N,k)+M3(N,k)+M4(N,k)+O(Nk+1). \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/2k>3/2 is optimal.

Keywords

Cite

@article{arxiv.1607.05629,
  title  = {On the Ces\`aro average of the "Linnik numbers"},
  author = {Marco Cantarini},
  journal= {arXiv preprint arXiv:1607.05629},
  year   = {2017}
}

Comments

Accepted on Acta Arithmetica