Discrete Structures for Computer Science

Tutorial 4 (Proofs: Checkerboard problems and Weak Mathematical Induction)

1. Prove or disprove that you can use dominoes to tile the standard checkerboard with two adjacent
corners removed (that is, corners that are not opposite).

2. Prove that you can use dominoes to tile a rectangular checkerboard with an even number of squares.
3. Prove or disprove that a 6 x 6 checkerboard with four squares removed can be covered with
straight triominoes.

4. Prove using Mathematical Induction: 2+ 6+ 10+ ... + (4n-2) = 2n 2

5. By Mathematical Induction prove that n2-3n+4 is even and it is True for all positive Integers.

6. Prove using Mathematical Induction:

1+3+5+....+2n-1 = n2

7. Using Mathematical Induction, Prove that ∀(p,n) ∈N2, pn+1+ (p+1)2n-1 is divisible by p2+p+1.

(2n)! 1
8.. Prove that ∀ n ∈ N , 2n 2≤
2 ( n ! ) √ 3 n+1

9. Prove by MI
n

∑ ( 2 i −1 )=n2
i=1

10. Prove that , given any 2nx2n defective chessborad, it can be tiled with the L shaped triominoes.

What is a defective chess board?

A defective chessboard of size nxn is a chessboard of unit squares with
exactly one unit square defective/missing.

In the defective chessboard problem, we have to tile a defective

chessboard using triominoes of four types with the following restrictions:
● Two triominoes should not overlap
● Triominoes should not cover the defective unit square
● Triominoes should cover all other unit squares