Abstract
In this chapter, we extend Gosper’s, Wilf-Zeilberger’s and Zeilberger’s methods to accept rational-linear inputs rather than only integer-linear ones. For such an input \(a_{k+1}/a_k\) is not always rational, so that Gosper’s algorithm may not apply.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
In most cases \(l=1\), so that Gosper’s original algorithm is applied.
- 2.
Obviously these were proved subsequently by Zeilberger’s algorithm.
References
Gessel, I., Stanton, D.: Strange evaluations of hypergeometric series. Siam J. Math. Anal. 13, 295–308 (1982)
Horn, P., Koepf, W., Sprenger, T.: \(m\)-fold hypergeometric solutions of linear recurrence equations revisited. Math Comput Sci 6, 61–77 (2012)
Koepf, W.: Algorithms for \(m\)-fold hypergeometric summation. J. Symbolic Comput. 20, 399–417 (1995)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer-Verlag London
About this chapter
Cite this chapter
Koepf, W. (2014). Extensions of the Algorithms. In: Hypergeometric Summation. Universitext. Springer, London. https://doi.org/10.1007/978-1-4471-6464-7_8
Download citation
DOI: https://doi.org/10.1007/978-1-4471-6464-7_8
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-6463-0
Online ISBN: 978-1-4471-6464-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)