Abstract
Sets and sequences are the fundamental objects of study in discrete mathematics, and this chapter provides a review of naïve set theory. Formulas for counting sequences, subsets, and permutations are developed, followed by an algorithmic method for counting when no formula applies (or is obvious). The final section looks at infinite sequences, particularly complexity functions of algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Jenkyns, T., Stephenson, B. (2018). Sets, Sequences, and Counting. In: Fundamentals of Discrete Math for Computer Science. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-70151-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-70151-6_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-70150-9
Online ISBN: 978-3-319-70151-6
eBook Packages: Computer ScienceComputer Science (R0)