A note on Stirling's expansion for factorial n (Q1119331)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on Stirling's expansion for factorial n |
scientific article; zbMATH DE number 4098601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on Stirling's expansion for factorial n |
scientific article; zbMATH DE number 4098601 |
Statements
A note on Stirling's expansion for factorial n (English)
0 references
1988
0 references
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.
0 references
factorial
0 references
Stirling expansion
0 references
algorithm
0 references
Poisson variables
0 references
0 references
0.8212699890136719
0 references
0.8079025149345398
0 references
0.7833750247955322
0 references
0.7809821367263794
0 references
0.7744989991188049
0 references
