Improve company productivity with a Business Account.Sign Up

x
  • Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 457
  • Last Modified:

mathematic problem

How to prove that for n > 2  
n to degree of n+1 is larger than (n+1) to degree of n
1
user_n
Asked:
user_n
  • 2
1 Solution
 
phoffricCommented:
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
 
user_nAuthor Commented:
Thank you very much
0
 
phoffricCommented:
You're welcome
0
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.

Join & Write a Comment

Featured Post

What Kind of Coding Program is Right for You?

There are many ways to learn to code these days. From coding bootcamps like Flatiron School to online courses to totally free beginner resources. The best way to learn to code depends on many factors, but the most important one is you. See what course is best for you.

  • 2
Tackle projects and never again get stuck behind a technical roadblock.
Join Now