If $P(n) = 2 + 4 + 6 + \dots + 2n$,$n \in N$,then $P(k) = k(k + 1) + 2 \implies P(k + 1) = (k + 1)(k + 2) + 2$ for all $k \in N$. So we can conclude that $P(k) = k(k + 1) + 2$ for all $k \in N$ is true. What can we conclude about $P(n) = n(n + 1) + 2$ for all $n \in N$?

  • A
    All $n \in N$
  • B
    $n > 1$
  • C
    $n > 2$
  • D
    Nothing can be said

Explore More

Similar Questions

Let $P(n): 2+2^2+2^3+\ldots+2^n=2^{n+1}-2, n \in N$. Then,

For all natural numbers $n$,$3(5^{2n+1}) + 2^{3n+1}$ is divisible by:

Let $P(n): 1^2+2^2+3^2+\ldots+n^2 = \frac{6(n-1)(n-2) \ldots(n-2020)+2n^3+3n^2+n}{6}$,for all $n \in N$. Then which of the following is correct?

Prove the following by using the principle of mathematical induction for all $n \in N$:
$1 \cdot 2 \cdot 3 + 2 \cdot 3 \cdot 4 + \ldots + n(n+1)(n+2) = \frac{n(n+1)(n+2)(n+3)}{4}$

Prove that for all $n \in N$,$3^{2n+2} - 8n - 9$ is divisible by $8$ using the principle of mathematical induction.

Difficult
View Solution

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo