मराठी

1 + 3 + 32 + ... + 3n−1 = 3 N − 1 2

Advertisements
Advertisements

प्रश्न

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

 
Advertisements

उत्तर

Let P(n) be the given statement.
Now,

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

\[\text{ Step 1} : \]

\[P(1) = 1 = \frac{3^1 - 1}{2} = \frac{2}{2} = 1\]

\[\text{ Hence, P(1) is true } . \]

\[\text{ Step 2:}  \]

\[\text{ Let P(m) is true .}  \]

\[\text{ Then } , \]

\[1 + 3 + 3^2 + . . . + 3^{m - 1} = \frac{3^m - 1}{2}\]

\[\text{ We shall prove that P(m + 1) is true }  . \]

\[\text{ That is, }  \]

\[1 + 3 + 3^2 + . . . + 3^m = \frac{3^{m + 1} - 1}{2}\]

\[\text{ Now, we have: }  \]

\[1 + 3 + 3^2 + . . . + 3^{m - 1} = \frac{3^m - 1}{2}\]

\[ \Rightarrow 1 + 3 + 3^2 + . . . + 3^{m - 1} + 3^m = \frac{3^m - 1}{2} + 3^m \left[ \text{ Adding } 3^m \text{ to both sides } \right]\]

\[ \Rightarrow 1 + 3 + 3^2 + . . . + 3^m = \frac{3^m - 1 + 2 \times 3^m}{2} = \frac{3^m (1 + 2) - 1}{2} = \frac{3^{m + 1} - 1}{2}\]

\[\text{ Hence, P(m + 1) is true }  . \]

\[\text{ By the principle of mathematical induction, P(n) is true for all n }  \in N .\]

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 12: Mathematical Induction - Exercise 12.2 [पृष्ठ २७]

APPEARS IN

आर.डी. शर्मा Mathematics [English] Class 11
पाठ 12 Mathematical Induction
Exercise 12.2 | Q 3 | पृष्ठ २७

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

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

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.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+ 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 ∈ Nn (n + 1) (n + 5) is a multiple of 3.


Prove the following by using the principle of mathematical induction for all n ∈ N: 41n – 14n is a multiple of 27.


If P (n) is the statement "n(n + 1) is even", then what is P(3)?


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.


12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .

 

1.3 + 2.4 + 3.5 + ... + n. (n + 2) = \[\frac{1}{6}n(n + 1)(2n + 7)\]

 

\[\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)\]

 

a + ar + ar2 + ... + arn−1 =  \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]

 

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

 

\[\text{ Prove that } \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 .\]

 


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

 


\[\text{ A sequence } x_0 , x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_0 = 5 and x_k = 4 + x_{k - 1}\text{  for all natural number k . } \]
\[\text{ Show that } x_n = 5 + 4n \text{ for all n }  \in N \text{ using mathematical induction .} \]


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

2 + 4 + 6 + ..... + 2n = n (n+1)


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 + 3.5 + 5.7 + ..... to n terms = `"n"/3(4"n"^2 + 6"n" - 1)`


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:

3n − 2n − 1 is divisible by 4


Answer the following:

Given that tn+1 = 5tn − 8, t1 = 3, prove by method of induction that tn = 5n−1 + 2


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

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


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


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


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


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.


Consider the statement: “P(n) : n2 – n + 41 is prime." Then which one of the following is true?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×