Abstract
We seek solutions of the Diophantine equation
for integers n, k and m, with n ≥ − 1 and with k and m positive and, in §3, we will also briefly consider the related equation where m 2 is replaced by m 3. When k = 1, (1) is trivial. For k = 2 we replace n by n − 1 and express (1) in the form
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alfred, Brother U. “Consecutive integers whose sum of squares is a perfect square”. Mathematics Magazine, Vol. 37(1964): pp 19–32.
Allenby, R.B.J.T. & Redfern, E.J. Introduction to Number Theory with Computing. Edward Arnold, 1989.
Beeckmans, L. “Squares expressible as a sum of consecutive squares”. American Mathematical Monthly, Vol. 101 (1994): pp. 437–442.
Laub, M., Lossers, O.P.,Matties, L.E. “Squares expressible as a sum of n consecutive squares, Solutions of Advanced Problems”. American Mathematical Monthly, Vol. 97(1990): pp 622–625.
Philipp, S. “Note on consecutive integers whose sum of squares is a perfect square”. Mathematics Magazine, Vol. 37(1964): pp. 218–220.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Freitag, H.T., Phillips, G.M. (1996). On the Sum of Consecutive Squares. In: Bergum, G.E., Philippou, A.N., Horadam, A.F. (eds) Applications of Fibonacci Numbers. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-0223-7_12
Download citation
DOI: https://doi.org/10.1007/978-94-009-0223-7_12
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-6583-2
Online ISBN: 978-94-009-0223-7
eBook Packages: Springer Book Archive