On the Ces\`aro average of the "Linnik numbers"
Abstract
Let be the von Mangoldt function and rQ(n)=Σm1+m22+m32=n(m1) 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 Mi(N,k),\, i=1,…,k suitable parameters depending on Jv(u), where Jv(u) denotes the Bessel function of complex order v and real argument u. We prove that Σn≤ NrQ(n)(N-n)k(k+1)=M1(N,k)+M2(N,k)+M3(N,k)+M4(N,k)+O(Nk+1). We also prove that with this technique the bound k>3/2 is optimal.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.