Which of the following is greater?
1 0 0 3 0 0 or 3 0 0 !
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.
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?
Log in to reply
Yes, that's correct. A more accurate bounding of l n ( n ! ) is
2 1 ln ( 2 π ) + ( n + 2 1 ) ln ( n ) − n + 1 2 n + 1 1 < ln ( n ! ) < 2 1 ln ( 2 π ) + ( n + 2 1 ) ln ( n ) − n + 1 2 n 1
For n = 3 0 0 this bounds ln ( 3 0 0 ! ) to an interval of width ≈ 0 . 0 0 0 0 0 0 0 7 7 , with a value of 1 4 1 4 . 9 0 5 8 5 . Thus the approximation I used in my solution is accurate to 0 . 2 7 %. The percentage error in the approximation ln ( n ! ) = n ln ( n ) − n is of the order
1 0 0 × ( n + 2 1 ) ln ( n ) − 1 2 1 ln ( n ) %,
or roughly n 5 0 % for very large n , which → 0 as n → ∞ .
Log in to reply
Wonderful problem as well as solution as always. (+1)
Log in to reply
@Rahil Sehgal – Thanks! And thanks also for the inspiration. :)
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!
Log in to reply
@Kaushik Chandra – You're right that the error 2 1 ln ( n ) tends to infinity as n tends to infinity, so the error calculation is of the indeterminate form ∞ / ∞ . However, for very large n the percentage is n 5 0 %, which does go to 0 as n goes to infinity. So while the absolute error value goes to infinity, the percentage error goes to 0 .
Log in to reply
@Brian Charlesworth – Again astounded by the magic of mathematics. Thanks a lot sir Wizard for unfolding the magic!
By Stirling's approximation 3 0 0 ! > ( e 3 0 0 ) 3 0 0 > ( 1 0 0 ) 3 0 0
Problem Loading...
Note Loading...
Set Loading...
Comparing the natural logs of each of these quantities, we have that ln ( 1 0 0 3 0 0 ) = 3 0 0 ln ( 1 0 0 ) ≈ 1 3 8 1 . 5 5 , and by Stirling's approximation ln ( 3 0 0 ! ) ≈ 3 0 0 ln ( 3 0 0 ) − 3 0 0 ≈ 1 4 1 1 . 1 3 , so 3 0 0 ! > 1 0 0 1 0 0 .
Note that Stirling's approximation for large N is very accurate, well within 1% for N = 3 0 0 .