1. 9 . 1 B A S I C C O M B I N A T O R I C S
9 . 2 T H E B I N O M I A L T H E O R E M
Discrete Mathematics

2. Multiplication Principle of Counting
 Counting the number of ways that a set of n-objects
(called an n-set) can be arranged in order.
 Each order is called a permutation.
 There are n! permutations of an n-set.

3. Distinguishable Permutations
 DRAGONFLY
 362,880
 BUTTERFLY
 181,440
 BUMBLEBEE
 10,080

4. Distinguishable Permutations


5. Combinations


6. Subsets of a Set


7. Powers of Binomial
 1
1a1 b0 + 1a0b1
1a1 b0 + 2a1b1 + 1a0b1