Generalization of the Euler Sum

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

Chapter Chapter 5 in Computational Techniques for the Summation of Series, 2003, pp 87-109 from Springer

Abstract: Abstract In this chapter an investigation of a generalization of the identity (2.13) of Chapter 2 is undertaken. The investigation will also make use of the finite binomial type sums obtained in Chapter 4. A connection with renewal processes will be made. It will be proved that generated infinite sums may be represented in closed form that depend on k-dominant zeros of an associated transcendental characteristic function.

Keywords: Characteristic Function; Recurrence Relation; Computational Technique; Renewal Process; Induction Argument (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_5

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

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

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