Advertisements
Advertisements
प्रश्न
Advertisements
उत्तर
\[\text{ Let p } \left( n \right): \cos\alpha + \cos\left( \alpha + \beta \right) + \cos\left( \alpha + 2\beta \right) + . . . + \cos\left[ \alpha + \left( n - 1 \right)\beta \right] = \frac{\cos\left\{ \alpha + \left( \frac{n - 1}{2} \right)\beta \right\}\sin\left( \frac{n\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)} \forall n \in N . \]
\[\text{ Step I: For } n = 1, \]
\[LHS = \cos\left[ \alpha + \left( 1 - 1 \right)\beta \right] = \cos\alpha\]
\[RHS = \frac{\cos\left\{ \alpha + \left( \frac{1 - 1}{2} \right)\beta \right\}\sin\left( \frac{\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)} = \cos\alpha\]
\[\text{ As, LHS = RHS } \]
\[\text{ So, it is true for n = 1 .} \]
\[\text{ Step II: For n = k,} \]
\[ \text{ Let } p\left( k \right): \cos\alpha + \cos\left( \alpha + \beta \right) + \cos\left( \alpha + 2\beta \right) + . . . + \cos\left[ \alpha + \left( k - 1 \right)\beta \right] = \frac{\cos\left\{ \alpha + \left( \frac{k - 1}{2} \right)\beta \right\}\sin\left( \frac{k\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)} \text{ be true } \forall k \in N . \]
\[\text{ Step III: For n } = k + 1, \]
\[LHS = \cos\alpha + \cos\left( \alpha + \beta \right) + \cos\left( \alpha + 2\beta \right) + . . . + \cos\left[ \alpha + \left( k - 1 \right)\beta \right] + \cos\left[ \alpha + \left( k + 1 - 1 \right)\beta \right]\]
\[ = \frac{\cos\left\{ \alpha + \left( \frac{k - 1}{2} \right)\beta \right\}\sin\left( \frac{k\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)} + \cos\left( \alpha + k\beta \right)\]
\[ = \frac{\cos\left\{ \alpha + \left( \frac{k - 1}{2} \right)\beta \right\}\sin\left( \frac{k\beta}{2} \right) + \sin\left( \frac{\beta}{2} \right)\cos\left( \alpha + k\beta \right)}{\sin\left( \frac{\beta}{2} \right)}\]
\[ = \frac{\sin\left( \alpha + k\beta - \frac{\beta}{2} \right) - \sin\left( \alpha - \frac{\beta}{2} \right) + \sin\left( \alpha + k\beta + \frac{\beta}{2} \right) - \sin\left( \alpha + k\beta - \frac{\beta}{2} \right)}{2\sin\left( \frac{\beta}{2} \right)}\]
\[ = \frac{- \sin\left( \alpha - \frac{\beta}{2} \right) + \sin\left( \alpha + k\beta + \frac{\beta}{2} \right)}{2\sin\left( \frac{\beta}{2} \right)}\]
\[ = \frac{2\cos\left( \frac{2\alpha + k\beta}{2} \right)\sin\left( \frac{k\beta + \beta}{2} \right)}{2\sin\left( \frac{\beta}{2} \right)}\]
\[ = \frac{\cos\left( \alpha + \frac{k\beta}{2} \right)\sin\left( \frac{\left( k + 1 \right)\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)}\]
\[RHS = \frac{\cos\left\{ \alpha + \left( \frac{k + 1 - 1}{2} \right)\beta \right\}\sin\left( \frac{\left( k + 1 \right)\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)}\]
\[ = \frac{\cos\left( \alpha + \frac{k\beta}{2} \right)\sin\left( \frac{\left( k + 1 \right)\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)}\]
\[As, LHS = RHS\]
\[\text{ So, it is also true for n = k + 1 .} \]
\[\text{ Hence,} \cos\alpha + \cos\left( \alpha + \beta \right) + \cos\left( \alpha + 2\beta \right) + . . . + \cos\left[ \alpha + \left( n - 1 \right)\beta \right] = \frac{\cos\left\{ \alpha + \left( \frac{n - 1}{2} \right)\beta \right\}\sin\left( \frac{n\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)} \text{ 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:
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/1)(1+ 1/2)(1+ 1/3)...(1+ 1/n) = (n + 1)`
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: n (n + 1) (n + 5) is a multiple of 3.
Prove the following by using the principle of mathematical induction for all n ∈ N: 102n – 1 + 1 is divisible by 11
If P (n) is the statement "n3 + n is divisible by 3", prove that P (3) is true but P (4) is not true.
If P (n) is the statement "n2 + n is even", and if P (r) is true, then P (r + 1) is true.
12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .
\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\]
1.2 + 2.3 + 3.4 + ... + n (n + 1) = \[\frac{n(n + 1)(n + 2)}{3}\]
Prove that 1 + 2 + 22 + ... + 2n = 2n+1 - 1 for all n \[\in\] 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.
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 .
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:
`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:
(23n − 1) is divisible by 7
Answer the following:
Prove, by method of induction, for all n ∈ N
8 + 17 + 26 + … + (9n – 1) = `"n"/2(9"n" + 7)`
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:
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
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
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.
Prove by the Principle of Mathematical Induction that 1 × 1! + 2 × 2! + 3 × 3! + ... + n × n! = (n + 1)! – 1 for all natural numbers n.
Show by the Principle of Mathematical Induction that the sum Sn of the n term of the series 12 + 2 × 22 + 32 + 2 × 42 + 52 + 2 × 62 ... is given by
Sn = `{{:((n(n + 1)^2)/2",", "if n is even"),((n^2(n + 1))/2",", "if n is odd"):}`
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, 7n – 2n is divisible by 5.
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.
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.
Consider the statement: “P(n) : n2 – n + 41 is prime." Then which one of the following is true?
By using principle of mathematical induction for every natural number, (ab)n = ______.
