Tuesday, 20 February 2018

number theory - Summation of logs



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!NNeN2πN (Stirling formula) and hence
Nk=1lnk(N+12)lnNN+12ln(2π).



No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...