Q36 of 66 Page 12

Prove that for all n ϵ N


Step1:



Thus, P(1)is true.


Step2:



Now, we need to show that P(m+1) is true whenever P(m) is true.











Thus, P(m+1) is true.


So, by the principle of mathematical induction, P(n) is true for all nϵN.


More from this chapter

All 66 →
34

Prove that for all n ϵ N and

35

Prove that for all natural

numbers, n ≥ 2.

 37

Prove that for all n > 2, n ϵ N.

 38

Prove that x2n – 1 + y2n – 1 is divisible by x + y for all n ϵ N.