Abstract
The following striking identitiesare the cases n = 1,2,3,4 of a remarkable family given by G.J. Dostor [1]:where m = n(2n + 1), and n = 1, 2, … The case m = −n is trivial. If m ≠ −n there are n + 1 squares of consecutive integers on the left and n on the right. We will treat the last term (m + n)2 on the left differently, and refer to it as a transition term relating two sums of squares of n consecutive integers.
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.
