Advertisements
Advertisements
प्रश्न
Prove that, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin ((n + 1))/2 theta)/(sin theta/2)`, for all n ∈ N.
Advertisements
उत्तर
Let P(n): sinθ + sin2θ + sin3θ + ... + sinnθ
= `(sin (ntheta)/2 . sin ((n + 1))/2 theta)/(sin theta/2)`, n ∈ N.
Step 1: P(1) : sinθ = `(sin theta/2 . sin ((1 + 1)/2)theta)/(sin theta/2)`
= `(sin theta/2 . sin theta)/(sin theta/2)`
= sinθ
∴ sinθ = sinθ which is true for P(1).
Step 2: P(k): sinθ + sin2θ + sin3θ + ... + sinkθ
= `(sin (ktheta)/2 . sin ((k + 1)/2)theta)/(sin theta/2)`
Let it be true for P(k).
Step 3: P(k + 1): sinθ + sin2θ + sin3θ + ... + sin(k + 1)θ
= `(sin (ktheta)/2 . sin ((k + 1)/2)theta)/(sin theta/2) + sin(k + 1)theta`
= `(sin (ktheta)/2 . sin ((k + 1)/2)theta + sin(k + 1)theta . sin theta/2)/(sin theta/2)`
= `(2sin (ktheta)/2 . sin ((k + 1)/2)theta + 2 sin (k + 1)theta . sin theta/2)/(2 sin theta/2)`
= `(cos((ktheta)/2 - (k + 1)/2 theta) - cos((ktheta)/2 + (k + 1)/2 theta) + cos[(k + 1)theta - theta/2] - [cos[(k + 1)theta + theta/2]))/(2sin theta/2)`
= `(cos(- theta/2) - cos(ktheta + theta/2) + cos(ktheta + theta/2) - cos(ktheta + (3theta)/2))/(2sin theta/2)`
= `(cos(theta/2) - cos(ktheta + (3theta)/2))/(2sin theta/2)`
= `(-2sin((theta/2 + ktheta + (3theta)/2)/2).sin ((theta/2 - ktheta - (3theta)/2)/2))/(2sin theta/2)` ......`[because cos"A" - cos"B" = - 2sin (("A" + "B"))/2 sin (("A" - "B"))/2]`
= `(-2sin((ktheta + 2theta)/2) . sin ((-ktheta - theta)/2))/(2sin theta/2)`
= `(sin((ktheta + 2theta)/2).sin ((ktheta + theta)/2))/(sin theta/2)`
= `(sin[((k + 1) - 1)/2]theta.sin [(k + 1)/2]theta)/(sin theta/2)` which is true for P(k + 1).
Hence, P(k + 1) is true whenever P(k) is true.
APPEARS IN
संबंधित प्रश्न
Prove the following by using the principle of mathematical induction for all n ∈ N:
`1^3 + 2^3 + 3^3 + ... + n^3 = ((n(n+1))/2)^2`
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:
(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:
`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:
Prove the following by using the principle of mathematical induction for all n ∈ N: n (n + 1) (n + 5) is a multiple of 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.2 + 2.22 + 3.23 + ... + n.2n = (n − 1) 2n+1+2
1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]
a + ar + ar2 + ... + arn−1 = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
52n −1 is divisible by 24 for all n ∈ N.
n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.
72n + 23n−3. 3n−1 is divisible by 25 for all n ∈ 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:
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:
`[(1, 2),(0, 1)]^"n" = [(1, 2"n"),(0, 1)]` ∀ n ∈ N
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)`
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
`[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 1)], ∀ "n" ∈ "N"`
Answer the following:
Prove by method of induction loga xn = n logax, x > 0, n ∈ N
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 by the Principle of Mathematical Induction that 1 × 1! + 2 × 2! + 3 × 3! + ... + n × n! = (n + 1)! – 1 for all natural numbers n.
A student was asked to prove a statement P(n) by induction. He proved that P(k + 1) is true whenever P(k) is true for all k > 5 ∈ N and also that P(5) is true. On the basis of this he could conclude that P(n) is true ______.
Give an example of a statement P(n) which is true for all n ≥ 4 but P(1), P(2) and P(3) are not true. Justify your answer
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:
2n < (n + 2)! for all natural number n.
Prove the statement by using the Principle of Mathematical Induction:
1 + 2 + 22 + ... + 2n = 2n+1 – 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.
For all n ∈ N, 3.52n+1 + 23n+1 is divisible by ______.
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.
