EECS 203: Discrete Mathematics

Fall 2019
Discussion 7 Notes
Definitions
• Permutation:

• Combination:

• Binomial coefficient:

• Combinatorial proof:

• Permutations w/ Repetition:

• Stars and Bars:

• Permutations with Indistinguishable Objects:

1. Section 6.4 Not in Book

Find the constant term in the expansion of (2x + 5 x1 )6 .

2. Section 6.4 Exercise 33

Give a combinatorial proof that nk=1 k nk = n2n−1 . [Hint: Count in two ways the number
P

of ways to select a committee and then to select a leader of the committee.]

3. Section 6.4 Not In Book

n+1 n n




Prove Pascal’s identity algebraically: r
= r−1
+ r
.

4. Not In Book
How many different strings can be made from the letters in ATREYATATA, using all the
letters?

1
5. Exercise 6.5.8
How many different ways are there to choose a dozen donuts from the 21 varieties at a donut
shop?

6. Exercise 6.5.38
How many different bit strings can be formed using six 1s and eight 0s?

7. Exercise 6.5.44 Modified

How many ways are there to distribute 52 cards equally amongst 4 players?

8. Section 6.5 Exercise 55 Modified

(a) How many ways are there to put 6 employees in 4 identical offices if at least one
employee must be assigned to each office?

(b) How many ways are there to put 6 employees in 3 identical offices if there are no
restrictions on the number of people per office?

2
3