📚 Applied Finite Mathematics
⇩ Download ▾

Chapter 6: Sets and Counting

In this chapter, you will learn to:

  1. Use set theory and Venn diagrams to solve counting problems.
  2. Use the Multiplication Axiom to solve counting problems.
  3. Use Permutations to solve counting problems.
  4. Use Combinations to solve counting problems.
  5. Use the Binomial Theorem to expand (x+y)n size 12{ left (x+y right ) rSup { size 8{n} } } {}.

In this section, we will familiarize ourselves with set operations and notations, so that we can apply these concepts to both counting and probability problems. We begin by defining some terms.

A set is a collection of objects, and its members are called the elements of the set. We name the set by using capital letters, and enclose its members in braces. Suppose we need to list the members of the chess club. We use the following set notation.

C = {Ken, Bob, Tran, Shanti, Eric } size 12{C= left lbrace "Ken, Bob, Tran, Shanti, Eric" right rbrace } {}

A set that has no members is called an empty set. The empty set is denoted by the symbol Ø.

Two sets are equal if they have the same elements.

Adapted from Applied Finite Mathematics by Rupinder Sekhon (De Anza College), originally published by OpenStax CNX (cnx.org, collection col10613), licensed under CC BY 3.0. Changes were made. License: CC-BY-3.0.

These eBooks are a prerelease and are not yet certified conformant with WCAG 2.1 AA or ADA Title II. Every page is built against an automated accessibility gate, and the published editions will meet ADA Title II requirements when they release in late September 2026. If something is unusable, please tell us.