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.2.3 + 2.3.4 + … + n(n + 1) (n + 2) = `(n(n+1)(n+2)(n+3))/(4(n+3))`
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: n (n + 1) (n + 5) is a multiple of 3.
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 "n(n + 1) is even", then what is P(3)?
If P (n) is the statement "2n ≥ 3n" and if P (r) is true, prove that P (r + 1) is true.
\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]
1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]
52n −1 is divisible by 24 for all n ∈ N.
32n+7 is divisible by 8 for all n ∈ N.
(ab)n = anbn for all n ∈ N.
Prove that 1 + 2 + 22 + ... + 2n = 2n+1 - 1 for all n \[\in\] N .
7 + 77 + 777 + ... + 777 \[{. . . . . . . . . . .}_{n - \text{ digits } } 7 = \frac{7}{81}( {10}^{n + 1} - 9n - 10)\]
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 .\]
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:
(24n−1) is divisible by 15
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
`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))`
Answer the following:
Prove by method of induction loga xn = n logax, x > 0, n ∈ N
Prove the statement by using the Principle of Mathematical Induction:
n3 – 7n + 3 is divisible by 3, for all natural numbers n.
Prove the statement by using the Principle of Mathematical Induction:
n3 – n is divisible by 6, for each natural number n ≥ 2.
Prove the statement by using the Principle of Mathematical Induction:
2n < (n + 2)! for all natural number n.
Prove the statement by using the Principle of Mathematical Induction:
2 + 4 + 6 + ... + 2n = n2 + n for all natural numbers n.
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 a1, a2, a3 ... is defined by letting a1 = 3 and ak = 7ak – 1 for all natural numbers k ≥ 2. Show that an = 3.7n–1 for all natural numbers.
Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.
If 10n + 3.4n+2 + k is divisible by 9 for all n ∈ N, then the least positive integral value of k is ______.
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.
