Inspired by Rahil Sehgal

Which of the following is greater?

10 0 300 or 300 ! \large 100^{300} \quad \text{or} \quad 300!

Cannot be determined 300 ! < 10 0 300 300! \lt 100^{300} 300 ! > 10 0 300 300! \gt 100^{300} 300 ! = 10 0 300 300! = 100^{300}

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Comparing the natural logs of each of these quantities, we have that ln ( 10 0 300 ) = 300 ln ( 100 ) 1381.55 \ln(100^{300}) = 300\ln(100) \approx 1381.55 , and by Stirling's approximation ln ( 300 ! ) 300 ln ( 300 ) 300 1411.13 \ln(300!) \approx 300\ln(300) - 300 \approx 1411.13 , so 300 ! > 10 0 100 \boxed{300! \gt 100^{100}} .

Note that Stirling's approximation for large N N is very accurate, well within 1% for N = 300 N = 300 .

Thanks a lot sir for making us aware of the stirling's approximation! I enjoyed learning it. As N increases, error % decreases. So, can we say that error % becomes 0 as N approaches infinity?

Kaushik Chandra - 4 years ago

Log in to reply

Yes, that's correct. A more accurate bounding of l n ( n ! ) ln(n!) is

1 2 ln ( 2 π ) + ( n + 1 2 ) ln ( n ) n + 1 12 n + 1 < ln ( n ! ) < 1 2 ln ( 2 π ) + ( n + 1 2 ) ln ( n ) n + 1 12 n \dfrac{1}{2}\ln(2\pi) + \left(n + \dfrac{1}{2}\right)\ln(n) - n + \dfrac{1}{12n + 1} \lt \ln(n!) \lt \dfrac{1}{2}\ln(2\pi) + \left(n + \dfrac{1}{2}\right)\ln(n) - n + \dfrac{1}{12n}

For n = 300 n = 300 this bounds ln ( 300 ! ) \ln(300!) to an interval of width 0.000000077 \approx 0.000000077 , with a value of 1414.90585 1414.90585 . Thus the approximation I used in my solution is accurate to 0.27 0.27 %. The percentage error in the approximation ln ( n ! ) = n ln ( n ) n \ln(n!) = n\ln(n) - n is of the order

100 × 1 2 ln ( n ) ( n + 1 2 ) ln ( n ) 1 100 \times \dfrac{\dfrac{1}{2}\ln(n)}{\left(n + \dfrac{1}{2}\right)\ln(n) - 1} %,

or roughly 50 n \dfrac{50}{n} % for very large n n , which 0 \to 0 as n n \to \infty .

Brian Charlesworth - 4 years ago

Log in to reply

Wonderful problem as well as solution as always. (+1)

Rahil Sehgal - 4 years ago

Log in to reply

@Rahil Sehgal Thanks! And thanks also for the inspiration. :)

Brian Charlesworth - 4 years ago

I appreciate your answer a lot. Mathematically, your answer sounds great but here is something strange.

Error % = error / original no. N × 100 % As the number N tends to infinity, error also tends to infinity. So, isn't it an indeterminate form ?

Thank you!

Kaushik Chandra - 4 years ago

Log in to reply

@Kaushik Chandra You're right that the error 1 2 ln ( n ) \dfrac{1}{2}\ln(n) tends to infinity as n n tends to infinity, so the error calculation is of the indeterminate form / \infty / \infty . However, for very large n n the percentage is 50 n \frac{50}{n} %, which does go to 0 0 as n n goes to infinity. So while the absolute error value goes to infinity, the percentage error goes to 0 0 .

Brian Charlesworth - 4 years ago

Log in to reply

@Brian Charlesworth Again astounded by the magic of mathematics. Thanks a lot sir Wizard for unfolding the magic!

Kaushik Chandra - 4 years ago
Tarit Goswami
May 25, 2017

By Stirling's approximation 300 ! > ( 300 e ) 300 > ( 100 ) 300 300!>(\frac{300}{e})^{300} >(100)^{300}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...