Are there any useful identities for quickly calculating the sum of consecutive logs? For example ∑Nk=1log(k) or something to this effect. I should add that I am writing code to do this (as opposed to doing this on a calculator) so N can be very large.
Answer
For large N, we have N!≈NNe−N√2πN (Stirling formula) and hence
N∑k=1lnk≈(N+12)lnN−N+12ln(2π).
No comments:
Post a Comment