EECS 203: Discrete Mathematics

Fall 2019
Discussion 6 Notes
1 Definitions
• Well Ordering Property :

• Counting with / without order:

• Counting with / without repetitions:

• Product Rule:

• Sum Rule:

• Inclusion-exclusion principle:

• Pigeonhole Principle:

• Generalized Pigeonhole Principle:

1. 5.2 - Example 5
Use the well-ordering property to prove the division algorithm. Recall that the division
algorithm states that if a is an integer and d is a positive integer, then there are unique
integers q and r with 0 ≤ r < d and a = dq + r.

2. Exercise 6.1.16
How many strings are there of four lowercase letters that have the letter x in them?

3. Exercise 6.1.26
How many strings of four decimal digits
a) do not contain the same digit twice?

b) end with an even digit?

c) have exactly three digits that are 9s?

1
4. Exercise 6.1.40
How many subsets of a set with 100 elements have more than one element?

5. Exercise 6.2.14
How many ordered pairs of integers (a, b) are needed to guarantee that there are two ordered
pairs (a1 , b1 ) and (a2 , b2 ) such that a1 and a2 have the same remainder when divided by 5,
and b1 and b2 also have the same remainder when divided by 5?

6. Exercise 6.2.18
How many numbers must be selected from the set {1, 3, 5, 7, 9, 11, 13, 15} to guarantee that
at least one pair of these numbers add up to 16?

7. Not in Book 1
Five distinct points are picked on the circumference of a sphere. Show that 4 of them must
lie on the same closed hemisphere (where a closed hemisphere is half of the circumference,
including the dividing circle).

8. Exercise 6.3.46
How many ways are there for a horse race with four horses to finish if ties are possible?
[Note: Any number of the four horses may tie.]

9. Not in Book 2
Find the coefficient of x2 in the expansion (x + x1 )10