Abstract
AbstractLet R(n) denote the number of representations of a natural number n as the sum of two squares and four cubes of primes. In this paper, it is proved that the anticipated asymptotic formula for R(n) fails for at most $\begin{array}{}O(N^{\frac{1}{4} + \varepsilon})\end{array}$ positive integers not exceeding N.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
