Skip to main content
Logo image

Activities 7.4 Activities

Below is a more detailed version of Procedure 7.1.2. Follow the steps of Procedure 7.4.1 to create a proof by induction for each of the requested proofs in this activity set.

Activity 7.1.

A binary string is a “word” in which each “letter” can only be 0 or 1.
Prove that there are 2n different binary strings of length n.

Activity 7.2.

Prove that for every positive integer n, the binomial 1xn can be factored as (1x)(1+x+x2++xn1).

Activity 7.3.

Prove that the following argument is valid for all positive integers n.
(p1q1)r1
(p2q2)r2
(p2q2)
(pnqn)rn
p1p2pn
(q1r1)(q2r2)(qnrn)

Careful.

Recall that in this context, the words valid and true do not have the same meaning.

Activity 7.4.

Prove that a truth table involving n statement variables requires 2n rows.

Activity 7.5.

Prove that a knight can be moved from any square to any other square on an n×n chess board by some sequence of allowed moves, for every n4.