Abstract

Hardy and Littlewood conjectured that every sufficiently large integer is either a square or the sum of a prime and a square. Let $E(x)$ be the number of positive integers up to $x\ge4$ which does not satisfy this condition. We prove $E(x)\ll x^{1/2}(\log x)^A(\log\log x)^4$with $A=3/2$ under the Generalized Riemann Hypothesis. This is a small improvement of the previous remarks of Mikawa (1993) and Perelli-Zaccagnini (1995) which claims $A=4,3$ respectively.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.