Skip to main content Accessibility help
Internet Explorer 11 is being discontinued by Microsoft in August 2021. If you have difficulties viewing the site on Internet Explorer 11 we recommend using a different browser such as Microsoft Edge, Google Chrome, Apple Safari or Mozilla Firefox.

Chapter 8: Elementary Combinatorics

Chapter 8: Elementary Combinatorics

pp. 207-233

Authors

, University of Toronto
Resources available Unlock the full potential of this textbook with additional resources. There are Instructor restricted resources available for this textbook. Explore resources
  • Add bookmark
  • Cite
  • Share

Summary

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.

About the book

Access options

Review the options below to login to check your access.

Purchase options

eTextbook
US$44.99
Paperback
US$44.99

Have an access code?

To redeem an access code, please log in with your personal login.

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.

Also available to purchase from these educational ebook suppliers