Advertisements
Advertisements
प्रश्न
Answer the following:
Prove, by method of induction, for all n ∈ N
12 + 42 + 72 + ... + (3n − 2)2 = `"n"/2 (6"n"^2 - 3"n" - 1)`
उत्तर
Let P(n) ≡ 12 + 42 + 72 + .... + (3n − 2)2 = `"n"/2 (6"n" − 3"n" − 1)`, for all n ∈ N
Step I:
Put n = 1
L.H.S. = 12 = 1
R.H.S. = `1/2[6(1)^2 - 3(1) - 1]` = 1 = L.H.S.
∴ P(n) is true for n = 1
Step II:
Let us consider that P(n) is true for n = k
∴ 12 + 42 + 72 + .... + (3k − 2)2
= `"k"/2(6"k"^2 - 3"k" - 1)` ...(i)
Step III:
We have to prove that P(n) is true for n = k + 1
i.e., to prove that
12 + 42 + 72 + …. + [3(k + 1) − 2]2
= `(("k" + 1))/3[6("k" + 1)^2 - 3("k" + 1) - 1]`
= `(("k" + 1))/2(6"k"^2 + 12"k" + 6 - 3"k" - 3 - 1)`
= `(("k" + 1))/2 (6"k"^2 + 9"k" + 2)`
L.H.S. = 12 + 42 + 72 + …. + [3(k + 1) − 2]2
= 12 + 42 + 72 + …. + (3k − 2)2 + (3(k + 1) − 2]2
= `"k"/2(6"k"^2 - 3"k" - 1) + (3"k" + 1)^2` ...[From (i)]
= `((6"k"^3 - 3"k"^2 - "k") + 2(9"k"^2 + 6"k" + 1))/2`
= `(6"k"^3 + 15"k"^2 + 11"k" + 2)/2`
= `(("k" + 1)(6"k"^2 + 9"k" + 2))/2`
= R.H.S.
∴ P(n) is true for n = k + 1
Step IV:
From all steps above by the principle of mathematical induction, P(n) is true for all n ∈ N.
∴ 12 + 42 + 72 + ... + (3n − 2)2 = `"n"/2 (6"n"^2 - 3"n" - 1)` for all n ∈ N
APPEARS IN
संबंधित प्रश्न
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+3/1)(1+ 5/4)(1+7/9)...`(1 + ((2n + 1))/n^2) = (n + 1)^2`
Prove the following by using the principle of mathematical induction for all n ∈ N: 102n – 1 + 1 is divisible by 11
Prove the following by using the principle of mathematical induction for all n ∈ N: x2n – y2n is divisible by x + y.
Prove the following by using the principle of mathematical induction for all n ∈ N: 32n + 2 – 8n– 9 is divisible by 8.
Prove the following by using the principle of mathematical induction for all n ∈ N: 41n – 14n is a multiple of 27.
If P (n) is the statement "n2 − n + 41 is prime", prove that P (1), P (2) and P (3) are true. Prove also that P (41) is not true.
1 + 2 + 3 + ... + n = \[\frac{n(n + 1)}{2}\] i.e. the sum of the first n natural numbers is \[\frac{n(n + 1)}{2}\] .
\[\frac{1}{3 . 5} + \frac{1}{5 . 7} + \frac{1}{7 . 9} + . . . + \frac{1}{(2n + 1)(2n + 3)} = \frac{n}{3(2n + 3)}\]
1.3 + 2.4 + 3.5 + ... + n. (n + 2) = \[\frac{1}{6}n(n + 1)(2n + 7)\]
32n+7 is divisible by 8 for all n ∈ N.
n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.
\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\] for all n ∈ N .
\[\text{ Given } a_1 = \frac{1}{2}\left( a_0 + \frac{A}{a_0} \right), a_2 = \frac{1}{2}\left( a_1 + \frac{A}{a_1} \right) \text{ and } a_{n + 1} = \frac{1}{2}\left( a_n + \frac{A}{a_n} \right) \text{ for } n \geq 2, \text{ where } a > 0, A > 0 . \]
\[\text{ Prove that } \frac{a_n - \sqrt{A}}{a_n + \sqrt{A}} = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right) 2^{n - 1} .\]
Show by the Principle of Mathematical induction that the sum Sn of then terms of the series \[1^2 + 2 \times 2^2 + 3^2 + 2 \times 4^2 + 5^2 + 2 \times 6^2 + 7^2 + . . .\] is given by \[S_n = \binom{\frac{n \left( n + 1 \right)^2}{2}, \text{ if n is even} }{\frac{n^2 \left( n + 1 \right)}{2}, \text{ if n is odd } }\]
Prove that the number of subsets of a set containing n distinct elements is 2n, for all n \[\in\] N .
\[\text { A sequence } x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_1 = 2 \text{ and } x_k = \frac{x_{k - 1}}{k} \text{ for all natural numbers } k, k \geq 2 . \text{ Show that } x_n = \frac{2}{n!} \text{ for all } n \in 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:
12 + 22 + 32 + .... + n2 = `("n"("n" + 1)(2"n" + 1))/6`
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:
13 + 33 + 53 + .... to n terms = n2(2n2 − 1)
Prove by method of induction, for all n ∈ N:
`1/(1.3) + 1/(3.5) + 1/(5.7) + ... + 1/((2"n" - 1)(2"n" + 1)) = "n"/(2"n" + 1)`
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 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 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:
n(n2 + 5) is divisible by 6, for each natural number n.
Prove the statement by using the Principle of Mathematical Induction:
n2 < 2n for all natural numbers n ≥ 5.
Prove the statement by using the Principle of Mathematical Induction:
1 + 5 + 9 + ... + (4n – 3) = n(2n – 1) for all natural numbers n.
For all n ∈ N, 3.52n+1 + 23n+1 is divisible by ______.
If xn – 1 is divisible by x – k, then the least positive integral value of k is ______.
Consider the statement: “P(n) : n2 – n + 41 is prime." Then which one of the following is true?
