हिंदी

Prove by method of induction, for all n ∈ N: (cos θ + i sin θ)n = cos (nθ) + i sin (nθ) - Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

Prove by method of induction, for all n ∈ N:

(cos θ + i sin θ)n = cos (nθ) + i sin (nθ)

योग

उत्तर

Let P(n) ≡ (cos θ + i sin θ)n = cos nθ + i sin nθ, for all n  ∈ N.

Step 1:

For n = 1, L.H.S. = cos θ + i sin θ

R.H.S. = cos θ + i sin θ

∴ L.H.S. = R.H.S. 

∴ P(1) is true.

Step 2:

Let us assume that for some k ∈ N, P(k) is true,

i.e., (cos θ + i sin θ)k = cos kθ + i sin kθ    ...(1)

Step 3: To prove that P(k + 1) is true,

i.e., to prove that

(cos θ + i sin θ)k+1 = cos (k + 1)(θ + i sin (k + 1) θ

L.H.S. = (cos θ + i sin θ)k+1

= (cos θ + i sin θ)k · (cos θ + i sin θ)

= (cos kθ + i sin kθ) · (cos θ + i sin θ)    ...[By (1)]

= cos kθ · cos θ + i cos kθ sin θ + i sin kθ cos θ + i2 sin kθ sin θ

= (cos kθ cos θ – sin kθ sin θ) + i(sin kθ cos θ + cos kθ sin θ)  ......[as i2 = – 1]

= cos(kθ + 0) + i sin (kθ + θ)

= cos (k + 1)θ + i sin(k + 1)θ

= R.H.S.

∴ P(k + 1) is true.

Step 4:

From all the above steps and by the principle of mathematical induction, P(n) is true for all n ∈ N,

i.e., (cos θ + i sin θ)n = cos nθ + i sin nθ. for all n ∈ N

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 4: Methods of Induction and Binomial Theorem - Exercise 4.1 [पृष्ठ ७४]

APPEARS IN

बालभारती Mathematics and Statistics 2 (Arts and Science) [English] 11 Standard Maharashtra State Board
अध्याय 4 Methods of Induction and Binomial Theorem
Exercise 4.1 | Q 14 | पृष्ठ ७४

संबंधित प्रश्न

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.5 + 1/5.8 + 1/8.11 + ... + 1/((3n - 1)(3n + 2)) = n/(6n + 4)`

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))`


\[\frac{1}{1 . 2} + \frac{1}{2 . 3} + \frac{1}{3 . 4} + . . . + \frac{1}{n(n + 1)} = \frac{n}{n + 1}\]


\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]

 


\[\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]


52n −1 is divisible by 24 for all n ∈ N.


\[\frac{n^{11}}{11} + \frac{n^5}{5} + \frac{n^3}{3} + \frac{62}{165}n\] is a positive integer for all n ∈ N

 


\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\]  for all n ∈ N .


\[\sin x + \sin 3x + . . . + \sin (2n - 1)x = \frac{\sin^2 nx}{\sin x}\]

 


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 .\]


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:

12 + 22 + 32 + .... + n2 = `("n"("n" + 1)(2"n" + 1))/6`


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:

5 + 52 + 53 + .... + 5n = `5/4(5^"n" - 1)`


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:

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 152n–1 + 1 is divisible by 16, for all 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 ______.


Prove the statement by using the Principle of Mathematical Induction:

23n – 1 is divisible by 7, for all natural numbers n.


Prove the statement by using the Principle of Mathematical Induction:

32n – 1 is divisible by 8, for all natural numbers n.


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:

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.


A sequence d1, d2, d3 ... is defined by letting d1 = 2 and dk = `(d_(k - 1))/"k"` for all natural numbers, k ≥ 2. Show that dn = `2/(n!)` for all n ∈ 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, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin  ((n + 1))/2 theta)/(sin  theta/2)`, for all n ∈ N.


Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×