मराठी

Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that: 1 + 3 + 5 + ... + (2n – 1) = n2

Advertisements
Advertisements

प्रश्न

Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:

1 + 3 + 5 + ... + (2n – 1) = n2 

बेरीज
Advertisements

उत्तर

Let the given statement P(n) be defined as P(n) : 1 + 3 + 5 + ... + (2n – 1) = n2, for n ∈ N.

Note that P(1) is true

Since P(1) : 1 = 12

Assume that P(k) is true for some k ∈ N

i.e., P(k) : 1 + 3 + 5 + ... + (2k – 1) = k2

Now, to prove that P(k + 1) is true

We have 1 + 3 + 5 + ... + (2k – 1) + (2k + 1)

= k  + (2k + 1)

= k2 + 2k + 1

= (k + 1)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 n ∈ N.

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

APPEARS IN

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

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

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

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

1.3 + 3.5 + 5.7 + ...+(2n -1)(2n + 1) = `(n(4n^2 + 6n -1))/3`

Prove the following by using the principle of mathematical induction for all n ∈ N: 1.2 + 2.22 + 3.22 + … + n.2n = (n – 1) 2n+1 + 2


Prove the following by using the principle of mathematical induction for all n ∈ N: `1/2 + 1/4 + 1/8 + ... + 1/2^n = 1 - 1/2^n`

 

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 ∈ Nn (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


Prove the following by using the principle of mathematical induction for all n ∈ Nx2n – y2n is divisible by x y.


Prove the following by using the principle of mathematical induction for all n ∈ N: 32n + 2 – 8n– 9 is divisible by 8.


Given an example of a statement P (n) such that it is true for all n ∈ N.

 

1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]

 

12 + 32 + 52 + ... + (2n − 1)2 = \[\frac{1}{3}n(4 n^2 - 1)\]

 

32n+7 is divisible by 8 for all n ∈ N.

 

52n+2 −24n −25 is divisible by 576 for all n ∈ N.

 

2.7n + 3.5n − 5 is divisible by 24 for all n ∈ N.


Given \[a_1 = \frac{1}{2}\left( a_0 + \frac{A}{a_0} \right), a_2 = \frac{1}{2}\left( a_1 + \frac{A}{a_1} \right) \text{ and }  a_{n + 1} = \frac{1}{2}\left( a_n + \frac{A}{a_n} \right)\] for n ≥ 2, where a > 0, A > 0.
Prove that \[\frac{a_n - \sqrt{A}}{a_n + \sqrt{A}} = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right) 2^{n - 1}\]

 

Prove that 1 + 2 + 22 + ... + 2n = 2n+1 - 1 for all \[\in\] 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

 


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

 


x2n−1 + y2n−1 is divisible by x + y for all n ∈ N.

 

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

 


\[\text{ The distributive law from algebra states that for all real numbers}  c, a_1 \text{ and }  a_2 , \text{ we have }  c\left( a_1 + a_2 \right) = c a_1 + c a_2 . \]
\[\text{ Use this law and mathematical induction to prove that, for all natural numbers, } n \geq 2, if c, a_1 , a_2 , . . . , a_n \text{ are any real numbers, then } \]
\[c\left( a_1 + a_2 + . . . + a_n \right) = c a_1 + c a_2 + . . . + c a_n\]


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

13 + 33 + 53 + .... to n terms = n2(2n2 − 1)


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


Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:

22n – 1 is divisible by 3.


Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:

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


The distributive law from algebra says that for all real numbers c, a1 and a2, we have c(a1 + a2) = ca1 + ca2.

Use this law and mathematical induction to prove that, for all natural numbers, n ≥ 2, if c, a1, a2, ..., an are any real numbers, then c(a1 + a2 + ... + an) = ca1 + ca2 + ... + can.


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


Prove by the Principle of Mathematical Induction that 1 × 1! + 2 × 2! + 3 × 3! + ... + n × n! = (n + 1)! – 1 for all natural numbers 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 + 2 + 22 + ... + 2n = 2n+1 – 1 for all natural numbers n.


A sequence b0, b1, b2 ... is defined by letting b0 = 5 and bk = 4 + bk – 1 for all natural numbers k. Show that bn = 5 + 4n for all natural number n using mathematical induction.


Prove that, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin  ((n + 1))/2 theta)/(sin  theta/2)`, for all n ∈ N.


Show that `n^5/5 + n^3/3 + (7n)/15` is a natural number for all n ∈ N.


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


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.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×