Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
2 answers
386 views

Sieve bound for the sum of two squares

Let $$S(n) = \sum_{p \le n} b(n-p),$$ where $b(a)=1$ is $a$ is a sum of two squares of positive integers and $b(a)=0$ otherwise. Trivially by PNT we have $$S(n) \le \sum_{p \le n}1 \ll \frac{n}{\log n}...