A note on Stirling's expansion for factorial n (Q1119331): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q595530 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Piotr Staniewski / rank | |||
Normal rank | |||
Revision as of 06:22, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on Stirling's expansion for factorial n |
scientific article |
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
