Class activity 

Proof by Induction 
Step 1: there are examples to prove by induction . See those examples and try to solve
them by yourself. 
Step 2: if you are not able to solve , check solution given in these slides and try to
understand. 
Proof By Ladder Method

●   Let4:n ∈ N. Prove that

Example

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.