Abstract
The problem of indefinite summation is very similar to the problem of indefinite integration, in fact, we can somehow think of it as a discrete analogon to the integration problem. Whereas in integration we start out with a continuous function f(x) and want to determine another function g(x) such that in indefinite summation we are given a sequence (an)n∈ℕ and we want to determine another sequence (sn)n∈ℕ0 (in which the function symbol ∑ is eliminated) such that any partial sum of the corresponding series can be expressed as Of course we expect that the existence of algorithmic solutions for this indefinite summation problem will depend crucially on the class of functions that we take as input and possible output.
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
© 1996 Springer-Verlag Wien
About this chapter
Cite this chapter
Winkler, F. (1996). 10 Indefinite summation. In: Polynomial Algorithms in Computer Algebra. Texts and Monographs in Symbolic Computation. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6571-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6571-3_10
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82759-8
Online ISBN: 978-3-7091-6571-3
eBook Packages: Springer Book Archive