Advertisements
Advertisements
प्रश्न
1.2 + 2.3 + 3.4 + ... + n (n + 1) = \[\frac{n(n + 1)(n + 2)}{3}\]
Advertisements
उत्तर
Let P(n) be the given statement.
Now,
\[P(n) = 1 . 2 + 2 . 3 + 3 . 4 + . . . + n(n + 1) = \frac{n(n + 1)(n + 2)}{3}\]
\[\text{ Step } 1: \]
\[P(1) = 1 . 2 = 2 = \frac{1(1 + 1)(1 + 2)}{3}\]
\[\text{ Hence, P(1) is true } . \]
\[\text{ Step } 2: \]
\[\text{ Let P(m) be true } . \]
\[\text{ Then, } \]
\[1 . 2 + 2 . 3 + . . . + m(m + 1) = \frac{m(m + 1)(m + 2)}{3}\]
\[\text{ To prove: P(m + 1) is true .} \]
\[\text{ That is,} \]
\[1 . 2 + 2 . 3 + . . . + (m + 1)(m + 2) = \frac{(m + 1)(m + 2)(m + 3)}{3}\]
\[\text{ Now, P(m) is } \]
\[1 . 2 + 2 . 3 + . . . + m(m + 1) = \frac{m(m + 1)(m + 2)}{3}\]
\[ \Rightarrow 1 . 2 + 2 . 3 + . . . + m(m + 1) + (m + 1)(m + 2) = \frac{m(m + 1)(m + 2)}{3} + (m + 1)(m + 2)\]
\[ \Rightarrow P(m + 1) = \frac{(m + 1)(m + 2)(m + 3)}{3}\]
\[\text{ Thus, P(m + 1) is true .} \]
\[\text{ By the principle of mathematical induction, P(n) is true for all n } \in N . '\]
APPEARS IN
संबंधित प्रश्न
Prove the following by using the principle of mathematical induction for all n ∈ N:
`1^3 + 2^3 + 3^3 + ... + n^3 = ((n(n+1))/2)^2`
Prove the following by using the principle of mathematical induction for all n ∈ N:
Prove the following by using the principle of mathematical induction for all n ∈ N:
`(1+ 1/1)(1+ 1/2)(1+ 1/3)...(1+ 1/n) = (n + 1)`
Prove the following by using the principle of mathematical induction for all n ∈ N: `1+2+ 3+...+n<1/8(2n +1)^2`
If P (n) is the statement "n3 + n is divisible by 3", prove that P (3) is true but P (4) is not true.
Given an example of a statement P (n) such that it is true for all n ∈ N.
1 + 3 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.
\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]
1.2 + 2.22 + 3.23 + ... + n.2n = (n − 1) 2n+1+2
a + ar + ar2 + ... + arn−1 = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
52n −1 is divisible by 24 for all n ∈ N.
52n+2 −24n −25 is divisible by 576 for all n ∈ N.
(ab)n = anbn for all n ∈ N.
n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.
x2n−1 + y2n−1 is divisible by x + y for all n ∈ N.
\[\text{ The distributive law from algebra states that for all real numbers} c, a_1 \text{ and } a_2 , \text{ we have } c\left( a_1 + a_2 \right) = c a_1 + c a_2 . \]
\[\text{ Use this law and mathematical induction to prove that, for all natural numbers, } n \geq 2, if c, a_1 , a_2 , . . . , a_n \text{ are any real numbers, then } \]
\[c\left( a_1 + a_2 + . . . + a_n \right) = c a_1 + c a_2 + . . . + c a_n\]
Prove by method of induction, for all n ∈ N:
3 + 7 + 11 + ..... + to n terms = n(2n+1)
Prove by method of induction, for all n ∈ N:
13 + 33 + 53 + .... to n terms = n2(2n2 − 1)
Prove by method of induction, for all n ∈ N:
(cos θ + i sin θ)n = cos (nθ) + i sin (nθ)
Prove by method of induction, for all n ∈ N:
Given that tn+1 = 5tn + 4, t1 = 4, prove that tn = 5n − 1
Prove by method of induction, for all n ∈ N:
`[(1, 2),(0, 1)]^"n" = [(1, 2"n"),(0, 1)]` ∀ n ∈ N
Answer the following:
Prove, by method of induction, for all n ∈ N
2 + 3.2 + 4.22 + ... + (n + 1)2n–1 = n.2n
Answer the following:
Prove, by method of induction, for all n ∈ N
`1/(3.4.5) + 2/(4.5.6) + 3/(5.6.7) + ... + "n"/(("n" + 2)("n" + 3)("n" + 4)) = ("n"("n" + 1))/(6("n" + 3)("n" + 4))`
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
`sum_(t = 1)^(n - 1) t(t + 1) = (n(n - 1)(n + 1))/3`, for all natural numbers n ≥ 2.
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
`(1 - 1/2^2).(1 - 1/3^2)...(1 - 1/n^2) = (n + 1)/(2n)`, for all natural numbers, n ≥ 2.
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
2n + 1 < 2n, for all natual numbers n ≥ 3.
Prove the statement by using the Principle of Mathematical Induction:
23n – 1 is divisible by 7, for all natural numbers n.
Prove the statement by using the Principle of Mathematical Induction:
For any natural number n, 7n – 2n is divisible by 5.
Prove the statement by using the Principle of Mathematical Induction:
1 + 5 + 9 + ... + (4n – 3) = n(2n – 1) for all natural numbers n.
A sequence b0, b1, b2 ... is defined by letting b0 = 5 and bk = 4 + bk – 1 for all natural numbers k. Show that bn = 5 + 4n for all natural number n using mathematical induction.
Prove that, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin ((n + 1))/2 theta)/(sin theta/2)`, for all n ∈ N.
Show that `n^5/5 + n^3/3 + (7n)/15` is a natural number for all n ∈ N.
Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.
