Inequality Proof Homework: Proving 2^k+1 $\geq$ 1/2

  • Thread starter Thread starter jeff1evesque
  • Start date Start date
  • Tags Tags
    Inequality Proof
Click For Summary

Homework Help Overview

The discussion revolves around proving the inequality involving a series of terms of the form \(\frac{1}{2^k + 2^i}\) for \(i\) ranging from 0 to \(k\). The original poster attempts to establish a proof for the induction step \(k+1\) in a larger context.

Discussion Character

  • Exploratory, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • Participants explore the structure of the series and question the number of terms involved. There are hints suggesting that the last term in the series is smaller than the others, and some participants express uncertainty about how to formulate a proof based on this observation.

Discussion Status

Participants are actively engaging with the problem, offering hints and questioning assumptions. There is recognition of the relationship between the terms, but no consensus on a clear path to a proof has been reached yet.

Contextual Notes

There is some confusion regarding the number of terms in the series, with differing counts being suggested. The original poster also reflects on a previous problem that may relate to this one, indicating a potential overlap in understanding.

jeff1evesque
Messages
312
Reaction score
0

Homework Statement


\frac{1}{2^{k}+1} + \frac{1}{2^{k} +2} + ... + \frac{1}{2^k + 2^k} \geq \frac{1}{2}
2. The attempt at a solution
Not too sure, I am working on a larger proof (not too much difficult) and the above is my attempt to prove the induction step k+1 (since \frac{1}{2^k + 2^k} = \frac{1}{2^{k+1}}).

Should i try to factor out \frac{1}{2^k}?
 
Physics news on Phys.org
Hi jeff! :smile:

Hint: they're all greater than the last one. :wink:
 
tiny-tim said:
Hi jeff! :smile:

Hint: they're all greater than the last one. :wink:

I still don't see it, i wish it were clear to me.

Thanks though,

Jeffrey Levesque
 
jeff1evesque said:
I still don't see it, i wish it were clear to me.

Thanks though,

Jeffrey Levesque

If a < b < c
a + a + a < a + b + c

Right?

Try something along those lines.
 
jeff1evesque said:
I still don't see it, i wish it were clear to me.

Thanks though,

Jeffrey Levesque

Don't you agree with tiny-tim that the last term in the sum is smaller than the rest? How many terms in the sequence are there?
 
Dick said:
Don't you agree with tiny-tim that the last term in the sum is smaller than the rest? How many terms in the sequence are there?

Yes I agree, but that isn't helping me at all- I just don't know how to formulate a proof for this.
 
There are 2^{k+1} terms
 
jeff1evesque said:
There are 2^{k+1} terms

Are you sure? Count again. : )
 
l'Hôpital said:
Are you sure? Count again. : )

2^k terms.
 
  • #10
never minnd, I actually did this in a different problem- thanks everyone
 
  • #11
I also noticed that the last term on the LHS is the smallest, but I was confused for awhile since I thought the denominators were 2^k + 2^0, 2^k + 2^1, ..., 2^k + 2^k, in which case there are k+1 terms, and the estimate fails.

Anyways assuming the progression is what everyone else thinks it is, then basically 2^i \leq 2^k for i = 1, 2, ..., k so
2^k + 2^i \leq 2^k + 2^k = 2^{k+1} \Rightarrow \frac{1}{2^k + 2^i} \geq \frac{1}{2^{k+1}}
for i = 1, 2, ..., k.
 

Similar threads

Replies
12
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
9
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
8
Views
1K
  • · Replies 16 ·
Replies
16
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K