Abstract
We give a variety of results involving s(n), the number of representation of n as a sum of three squares. Using elementary techniques we prove that if 9 †n, via the theory of modular forms of half integer weight we prove the corresponding result with 3 replaced by p, an odd prime. This leads to a formula for s(n) in terms of s(n′), where n′ is the square-free part of n.We also find generating function formulae for various subsequences of {s(n)}, for instance
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.
