asdf1
- 734
- 0
! question...
Why does lnX!=XlnX-X?
Why does lnX!=XlnX-X?
The discussion centers around the Stirling approximation for the logarithm of factorials, specifically why ln(n!) approximates to n ln(n) - n. Participants explore the derivation and implications of this approximation, touching on concepts related to integrals and asymptotic behavior.
Participants generally agree on the use of the Stirling approximation but express differing levels of understanding regarding its derivation and implications. Some confusion remains about the approximation's accuracy and the concepts of absolute and relative error.
Participants note that the approximation improves as n becomes larger, but the discussion does not resolve the nuances of when the approximation is valid or the implications of absolute versus relative error.
This discussion may be useful for students or individuals interested in mathematical approximations, particularly in the context of factorials and their applications in statistics and engineering.
[tex]\log(x!)=\sum_{n=1}^x \log(n) \sim \int_0^x \log(t) dt=x\log(x)-x[/tex]asdf1 said:?
i am referring to the Stirling approximation(sorry, i forgot to add that at the end of my question)...
i saw that equation in the "advanced engineering mathematics" book by kreyszig as part of the solution to a problem...
but what i wonder is how did the stirling approximation come from?
It is a Riemann sum we partition (0,x) into (we assume here x is a natural number)asdf1 said:Why? That's the part that I don't understand...
like HallsofIvy saidasdf1 said:thanks! It makes a lot more sense now...
but there's still one I don't get:
What's the difference between the absolute and relative error?