Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Cesàro average of the numbers that can be written as sum of a prime and two squares of primes

Published 7 Jan 2017 in math.NT | (1701.01813v2)

Abstract: 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 can be written as sum of a prime and two squares of primes. Let $N$ a sufficiently large integer, let $k>3/2$ and let $M_{i}\left(N,k\right),\, i=1,\dots,4$ suitable parameters depending on $\Gamma(s)$. We prove that $$\sum_{n\leq N}r_{SP}\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).$$

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.