Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Markov Chains vs. Simulation: Flipping a Million Little Coins. Parent comment
It's a useful heuristic approximation that
n! ~ (n/e)^n
The actual Stirling approximation is just a sqrt(2 pi n) bigger than the above, and usually it's fine to throw that away (as above).
There are no comments on this comment yet.
It's a useful heuristic approximation that
That is, multiplying the "n" factors from 1...n is close to multiplying (n/e) upon itself "n" times.The actual Stirling approximation is just a sqrt(2 pi n) bigger than the above, and usually it's fine to throw that away (as above).