Still celebrating National IT Professionals Day with 3 months of free Premium Membership. Use Code ITDAY17

x
?
Solved

mathematic problem

Posted on 2013-05-15
3
Medium Priority
?
434 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 2000 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

New benefit for Premium Members - Upgrade now!

Ready to get started with anonymous questions today? It's easy! Learn more.

Question has a verified solution.

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

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 …
We are taking giant steps in technological advances in the field of wireless telephony. At just 10 years since the advent of smartphones, it is crucial to examine the benefits and disadvantages that have been report to us.
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…
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

705 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