मराठी

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 = ,if n is even,if n is odd{n(n+1)22, if n

Advertisements
Advertisements

प्रश्न

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"):}`

बेरीज
Advertisements

उत्तर

Here P(n): Sn = `{{:((n(n + 1)^2)/2",",  "when n is even"),((n^2(n + 1))/2",",  "when n is odd"):}`

Also, note that any term Tn of the series is given by

Tn = `{{:(n^2, "if n is odd"),(2n^2, "if n is even"):}`

We observe that P(1) is true.

Since P(1): S1 = 12

= 1

= `(1.2)/2`

= `(1^2.(1 + 1))/2`

Assume that P(k) is true for some natural number k, i.e.

Case 1: When k is odd, then k + 1 is even.

We have P(k + 1) : Sk + 1 = 12 + 2 × 22 + ... + k2 + 2 × (k + 1)2

= `(k^2(k + 1))/2 + 2 xx (k + 1)^2`

= `((k + 1))/2 [k^2 + 4(k + 1)]`  .....(As k is odd, 12 + 2 × 22 + ... + k2 = `k^2 ((k + 1))/2`)

= `(k + 1)/2 [k^2 + 4k + 4]`

= `(k + 1)/2 (k + 2)^2`

= `(k + 1) ([(k + 1) + 1]^2)/2`

So P(k + 1) is true.

Whenever P(k) is true in the case when k is odd.

Case 2: When k is even, then k + 1 is odd.

Now, P(k + 1): 12 + 2 × 22 + ... + 2.k2 + (k + 1)2

= `(k(k + 1)^2)/2 + (k + 1)^2`  ......(As k is even, 12 + 2 × 22 + ... + 2k2 = `k(k + 1)^2/2`)

= `((k + 1)^2 (k + 2))/2`

= `((k + 1)^2 ((k + 1) + 1))/2`

Therefore, P(k + 1) is true.

Whenever P(k) is true for the case when k is even.

Thus, P(k + 1) is true.

Whenever, P(k) is true for any natural numbers k.

Hence, P(n) true for all natural numbers.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 4: Principle of Mathematical Induction - Solved Examples [पृष्ठ ६७]

APPEARS IN

एनसीईआरटी एक्झांप्लर Mathematics Exemplar [English] Class 11
पाठ 4 Principle of Mathematical Induction
Solved Examples | Q 10 | पृष्ठ ६७

व्हिडिओ ट्यूटोरियलVIEW ALL [1]

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

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

1.3 + 2.3^3 + 3.3^3  +...+ n.3^n = `((2n -1)3^(n+1) + 3)/4`

Prove the following by using the principle of mathematical induction for all n ∈ N

`1^2 + 3^2 + 5^2 + ... + (2n -1)^2 = (n(2n - 1) (2n + 1))/3`

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: 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.


Prove the following by using the principle of mathematical induction for all n ∈ N (2+7) < (n + 3)2


If P (n) is the statement "n2 − n + 41 is prime", prove that P (1), P (2) and P (3) are true. Prove also that P (41) is not true.


1 + 3 + 32 + ... + 3n−1 = \[\frac{3^n - 1}{2}\]

 

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

 


1.2 + 2.3 + 3.4 + ... + n (n + 1) = \[\frac{n(n + 1)(n + 2)}{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)\]

 

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


(ab)n = anbn for all n ∈ N. 

 

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


\[1 + \frac{1}{4} + \frac{1}{9} + \frac{1}{16} + . . . + \frac{1}{n^2} < 2 - \frac{1}{n}\] for all n ≥ 2, n ∈ 

 


\[\text{ Prove that }  \frac{1}{n + 1} + \frac{1}{n + 2} + . . . + \frac{1}{2n} > \frac{13}{24}, \text{ for all natural numbers } n > 1 .\]

 


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

 


\[\text{ Using principle of mathematical induction, prove that } \sqrt{n} < \frac{1}{\sqrt{1}} + \frac{1}{\sqrt{2}} + \frac{1}{\sqrt{3}} + . . . + \frac{1}{\sqrt{n}} \text{ for all natural numbers } n \geq 2 .\]

 


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:

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


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

Given that tn+1 = 5tn + 4, t1 = 4, prove that tn = 5n − 1


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:

2n + 1 < 2n, for all natual numbers n ≥ 3.


Define the sequence a1, a2, a3 ... as follows:
a1 = 2, an = 5 an–1, for all natural numbers n ≥ 2.

Use the Principle of Mathematical Induction to show that the terms of the sequence satisfy the formula an = 2.5n–1 for all natural numbers.


Prove by the Principle of Mathematical Induction that 1 × 1! + 2 × 2! + 3 × 3! + ... + n × n! = (n + 1)! – 1 for all natural numbers n.


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


Prove the statement by using the Principle of Mathematical Induction:

4n – 1 is divisible by 3, for each natural number n.


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:

2n < (n + 2)! for all natural number n.


Prove that, cosθ cos2θ cos22θ ... cos2n–1θ = `(sin 2^n theta)/(2^n sin theta)`, for all n ∈ N.


Prove that number of subsets of a set containing n distinct elements is 2n, for all n ∈ N.


If P(n): 2n < n!, n ∈ N, then P(n) is true for all n ≥ ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×