Q41 of 66 Page 12

Prove that for all natural numbers n > 1.


Step1: For n=2



So, it is true for n=2


Step2: For n=k



Now, we need to show that P(k+1) is true when P(k) is true.



As, LHS = RHS


Thus, P(k+1) is true. So, by the principle of mathematical induction


P(n) is true for all n.


More from this chapter

All 66 →
39

Prove that sin x + sin 3x + … + sin (2n – 1) x for all

nϵN.

 40

Prove that cos α + cos (α + β) + cos (α + 2β) + … + cos (α + (n – 1)β) for all n ϵ N

 42

Given and for n ≥ 2, where a > 0, A > 0.

Prove that

43

Let P(n) be the statement: 2n ≥ 3n. If P(r) is true, show that P(r + 1) is true. Do you conclude that P(n) is true for all nϵN?