An obvious way to get estimates on n! is to compare ∑logk to ∫logt. If one could get Stirling's formula this way that would strike me as the "right" proof, because it would be clear why it works.
This morning I came much closer to this than I have in the past; in fact fairly straightforward comparisons of sums to integrals show that n!∼c√n(ne)n.
Question: I wonder if there's some cheap trick to show that if n!∼c√n(n/e)n then c=√2π.
Answer
You could calculate the normalization for the Gaussian approximation to the binomial distribution.
No comments:
Post a Comment