Abstract
An arbitrary order forced difference-delay system is considered from which finite binomial sums are generated. Z transform theory is then utilized to represent the finite binomial type sums in closed form, moreover Zeilberger’s creative telescoping algorithm, Petkovšek’s algorithm ‘Hyper’ and Wilf and Zeilberger’s WZ pairs method is used to certify particular instances of the identities.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Sofo, A. (2003). Sums and Products of Binomial Type. In: Computational Techniques for the Summation of Series. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0057-5_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0057-5_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4904-4
Online ISBN: 978-1-4615-0057-5
eBook Packages: Springer Book Archive