हिंदी

Prove that 1 N + 1 + 1 N + 2 + . . . + 1 2 N > 13 24 , for All Natural Numbers N > 1

Advertisements
Advertisements

प्रश्न

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

 

Advertisements

उत्तर

\[\text{ Let p} \left( n \right): \frac{1}{n + 1} + \frac{1}{n + 2} + . . . + \frac{1}{2n} > \frac{13}{24}, \text{ for all natural numbers } n > 1 . \]
\[\text{ Step I: For n }  = 2, \]
\[LHS = \frac{1}{2 + 1} + \frac{1}{2 \times 2} = \frac{1}{3} + \frac{1}{4} = \frac{7}{12} = \frac{14}{24} > \frac{13}{24} = RHS\]
\[As, LHS > RHS\]
\[\text{ So, it is true for n } = 2 . \]
\[\text{ Step II: For n }  = k, \]
\[\text{ Let } p\left( k \right): \frac{1}{k + 1} + \frac{1}{k + 2} + . . . + \frac{1}{2k} > \frac{13}{24}, \text{ be true for some natural numbers }  k > 1 . \]
\[\text{ Step III: For n } = k + 1, \]
\[p\left( k + 1 \right) = \frac{1}{k + 1} + \frac{1}{k + 2} + . . . + \frac{1}{2k} + \frac{1}{2k + 1}\]
\[ > \frac{13}{24} + \frac{1}{2k + 1} \left( \text{ Using step } II \right)\]
\[ > \frac{13}{24}\]
\[i . e . p\left( k + 1 \right) > \frac{13}{24}\]
\[\text{ So, it is also true for n }  = k + 1 . \]
\[\text{ Hence,}  p\left( n \right): \frac{1}{n + 1} + \frac{1}{n + 2} + . . . + \frac{1}{2n} > \frac{13}{24}, \text{ for all natural numbers}  n > 1 .\]

 

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 12: Mathematical Induction - Exercise 12.2 [पृष्ठ २९]

APPEARS IN

आर.डी. शर्मा Mathematics [English] Class 11
अध्याय 12 Mathematical Induction
Exercise 12.2 | Q 41 | पृष्ठ २९

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

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

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 ∈ Nx2n – y2n is divisible by x y.


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


If P (n) is the statement "2n ≥ 3n" and if P (r) is true, prove that P (r + 1) is true.

 

If P (n) is the statement "n2 + n is even", and if P (r) is true, then P (r + 1) is true.

 

1 + 2 + 3 + ... + n =  \[\frac{n(n + 1)}{2}\] i.e. the sum of the first n natural numbers is \[\frac{n(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}\]

 


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


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


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

 

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

 

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

 

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.


Prove that n3 - 7+ 3 is divisible by 3 for all n \[\in\] N .

  

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

 

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


x2n−1 + y2n−1 is divisible by x + y 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{ 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:

3 + 7 + 11 + ..... + to n terms = n(2n+1)


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


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

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


Answer the following:

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

8 + 17 + 26 + … + (9n – 1) = `"n"/2(9"n" + 7)`


Answer the following:

Prove by method of induction

`[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 1)], ∀  "n" ∈ "N"`


Answer the following:

Prove by method of induction 152n–1 + 1 is divisible by 16, for all n ∈ N.


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.


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


For all n ∈ N, 3.52n+1 + 23n+1 is divisible by ______.


If xn – 1 is divisible by x – k, then the least positive integral value of k is ______.


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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×