Ask your own question, for FREE!
Mathematics 10 Online
OpenStudy (anonymous):

How do I prove that, for example \[e^\pi > \pi^e\]

OpenStudy (fibonaccichick666):

if you take the natural log of both sides you can get something that should be easier to solve

OpenStudy (anonymous):

Well it's not that I want to "solve it", since it's just real numbers. I want to give a proof for why the above statement is true. And to secure the integrity of the proof, of course I cannot use what I want to proof as an assumption, as that would simply lead me to believe it is true in any case, even if it should be wrong.

OpenStudy (fibonaccichick666):

ahh ok then I'd generalize it do \(e^n>n^e\) and test for n=e, n>e, and n<e

OpenStudy (fibonaccichick666):

then compare graphs maybe, or start with something that is trivially true and flow into this

OpenStudy (fibonaccichick666):

Not sure, for my classes I was allowed a direct pf on this one

OpenStudy (anonymous):

I'd love to start off with something trivially true and "flow" into this. In such a case, though, my problem is that I don't know what that trival part would be.

OpenStudy (fibonaccichick666):

idk I'll think on it gtg to class

OpenStudy (john_es):

You can try a serial expansion (McLaurin series) of both sides as if they were functions, until first order. Then compare.

OpenStudy (john_es):

Better look here, http://answers.yahoo.com/question/index?qid=20110103144014AAaEFMk

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!