Sums and Products of Binomial Type

Anthony Sofo
Additional contact information
Anthony Sofo: Victoria University, School of Computer Science and Mathematics

Chapter Chapter 7 in Computational Techniques for the Summation of Series, 2003, pp 135-145 from Springer

Abstract: 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.

Date: 2003
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4615-0057-5_7

Ordering information: This item can be ordered from
http://www.springer.com/9781461500575

DOI: 10.1007/978-1-4615-0057-5_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().