Advertisements
Advertisements
प्रश्न
Prove by induction that for all natural number n sinα + sin(α + β) + sin(α + 2β)+ ... + sin(α + (n – 1)β) = `(sin (alpha + (n - 1)/2 beta)sin((nbeta)/2))/(sin(beta/2))`
Advertisements
उत्तर
Consider P(n): sinα + sin(α + β) + sin(α + 2β) + ... + sin(α + (n – 1)β)
= `(sin (alpha + (n - 1)/2 beta)sin((nbeta)/2))/(sin(beta/2))`, for all natural number n.
We observe that P(1) is true.
Since P(1): sin α = `(sin(alpha + 0) sin beta/2)/(sin beta/2)`
Assume that P(n) is true for some natural numbers k.
i.e., P(k): sin α + sin(α + β) + sin(α + 2β) + ... + sin(α + (k – 1)β)
= `(sin (alpha + (k - 1)/2 beta)sin((kbeta)/2))/(sin(beta/2))`
Now, to prove that P(k + 1) is true.
We have P(k + 1): sin α + sin(α + β) + sin(α + 2β) + ... + sin(α + (k – 1)β) + sin(α + kβ)
= `(sin (alpha + ("k" - 1)/2 beta)sin((kbeta)/2))/(sin(beta/2)) + sin(alpha + kbeta)`
= `(sin(alpha + (k - 1)/2 beta) sin (kbeta)/2 + sin(alpha + kbeta) sin beta/2)/(sin beta/2)`
= `(cos(alpha - beta/2) - cos(alpha + kbeta - beta/2) + cos(alpha + kbeta - beta/2) - cos(alpha + kbeta + beta/2))/(2sin beta/2)`
= `(cos(alpha - beta/2) - cos(alpha + kbeta + beta/2))/(2sin beta/2)`
= `(sin (alpha + (kbeta)/2)sin ((kbeta + beta)/2))/(sin beta/2)`
= `(sin(alpha + (kbeta)/2) sin(k + 1)(beta/2))/(sin beta/2)`
Thus P(k + 1) is true whenever P(k) is true.
Hence, by the Principle of Mathematical Induction P(n) is true for all natural number n.
APPEARS IN
संबंधित प्रश्न
Prove the following by using the principle of mathematical induction for all n ∈ N:
`1/1.4 + 1/4.7 + 1/7.10 + ... + 1/((3n - 2)(3n + 1)) = n/((3n + 1))`
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: 102n – 1 + 1 is divisible by 11
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 "2n ≥ 3n" and if P (r) is true, prove that P (r + 1) is true.
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}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]
12 + 32 + 52 + ... + (2n − 1)2 = \[\frac{1}{3}n(4 n^2 - 1)\]
a + ar + ar2 + ... + arn−1 = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]
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)\] for n ≥ 2, where a > 0, A > 0.
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}\]
Prove that n3 - 7n + 3 is divisible by 3 for all n \[\in\] N .
7 + 77 + 777 + ... + 777 \[{. . . . . . . . . . .}_{n - \text{ digits } } 7 = \frac{7}{81}( {10}^{n + 1} - 9n - 10)\]
Prove that the number of subsets of a set containing n distinct elements is 2n, for all n \[\in\] 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_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 .\]
\[\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:
3n − 2n − 1 is divisible by 4
Prove by method of induction, for all n ∈ N:
(cos θ + i sin θ)n = cos (nθ) + i sin (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
`[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 1)], ∀ "n" ∈ "N"`
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.
State whether the following proof (by mathematical induction) is true or false for the statement.
P(n): 12 + 22 + ... + n2 = `(n(n + 1) (2n + 1))/6`
Proof By the Principle of Mathematical induction, P(n) is true for n = 1,
12 = 1 = `(1(1 + 1)(2*1 + 1))/6`. Again for some k ≥ 1, k2 = `(k(k + 1)(2k + 1))/6`. Now we prove that
(k + 1)2 = `((k + 1)((k + 1) + 1)(2(k + 1) + 1))/6`
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:
1 + 5 + 9 + ... + (4n – 3) = n(2n – 1) for all natural numbers n.
If xn – 1 is divisible by x – k, then the least positive integral value of k is ______.
If P(n): 2n < n!, n ∈ N, then P(n) is true for all n ≥ ______.
State whether the following statement is true or false. Justify.
Let P(n) be a statement and let P(k) ⇒ P(k + 1), for some natural number k, then P(n) is true for all n ∈ N.
By using principle of mathematical induction for every natural number, (ab)n = ______.
