मराठी

1.3 + 2.4 + 3.5 + ... + N. (N + 2) = 1 6 N ( N + 1 ) ( 2 N + 7 ) - Mathematics

Advertisements
Advertisements

प्रश्न

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

 
Advertisements

उत्तर

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

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

\[\text{ Step } 1: \]

\[P(1) = 1 . 3 = 3 = \frac{1}{6} \times 1(1 + 1)(2 \times 1 + 7)\]

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

\[\text{ Step 2:}  \]

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

\[\text{ Then, } \]

\[1 . 3 + 2 . 4 + . . . + m . (m + 2) = \frac{1}{6}m(m + 1)(2m + 7)\]

\[\text{ To prove: P(m + 1) is true . } \]

\[\text{ That is, } \]

\[1 . 3 + 2 . 4 + . . . + (m + 1)(m + 3) = \frac{1}{6}(m + 1)(m + 2)(2m + 9)\]

\[P(m) \text{ is equal to }  1 . 3 + 2 . 4 + . . . + m(m + 2) = \frac{1}{6}m(m + 1)(2m + 7) . \]

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

\[1 . 3 + 2 . 4 + . . . + m(m + 2) + (m + 1)(m + 3) = \frac{1}{6}m(m + 1)(2m + 7) + (m + 1)(m + 3) \left[ \text{ Adding } (m + 1)(m + 3)\text{  to both sides } \right]\]

\[ \Rightarrow 1 . 3 + 2 . 4 + . . . + (m + 1)(m + 3) = \frac{1}{6}(m + 1)\left[ 2 m^2 + 7m + 6m + 18 \right]\]

\[ = \frac{1}{6}(m + 1)(2 m^2 + 13m + 18)\]

\[ = \frac{1}{6}(m + 1)(2m + 9)(m + 2)\]

\[\text{ Thus, 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 12 | पृष्ठ २७

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

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

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

1.2 + 2.3 + 3.4+ ... + n(n+1) = `[(n(n+1)(n+2))/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 + 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/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

`1/3.5 + 1/5.7 + 1/7.9 + ...+ 1/((2n + 1)(2n +3)) = n/(3(2n +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.


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


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

 

72n + 23n−3. 3n−1 is divisible by 25 for all n ∈ N.

 

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


11n+2 + 122n+1 is divisible by 133 for all n ∈ N.

 

Prove that 1 + 2 + 22 + ... + 2n = 2n+1 - 1 for all \[\in\] N .

 

7 + 77 + 777 + ... + 777 \[{. . . . . . . . . . .}_{n - \text{ digits } } 7 = \frac{7}{81}( {10}^{n + 1} - 9n - 10)\]

 

\[\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{1}{2}\tan\left( \frac{x}{2} \right) + \frac{1}{4}\tan\left( \frac{x}{4} \right) + . . . + \frac{1}{2^n}\tan\left( \frac{x}{2^n} \right) = \frac{1}{2^n}\cot\left( \frac{x}{2^n} \right) - \cot x\] for all n ∈ and  \[0 < x < \frac{\pi}{2}\]

 


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

 


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

12 + 32 + 52 + .... + (2n − 1)2 = `"n"/3 (2"n" − 1)(2"n" + 1)`


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, 2),(0, 1)]^"n" = [(1, 2"n"),(0, 1)]` ∀ n ∈ N


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


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


Give an example of a statement P(n) which is true for all n. Justify your answer. 


Prove the statement by using the Principle of Mathematical Induction:

n3 – 7n + 3 is divisible by 3, for all natural numbers 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:

1 + 5 + 9 + ... + (4n – 3) = n(2n – 1) for all natural numbers n.


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


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


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


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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×