Hi, problem is for any n >= 2, 1/n+1 + 1/n+2 + 1/n+3 + ... + 1/2n > 13/24 . I am having trouble putting into summation notation which is required first and then beginning. Help is appreciated, thanks

Printable View

- October 11th 2010, 04:49 PMkanoroHelp with induction problem (inequality)
Hi, problem is for any n >= 2, 1/n+1 + 1/n+2 + 1/n+3 + ... + 1/2n > 13/24 . I am having trouble putting into summation notation which is required first and then beginning. Help is appreciated, thanks

- October 11th 2010, 05:08 PMArchie Meade
- October 11th 2010, 05:10 PMraphw
Might not be a big thing, but do not forget to show that it is true for a specific n e.g. n = 2.

- October 11th 2010, 05:37 PMkanoro
I understand it all, but when I am proving the initial case for n = 2, what value will the m be to make the inequality true?

- October 11th 2010, 05:41 PMArchie Meade
- October 11th 2010, 05:43 PMraphw
m is your index number for the sum. Thus m takes any value between 1 and n. The basic idea of Sigma ( ) is by example:

Just fill in values similarily- - October 11th 2010, 05:51 PMArchie Meade
I forgot to answer the rest of this....

it isn't a matter of certain values of "m" making the inequality true.

You simply sum all the fractions (increasing m by 1 in each fraction) until m reaches n (not necessary when proving by induction).

For all n greater than or equal to 2, your sum ought to be greater than 13/24. - October 11th 2010, 05:57 PMkanoro
I'm working on solving the inequality but I am a little stuck.. I have the 1 / k + 1 + m > 13/24 and I understand the operations that can be applied to inequalities while maintaining to hold their values. Any clues on how to approach this?

- October 11th 2010, 06:18 PMraphw
Note that:

Now you should be able to solve. - October 11th 2010, 06:47 PMkanoro
Hmm, I am not seeing where this helps. Lost me there.

- October 11th 2010, 06:49 PMArchie Meade
- October 11th 2010, 07:08 PMkanoro
So then I get summation as m=1 goes to k, 1/m+k - 8k+5 / ( 2k+2)(2k+1) . So how do I prove that they sum >0

- October 11th 2010, 07:37 PMkanoro
In general still confused where to take this, textbook I am working out offers little help so any help to finish the question is much appreciated.

- October 11th 2010, 07:50 PMraphw
The general idea of induction is as follows: (1) I show that something is true for a specific value of n, e.g. n=2. Then (2) I assume that this same statement is true for any n and (3) I show that it is then true for n+1. It follows that it must be true for any value since I can start by e.g. n=2 => true for n+1 = 3 => true for n+2 = 4 => ...

So we showed that it is true for n=2 already. Now we assume that it is true for

Thus we can solve

Thus:

and we completed our proof by induction since we can now construct any n as shown above.

This last step is true if and only if This is all that is left to show to finish the proof. To do so, simply get a common denominator. If both numerator and denominator of the new, "merged" term are positive, you are done. - October 11th 2010, 11:33 PMDefunkt