Abstract
The previous chapters should have given you some idea of the possibilities of computer algebra for Analysis and Linear Algebra. In this chapter, we shall focus on another field of application. In contrast to the continuous (or limit) processes we have encountered so far, in the present chapter we shall work with finite processes such as ordinary counting. We shall have occasion to look into the ways Maple can assist us with counting and summation processes, both numerical and symbolic. The examples we have chosen are mainly taken from the fields of combinatorics and discrete probability theory.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Basel AG
About this chapter
Cite this chapter
Stroeker, R.J., Kaashoek, J.F. (1999). Counting and Summation. In: Discovering Mathematics with Maple. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8726-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8726-7_4
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-7643-6091-7
Online ISBN: 978-3-0348-8726-7
eBook Packages: Springer Book Archive