Tuesday, 27 October 2015

discrete mathematics - Find a formula for sumlimitsnk=1lfloorsqrtkrfloor




I need to find a clear formula (without summation) for the following sum:



nk=1k



Well, the first few elements look like this:



1,1,1,2,2,2,2,2,3,3,3,...



In general, we have (2212) 1's, (3222) 2's etc.




Still I have absolutely no idea how to generalize it for n first terms...


Answer



Hint



We have
pk<p+1p2k<(p+1)2k=p
so



nk=1k=n+11p=1(p+1)21k=p2k=n+11p=1p(2p+1)
Now use the fact

nk=1k=n(n+1)/2
and
nk=1k2=n(n+1)(2n+1)/6
to get the desired closed form.


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}...