Prove Ineq. for Natural n > 1: 1/n+1 + ... + 1/2n > 13/24

  • Thread starter Thread starter songoku
  • Start date Start date
  • Tags Tags
    Inequality
AI Thread Summary
The discussion focuses on proving the inequality that for any natural number n > 1, the sum of the series from 1/(n+1) to 1/(2n) is greater than 13/24. Participants suggest using mathematical induction as a method for proof, starting with base cases like n = 2 or n = 3. They outline the induction hypothesis and demonstrate how to extend the proof to n = k + 1. A key point is that the function f(n), representing the sum, is shown to be increasing, which supports the validity of the inequality. The conversation concludes with participants confirming the correctness of their approaches.
songoku
Messages
2,474
Reaction score
388

Homework Statement


Prove that for any naturam number n > 1 :
\frac{1}{n+1} + \frac{1}{n+2} + \frac{1}{n+3} + ... + \frac{1}{2n} > \frac{13}{24}

Homework Equations


Not sure

The Attempt at a Solution


\frac{1}{n+1} + \frac{1}{n+2} + \frac{1}{n+3} + ... + \frac{1}{2n} > \frac{1}{2n} + \frac{1}{2n} + \frac{1}{2n} + ... + \frac{1}{2n} = \frac{n}{2n} = \frac{1}{2}

Then I stuck...

Thanks
 
Physics news on Phys.org
I'm not sure what approach your instructor had in mind in setting the problem, but unless I'm mistaken, we can actually prove a stronger inequality bound.

If we define
f(n) = \frac{1}{n+1} + \frac{1}{n+2} + \cdots + \frac{1}{2n},
then it is relatively straightforward to show that ##f(n+1) > f(n) \,\, \forall \,\, n##, and so it must be the case that ##f(n) \geq f(2)##.

It is also possible to prove that ##\lim_{n \to \infty} f(n) = \ln 2## as an interesting exercise.
 
  • Like
Likes Buffu and ehild
songoku said:

Homework Statement


Prove that for any naturam number n > 1 :
\frac{1}{n+1} + \frac{1}{n+2} + \frac{1}{n+3} + ... + \frac{1}{2n} > \frac{13}{24}

Homework Equations


Not sure

The Attempt at a Solution


\frac{1}{n+1} + \frac{1}{n+2} + \frac{1}{n+3} + ... + \frac{1}{2n} > \frac{1}{2n} + \frac{1}{2n} + \frac{1}{2n} + ... + \frac{1}{2n} = \frac{n}{2n} = \frac{1}{2}

Then I stuck...

Thanks
You can do this by mathematical induction, which might be the strategy your instructor had in mind.
Proving a base case with n = 2 or n = 3 is straightforward.
Then, assume that the proposition is true for n = k; i.e., that ##\frac 1 {k + 1} + \frac 1 {k + 2} + \dots + \frac 1 {2k} > \frac {13} {24}## (the induction hypothesis).
Finally, use the induction hypothesis to show that ##\frac 1 {k + 2} + \frac 1 {k + 3} + \dots + \frac 1 {2k} + \frac 1 {2k + 1} + \frac 1 {2k + 2} > \frac {13} {24}## must be true, as well.
 
Mark44 said:
You can do this by mathematical induction, which might be the strategy your instructor had in mind.
Proving a base case with n = 2 or n = 3 is straightforward.
Then, assume that the proposition is true for n = k; i.e., that ##\frac 1 {k + 1} + \frac 1 {k + 2} + \dots + \frac 1 {2k} > \frac {13} {24}## (the induction hypothesis).
Finally, use the induction hypothesis to show that ##\frac 1 {k + 2} + \frac 1 {k + 3} + \dots + \frac 1 {2k} + \frac 1 {2k + 1} + \frac 1 {2k + 2} > \frac {13} {24}## must be true, as well.

Let me try:
(i) For n = 2
1/3 + 1/4 = 7/12 = 14/24 > 13/24 so it is true for n = 2

(ii) Assume it is true for n = k
##\frac 1 {k + 1} + \frac 1 {k + 2} + \dots + \frac 1 {2k} > \frac {13} {24}##

(iii) For n = k + 1
##\frac 1 {k + 2} + \frac 1 {k + 3} + \dots + \frac 1 {2k} + \frac 1 {2k + 1} + \frac 1 {2k + 2}##

## = \frac 1 {k + 1} + \frac 1 {k + 2} + \frac 1 {k + 3} + \dots + \frac 1 {2k} + \frac 1 {2k + 1} + \frac 1 {2k + 2} - \frac 1 {k + 1}##

## > \frac {13} {24} + \frac 1 {(2k + 1) (2k + 2)} > \frac {13} {24}##

Is this correct?
 
songoku said:
Let me try:
(i) For n = 2
1/3 + 1/4 = 7/12 = 14/24 > 13/24 so it is true for n = 2

(ii) Assume it is true for n = k
##\frac 1 {k + 1} + \frac 1 {k + 2} + \dots + \frac 1 {2k} > \frac {13} {24}##

(iii) For n = k + 1
##\frac 1 {k + 2} + \frac 1 {k + 3} + \dots + \frac 1 {2k} + \frac 1 {2k + 1} + \frac 1 {2k + 2}##

## = \frac 1 {k + 1} + \frac 1 {k + 2} + \frac 1 {k + 3} + \dots + \frac 1 {2k} + \frac 1 {2k + 1} + \frac 1 {2k + 2} - \frac 1 {k + 1}##

## > \frac {13} {24} + \frac 1 {(2k + 1) (2k + 2)} > \frac {13} {24}##

Is this correct?
Looks good.
 
  • Like
Likes songoku
Sorry for late reply

Thank you very much
 
I tried to combine those 2 formulas but it didn't work. I tried using another case where there are 2 red balls and 2 blue balls only so when combining the formula I got ##\frac{(4-1)!}{2!2!}=\frac{3}{2}## which does not make sense. Is there any formula to calculate cyclic permutation of identical objects or I have to do it by listing all the possibilities? Thanks
Since ##px^9+q## is the factor, then ##x^9=\frac{-q}{p}## will be one of the roots. Let ##f(x)=27x^{18}+bx^9+70##, then: $$27\left(\frac{-q}{p}\right)^2+b\left(\frac{-q}{p}\right)+70=0$$ $$b=27 \frac{q}{p}+70 \frac{p}{q}$$ $$b=\frac{27q^2+70p^2}{pq}$$ From this expression, it looks like there is no greatest value of ##b## because increasing the value of ##p## and ##q## will also increase the value of ##b##. How to find the greatest value of ##b##? Thanks
Back
Top