Abstract
Let sk(n) be the number of representations of n as a sum of k odd squares. We study the function s8k+1(n ), where n is any odd positive integer. Special cases of our results are s9(p ) = 1 16 s16(8p) and 1 17 s17(p ) = 1 32 s32(8p), where p is any odd prime.
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.
