Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-28T13:16:24.409Z Has data issue: false hasContentIssue false

91.11 Explicit formula for power sums of an arithmetic sequence

Published online by Cambridge University Press:  01 August 2016

N. Gauthier*
Affiliation:
Department of Physics, The Royal Military College of Canada, PO Box 17,000 Station Forces, Kingston, K7K 7B4, ON, Canadae-mail: [email protected]

Abstract

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Notes
Copyright
Copyright © The Mathematical Association 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Simons, S., An approach to evaluating , Math. Gaz. 88 (November 2004) pp. 519521.CrossRefGoogle Scholar
2. Inaba, Y., A note on the sums lk + (1 + d)k + (I + 2df +…+(1+ nd)k , Int. J. Math. Educ. Sei. Technol. 35 (May-June 2004) p. 440.Google Scholar
3. Howard, F. T., Sums of powers of integers via generating functions, The Fibonacci Quarterly 34(3) (June-July 1996) p. 244.Google Scholar
4. Gradshteyn, I. S. and Ryzhik, I. M., Tables of Integrals, Series, and Products, Academic Press, New York (1980).Google Scholar
5. Gauthier, N., Fibonacci sums of the type Σr0Fm , Math. Gaz. 79 (July 1995) pp. 364367.Google Scholar
6. Koshy, T., Fibonacci and Lucas Numbers with Applications, John Wiley and Sons, New York (2001).Google Scholar