Q. 363.7( 3 Votes )

# Prove that for all n ϵ N

Answer :

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.

Rate this question :

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

RD Sharma - MathematicsProve that sin x + sin 3x + … + sin (2n – 1) x for all

nϵN.

RD Sharma - MathematicsProve the following by the principle of mathematical induction:

1.2 + 2.3 + 3.4 + … + n(n + 1)

RD Sharma - MathematicsProve the following by the principle of mathematical induction:

1.3 + 2.4 + 3.5 + … + n . (n + 2)

RD Sharma - MathematicsProve the following by the principle of mathematical induction:

RD Sharma - Mathematics

Prove the following by the principle of mathematical induction:

1^{2} + 3^{2} + 5^{2} + … + (2n – 1)^{2}

Prove the following by the principle of mathematical induction:

a + ar + ar^{2} + … + ar^{n – 1}

Prove the following by the principle of mathematical induction:

2 + 5 + 8 + 11 + … + (3n – 1) = 1/2 n(3n + 1)

RD Sharma - MathematicsProve the following by the principle of mathematical induction:

1.3 + 3.5 + 5.7 + … + (2n – 1) (2n + 1)

RD Sharma - MathematicsProve that for all natural

numbers, n ≥ 2.

RD Sharma - Mathematics