Processing math: 100%

Tuesday, September 15, 2015

Prove 1000!11000>999!1999.

Prove 1000!11000>999!1999.

This inequality would be easy to prove if one uses the more advance knowledge, like Stirling's formula where it states when n then we have n!nnen2πn.

But, elementary method works well too in this problem.

Below is my solution that I want to share:

It is not hard to see that

22>2!, 33>3!, and so on and so forth...

Therefore we have

nn>n! holds for all positive integer n2

1n!>1nn

n!nn!>n!nnn

n!nn!>(n(n1)!)nnn

n!nn!>nn(n1)!nnn

n!nn!>nn(n1)!nnn

n!n1>(n1)!n

n!1n>(n1)!1n1

Therefore, we have proved the more general case and if we let n=1000, we have

1000!11000>(999)!1999

and we're hence done.

No comments:

Post a Comment