Discussion:
<no subject>
(too old to reply)
HGL
2006-11-07 02:53:39 UTC
Permalink
Hello Everyone-- I need a little help proving 2^n > n^2 for all n > 4
Could someone give me some hints to continue after:
2^(k+1) > (k+1)^2
2*2^k > k^2 + 2k + 1

Thanks
William Elliot
2006-11-07 05:05:50 UTC
Permalink
Post by HGL
Hello Everyone-- I need a little help proving 2^n > n^2 for all n > 4
2^(k+1) > (k+1)^2
2*2^k > k^2 + 2k + 1
How fortuitous. I'm a mind reader. You are using induction.
Why are you using induction? Should you be using deduction?

Ok, just to test your psychic skills
2^k + 2^k > k^2 + 2k + 1
Nicholas Sherlock
2006-11-07 06:45:55 UTC
Permalink
Post by HGL
Hello Everyone-- I need a little help proving 2^n > n^2 for all n > 4
2^(k+1) > (k+1)^2
Assuming that you're doing an induction here...

Okay,
(k+1)^2 <= k^2 + 2k + 1
<= 2^k + 2k + 1 (by I.H.)
<= 2^k + 2k + k (since k>=1)
<= 2^k + 3k
<= 2^k + k^2 (since k>=3)
<= 2^k + 2^k (by I.H.)
<= 2^(k+1)

As req'd.

Cheers,
Nicholas Sherlock
--
http://www.sherlocksoftware.org
Noehl
2006-11-07 08:26:36 UTC
Permalink
Post by HGL
Hello Everyone-- I need a little help proving 2^n > n^2 for all n > 4
2^(k+1) > (k+1)^2
2*2^k > k^2 + 2k + 1
Thanks
try applying logarithms to both sides of the inequality
--
Noehl u144241

Games that I like to play

Multiplayer Online Games <http://www.gamestotal.com/>
Strategy Games <http://www.gamestotal.com/>
Unification Wars <http://uc.gamestotal.com/>
Massive Multiplayer Online Games <http://uc.gamestotal.com/>
Galactic Conquest <http://gc.gamestotal.com/>
Strategy Games <http://gc.gamestotal.com/>
Runescape <http://www.stephenyong.com/runescape.htm>
Kings of chaos <http://www.stephenyong.com/kingsofchaos.htm>
William Elliot
2006-11-07 08:54:58 UTC
Permalink
Post by Noehl
Post by HGL
Hello Everyone-- I need a little help proving 2^n > n^2 for all n > 4
2^(k+1) > (k+1)^2
2*2^k > k^2 + 2k + 1
try applying logarithms to both sides of the inequality
n.log 2 > 2.log n

What now?
Noehl
2006-11-13 09:37:26 UTC
Permalink
Post by William Elliot
Post by Noehl
Post by HGL
Hello Everyone-- I need a little help proving 2^n > n^2 for all n > 4
2^(k+1) > (k+1)^2
2*2^k > k^2 + 2k + 1
try applying logarithms to both sides of the inequality
n.log 2 > 2.log n
What now?
prove that

n > 2 (log n)/(log 2)

which will always be true for all n > 4
--
Vempire u144241

Games that I like to play

Multiplayer Online Games <http://www.gamestotal.com/>
Strategy Games <http://www.gamestotal.com/>
Unification Wars <http://uc.gamestotal.com/>
Massive Multiplayer Online Games <http://uc.gamestotal.com/>
Galactic Conquest <http://gc.gamestotal.com/>
Strategy Games <http://gc.gamestotal.com/>
Runescape <http://www.stephenyong.com/runescape.htm>
Kings of chaos <http://www.stephenyong.com/kingsofchaos.htm>
Continue reading on narkive:
Loading...