Solved

mathematic problem

Posted on 2013-05-15
3
430 Views
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
1
Comment
Question by:user_n
[X]
Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

  • Help others & share knowledge
  • Earn cash & points
  • Learn & ask questions
  • 2
3 Comments
 
LVL 32

Accepted Solution

by:
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
0
 
LVL 9

Author Comment

by:user_n
ID: 39167836
Thank you very much
0
 
LVL 32

Expert Comment

by:phoffric
ID: 39167892
You're welcome
0

Featured Post

Industry Leaders: 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…
Have you ever thought of installing a power system that generates solar electricity to power your house? Some may say yes, while others may tell me no. But have you noticed that people around you are now considering installing such systems in their …
Learn how to match and substitute tagged data using PHP regular expressions. Demonstrated on Windows 7, but also applies to other operating systems. Demonstrated technique applies to PHP (all versions) and Firefox, but very similar techniques will w…
Finds all prime numbers in a range requested and places them in a public primes() array. I've demostrated a template size of 30 (2 * 3 * 5) but larger templates can be built such 210  (2 * 3 * 5 * 7) or 2310  (2 * 3 * 5 * 7 * 11). The larger templa…
Suggested Courses

626 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