Abstract
Up to now, our work has been almost entirely qualitative. The concepts of a set, relation, function, recursion and induction are, in themselves, non-numerical although they have important numerical applications as, for example, sets of integers or recursive definitions on the natural numbers. In this chapter we turn to directly quantitative matters, and specifically to problems of counting. We tackle two topics: rules for determining the number of elements of a large set from the number of elements of smaller sets, rules for calculating the number of possible selections of k items out of a set with n elements.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Makinson, D. (2020). Counting Things: Combinatorics. In: Sets, Logic and Maths for Computing. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-42218-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-42218-9_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-42217-2
Online ISBN: 978-3-030-42218-9
eBook Packages: Computer ScienceComputer Science (R0)