Combinatorics is an area of mathematics that focuses on counting arguments. It is often used to solve problems involving finite or countable sets in statistics, computer science, logic, and other areas of mathematics. Combinatorics is viewed as part of Discrete Mathematics - a broad area in mathematics concerned with the study of finite or countable structures such as logical and algebraic structures, graphs and more. In this chapter, we discuss a few common tools for counting elements in a finite set. The terminology, notation, and proof techniques discussed in earlier chapters, in the context of sets and functions, will prove to be important and useful in addressing counting problems.
Review the options below to login to check your access.
Log in with your Cambridge Higher Education account to check access.
If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.