EECS 203: Discrete Mathematics

Fall 2019
Discussion 5 Notes
1 Definitions
• Mathematical Induction:

• Strong Induction:

1. Exercise 5.1.8
Prove that 2 − 2 · 7 + 2 · 72 − · · · + 2 · (−7)n = [1 − (−7)n+1 ]/4 whenever n is a nonnegative
integer.

2. Exercise 5.1.24
1 1·3·5·...·(2n−1)
Prove that 2n
≤ 2·4·...·2n
whenever n is a positive integer.

3. Exercise 5.1.21
Prove that 2n > n2 if n is greater than 4.

4. Exercise 5.1.34
Prove that 6 divides n3 − n where n is a nonnegative integer.

5. Exercise 5.1.80
Prove or disprove that all checkerboards of these shapes can be completely covered using
right triominoes whenever n is a positive integer (Hint: A right triomino is an L-shaped piece
that covers 3 squares):
b) 6 × 2n
d) 6n × 6n

1
6. Exercise 5.2.12
Use strong induction to show that every positive integer n can be written as a sum of distinct
powers of two, that is, as a sum of a subset of the integers 20 = 1, 21 = 2, 22 = 4, and so on.
[Hint: For the inductive step, separately consider the case where k + 1 is even and where it
is odd. Note that when (k + 1) is even, (k + 1)/2 is an integer.]

7. Exercise 5.2.13
A jigsaw puzzle is put together by successively joining pieces that fit together into blocks.
A move is made each time a piece is added to a block, or when two blocks are joined. Use
strong induction to prove that no matter how the moves are carried out, exactly n − 1 moves
are required to assemble a puzzle with n pieces.