mathematic problem

Posted on 2013-05-15
1 Endorsement
Last Modified: 2013-05-15
How to prove that for n > 2  
n to degree of n+1 is larger than (n+1) to degree of n
Question by:user_n
  • 2
LVL 32

Accepted Solution

phoffric earned 500 total points
ID: 39167793
If n^(n+1) > (n+1)^n
then by dividing RHS ==>
n^(n+1) / (n+1)^n > 1 ==>
n * n^n / (n+1)^n > 1 ==>
n * [ n/(n+1)]^n > 1 ==>
n * [1/(1+1/n)]^n  > 1 ==>
n / (1 + 1/n)^n > 1
and for n > 2, then (1+1/n) < 2
so it is true that n / (1 + 1/n)^n > 1

Working backwards with this last fact, you find that n^(n+1) > (n+1)^n

Author Comment

ID: 39167836
Thank you very much
LVL 32

Expert Comment

ID: 39167892
You're welcome

Featured Post

Technology Partners: We Want Your Opinion!

We value your feedback.

Take our survey and automatically be enter to win anyone of the following:
Yeti Cooler, Amazon eGift Card, and Movie eGift Card!

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Whatever be the reason, if you are working on web development side,  you will need day-today validation codes like email validation, date validation , IP address validation, phone validation on any of the edit page or say at the time of registration…
How to Win a Jar of Candy Corn: A Scientific Approach! I love mathematics. If you love mathematics also, you may enjoy this tip on how to use math to win your own jar of candy corn and to impress your friends. As I said, I love math, but I gu…
This is a video describing the growing solar energy use in Utah. This is a topic that greatly interests me and so I decided to produce a video about it.
Although Jacob Bernoulli (1654-1705) has been credited as the creator of "Binomial Distribution Table", Gottfried Leibniz (1646-1716) did his dissertation on the subject in 1666; Leibniz you may recall is the co-inventor of "Calculus" and beat Isaac…

680 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question