Swipe to navigate through the chapters of this book
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.
Please log in to get access to this content
- Sets, Sequences, and Counting
- Springer London
- Sequence number
- Chapter number