Hi,
I was looking at a math book when I stumbled across a problem:
I am a little puzzled. How would I prove it? Using proof by counterexample?Quote:
Prove the following:
given
![]()
Thanks!
Printable View
Hi,
I was looking at a math book when I stumbled across a problem:
I am a little puzzled. How would I prove it? Using proof by counterexample?Quote:
Prove the following:
given
![]()
Thanks!
You can prove this using derivatives...
Okay... Is it possible without derivatives?
Why would you want a different method?
First note thatfor all
, while
for all
. So
for all
.
Then note thatand
.
For, we have
So that meansgrows slower than
does, so can never catch up.
Thereforefor all
.
Okay, that makes sense... So we can use growth rates of functions to determine which is the largest in the end.
Use a contradiction: suppose not, that meansthat would imply
but this is obviously false since