Advertisements
Advertisements
प्रश्न
2 + 5 + 8 + 11 + ... + (3n − 1) = \[\frac{1}{2}n(3n + 1)\]
Advertisements
उत्तर
Let P(n) be the given statement.
Now,
\[P(n) = 2 + 5 + 8 + . . . + (3n - 1) = \frac{1}{2}n(3n + 1)\]
\[\text{ Step} 1: \]
\[P(1) = 2 = \frac{1}{2} \times 1(3 + 1) \]
\[\text{ Hence, P(1) is true .} \]
\[\text{ Step} 2: \]
\[\text{ Let P(m) be true } . \]
\[\text{ Then, } \]
\[2 + 5 + 8 + . . . + (3m - 1) = \frac{1}{2}m(3m + 1)\]
\[\text{ To prove: P(m + 1) is true } . \]
\[\text{ That is, } \]
\[2 + 5 + 8 + . . . + (3m + 2) = \frac{1}{2}(m + 1)(3m + 4)\]
\[\text{ P(m) is equal to:} \]
\[2 + 5 + 8 + . . . + (3m - 1) = \frac{1}{2}m(3m + 1)\]
\[\text{ Thus, we have:} \]
\[2 + 5 + 8 + . . . + (3m - 1) + (3m + 2) = \frac{1}{2}m(3m + 1) + (3m + 2) \left[ \text{ Adding } (3m + 2) \text{ to both sides } ] \right]\]
\[ \Rightarrow 2 + 5 + 8 + . . . + (3m + 2) = \frac{1}{2}(3 m^2 + m + 6m + 4) = \frac{1}{2}(3 m^2 + 7m + 4)\]
\[ \Rightarrow 2 + 5 + 8 + . . . + (3m + 2) = \frac{1}{2}(3m + 4)(m + 1)\]
\[\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:
Prove the following by using the principle of mathematical induction for all n ∈ N: 1.2 + 2.22 + 3.22 + … + n.2n = (n – 1) 2n+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: n (n + 1) (n + 5) is a multiple of 3.
If P (n) is the statement "n(n + 1) is even", then what is P(3)?
Given an example of a statement P (n) such that it is true for all n ∈ N.
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}\] .
1 + 3 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.
\[\frac{1}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 1}\]
\[\frac{1}{3 . 5} + \frac{1}{5 . 7} + \frac{1}{7 . 9} + . . . + \frac{1}{(2n + 1)(2n + 3)} = \frac{n}{3(2n + 3)}\]
\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\]
1.3 + 2.4 + 3.5 + ... + n. (n + 2) = \[\frac{1}{6}n(n + 1)(2n + 7)\]
\[\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]
a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]
32n+7 is divisible by 8 for all n ∈ N.
Let P(n) be the statement : 2n ≥ 3n. If P(r) is true, show that P(r + 1) is true. Do you conclude that P(n) is true for all n ∈ N?
x2n−1 + y2n−1 is divisible by x + y for all n ∈ N.
\[\text{ A sequence } a_1 , a_2 , a_3 , . . . \text{ is defined by letting } a_1 = 3 \text{ and } a_k = 7 a_{k - 1} \text{ for all natural numbers } k \geq 2 . \text{ Show that } a_n = 3 \cdot 7^{n - 1} \text{ for all } n \in 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 .} \]
\[\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:
2 + 4 + 6 + ..... + 2n = n (n+1)
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:
Given that tn+1 = 5tn + 4, t1 = 4, prove that tn = 5n − 1
Answer the following:
Given that tn+1 = 5tn − 8, t1 = 3, prove by method of induction that tn = 5n−1 + 2
Answer the following:
Prove by method of induction 52n − 22n is divisible by 3, for all n ∈ N
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
1 + 3 + 5 + ... + (2n – 1) = n2
Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.
Prove the statement by using the Principle of Mathematical Induction:
n(n2 + 5) is divisible by 6, for each natural number 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)`.
Prove that number of subsets of a set containing n distinct elements is 2n, for all n ∈ N.
If xn – 1 is divisible by x – k, then the least positive integral value of k is ______.
