Proof by

Ladder Method

December, 2020
Ladder Method
Principle
●   of Ladder Method: To prove that P(n) is true for all non-negative integers
n including zero, where P(n) is a propositional function, we complete three steps:

Step 1: Where we verify that the expression P(1st) is true

Step 2: Suppose the given expression is true for certain value of .

Step 3: We have to prove that the conditional statement

P(Kth) ⇾ P[(K+ 1)th] is true for all positive integers K.

Means, if the expression is true for , then it is true for .

(P(1st) ^ ∀K(P(Kth) ⇾ P(K+1)th)) ⇾ ∀nP(n)

Proof By Ladder Method – Examples
Example
●   1: Conjecture a formula for the sum of the first n positive odd integers.
Then prove your conjecture using the Ladder Method.

, odd integers: 1; Sum =

odd integers: 1, 3; Sum =
odd integers: 1, 3, 5; Sum =
odd integers: 1, 3, 5, 7; Sum =

Conjecture:
For first positive odd integers, sum is .
Proof By Ladder Method
Conjecture:
●   For first positive odd integers, sum is equal to .

Step 1: If
LHS =
RHS= LHS = RHS

Step 1 Complete
Proof By Ladder Method
●  
Step 2: Suppose the given expression is true for certain value of .

Step 3: Now we need to show that

Let us show that the if the expression is true for , then it is true for .

So, we are claiming that:

LHS
Proof By Ladder Method
●  
Step 3 (contd.):

LHS
RHS
From Step 2, we know the value of , which is
So, * as we know that
 
LHS
… RHS
As LHS = RHS, we have proven that the expression is true for
Proof By Ladder Method
Example
●   2: Use Ladder Method to prove the inequality n < for all positive
integers n.

Step 1: If ,
LHS n =
RHS 2 ∴ LHS < RHS
Step 1 Complete

Remember: If and , then it is true that

Proof By Ladder Method
Step
●   2: Suppose the given expression is true for certain value of .

Step 3: Now, we need to show

Let us show that if the expression is true for , then it is true for .

We are claiming that

LHS
Proof By Ladder Method
Step
●   3 (contd.):
LHS
RHS =
From Step 2, we know that
∴
and , for all
As we can write as , it is true that ,

∴
∴
After satisfying each step, we can say that n < .
Proof By Ladder Method
Example
●   3: Use Ladder Method to prove the inequality < n! for every integer n
where n is equal or greater than 4 (Means n >= 4).

Step 1: If ,
LHS
RHS 24
LHS < RHS
Step 2: Suppose the given expression is true for certain value of .
Proof By Ladder Method
Step
●   3: Now, we need to show
Let us show that if the expression is true for , then it is true for .
We are claiming that

LHS
From Step 2, we know it is true that
Multiplying both sides of the inequality by 2:
Proof By Ladder Method
Step
●   3 contd.:

After satisfying each step, we can say that < n! .

Proof By Ladder Method

Example
●   Let4:n ∈ N. Prove that

Remember:
means divides completely or is a multiple of , it is same as .
e.g. .
.

Note: is not the same as ( is divided by ).

Proof By Ladder Method

as we know from Step 2 that (k5 – k) = 5m

Taking 5 as the common factor:

Proof By Ladder Method

Example
●   5: Use Ladder Method to prove that is divisible by 3 whenever n is a
positive integer.

Step 1: If ,

3 divides 0. True. Step 1 Complete

Step 2: Suppose the given expression is true for certain value of .

Note: can be any non negative integer.

Proof By Ladder Method
Step
●   3: Now, we need to show
Let us show that if the expression is true for , then it is true for .
We are claiming that 3 divides .
Let’s prove it…

  * as we know that

Because we want to prove that 3 divides this statement, and because we want to use what we know from Step 2:

  According to Step 2,
Proof By Ladder Method

Step
●   3 (contd.):

So , Hence our claim is TRUE, with .

After satisfying each step, we can say that that is divisible by 3.

 Proof By Ladder Method
Example
●   6: is divisible by 3 for all positive odd integers

Step 1: For
, which is divisible by 3, .
True, Step 1 Complete.

Step 2: Suppose the claim is true for certain value of , where is odd.

Note: can be any positive integer.

Proof By Ladder Method

Step
●   3: Now, we need to show
Let us show that if the expression is true for odd integer, then it is true for to
next odd integer.

We need to show that the claim is true for next odd integer .

  According to Step 2,
Proof By Ladder Method
Step
●   3 (contd.):

Hence Hence our claim is True with .

After satisfying each step, we can say that is divisible by 3.

Covering Chessboard with Triminos
Example 7:
Covering Chessboard with Triminos