Binomial Type Sums

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

Chapter Chapter 4 in Computational Techniques for the Summation of Series, 2003, pp 73-85 from Springer

Abstract: Abstract A procedure which will allow a specific finite Binomial type sum to be expressed in closed polynomial form will be developed in this chapter. The Binomial type sum will be useful in the next chapter, where the results of Chapter 2 will be generalized.

Keywords: Recurrence Relation; Computational Technique; Multinomial Distribution; Volterra Integral Equation; Operational Calculus (search for similar items in EconPapers)
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_4

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

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

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 ().