Advertisements
Advertisements
प्रश्न
12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .
Advertisements
उत्तर
Let P(n) be the given statement.
Now,
\[P(n) = 1^2 + 2^2 + 3^2 + . . . + n^2 = \frac{n(n + 1)(2n + 1)}{6}\]
\[\text{ Step } 1: \]
\[P(1) = 1^2 = \frac{1(1 + 1)(2 + 1)}{6} = \frac{6}{6} = 1\]
\[\text{ Hence, P(1) is true} . \]
\[\text{ Step } 2: \]
\[\text{ Let P(m) be true .} \]
\[\text{ Then,} \]
\[ 1^2 + 2^2 + . . . + m^2 = \frac{m(m + 1)(2m + 1)}{6}\]
\[\text{ We shall now prove that P(m + 1) is true} . \]
\[i . e . , \]
\[ 1^2 + 2^2 + 3^2 + . . . + (m + 1 )^2 = \frac{(m + 1)(m + 2)(2m + 3)}{6}\]
\[ \text{ Now } , \]
\[P(m) = 1^2 + 2^2 + 3^2 + . . . + m^2 = \frac{m(m + 1)(2m + 1)}{6}\]
\[ \Rightarrow 1^2 + 2^2 + 3^2 + . . . + m^2 + (m + 1 )^2 = \frac{m(m + 1)(2m + 1)}{6} + (m + 1 )^2 \left[ \text{ Adding} (m + 1 )^2 \text{ to both sides} \right]\]
\[ \Rightarrow 1^2 + 2^2 + 3^2 + . . . + (m + 1 )^2 = \frac{m(m + 1)(2m + 1) + 6(m + 1 )^2}{6} = \frac{(m + 1)(2 m^2 + m + 6m + 6)}{6} = \frac{(m + 1)(m + 2)(2m + 3)}{6}\]
\[\text{ Hence, P(m + 1) is true } . \]
\[\text{ By the principle of mathematical induction, the given statement 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 + 3^2 + ... + 3^(n – 1) =((3^n -1))/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:
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+2+ 3+...+n<1/8(2n +1)^2`
Prove the following by using the principle of mathematical induction for all n ∈ N: 41n – 14n is a multiple of 27.
\[\frac{1}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 1}\]
1.2 + 2.22 + 3.23 + ... + n.2n = (n − 1) 2n+1+2
1.2 + 2.3 + 3.4 + ... + n (n + 1) = \[\frac{n(n + 1)(n + 2)}{3}\]
32n+2 −8n − 9 is divisible by 8 for all n ∈ N.
72n + 23n−3. 3n−1 is divisible by 25 for all n ∈ N.
7 + 77 + 777 + ... + 777 \[{. . . . . . . . . . .}_{n - \text{ digits } } 7 = \frac{7}{81}( {10}^{n + 1} - 9n - 10)\]
x2n−1 + y2n−1 is divisible by x + y for all n ∈ N.
\[\text{ A sequence } x_0 , x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_0 = 5 and x_k = 4 + x_{k - 1}\text{ for all natural number k . } \]
\[\text{ Show that } x_n = 5 + 4n \text{ for all n } \in N \text{ using mathematical induction .} \]
Prove by method of induction, for all n ∈ N:
2 + 4 + 6 + ..... + 2n = n (n+1)
Prove by method of induction, for all n ∈ N:
12 + 32 + 52 + .... + (2n − 1)2 = `"n"/3 (2"n" − 1)(2"n" + 1)`
Prove by method of induction, for all n ∈ N:
1.2 + 2.3 + 3.4 + ..... + n(n + 1) = `"n"/3 ("n" + 1)("n" + 2)`
Prove by method of induction, for all n ∈ N:
`1/(3.5) + 1/(5.7) + 1/(7.9) + ...` to n terms = `"n"/(3(2"n" + 3))`
Prove by method of induction, for all n ∈ N:
(23n − 1) is divisible by 7
Prove by method of induction, for all n ∈ N:
(24n−1) is divisible by 15
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
`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:
2n + 1 < 2n, for all natual numbers n ≥ 3.
Show by the Principle of Mathematical Induction that the sum Sn of the n term of the series 12 + 2 × 22 + 32 + 2 × 42 + 52 + 2 × 62 ... is given by
Sn = `{{:((n(n + 1)^2)/2",", "if n is even"),((n^2(n + 1))/2",", "if n is odd"):}`
Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.
Give an example of a statement P(n) which is true for all n. Justify your answer.
Prove the statement by using the Principle of Mathematical Induction:
For any natural number n, xn – yn is divisible by x – y, where x and y are any integers with x ≠ y.
Prove the statement by using the Principle of Mathematical Induction:
n(n2 + 5) is divisible by 6, for each natural number n.
Prove the statement by using the Principle of Mathematical Induction:
2n < (n + 2)! for all natural number 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.
A sequence d1, d2, d3 ... is defined by letting d1 = 2 and dk = `(d_(k - 1))/"k"` for all natural numbers, k ≥ 2. Show that dn = `2/(n!)` for all n ∈ N.
Prove that for all n ∈ N.
cos α + cos(α + β) + cos(α + 2β) + ... + cos(α + (n – 1)β) = `(cos(alpha + ((n - 1)/2)beta)sin((nbeta)/2))/(sin beta/2)`.
For all n ∈ N, 3.52n+1 + 23n+1 is divisible by ______.
