A note on Stirling's expansion for factorial n
A new approximation to the Stirling expansion for \(n!=\Gamma (n+1)\) is proposed. By means of this approximation the values of n! may be computed faster and with sufficient accuracy. Thus the proposed approximation is better suited for computer use than the older ones. An algorithm for generating Poisson variables is presented as an application example.
scientific article; zbMATH DE number 4098601