6 Jul
2014
6 Jul
'14
5:29 p.m.
h(n) = (-1)^(parity of bit-sum of binary representation of n) f(x) S=SUM[ f(n) * h(n), for n=0..2^k-1 with k large] ln(x+1) S=-log(2)/2 ln(x+2) S = -0.1379330125 ln(x+3) -0.07070756527 x^j 0 for any fixed integer j>=0 1/(x+1) 0.398761088108 1/(x+2) 0.1049709156499 sqrt(x) -0.63407426 1/sqrt(x+1) 0.1983140804979 -- Warren D. Smith http://RangeVoting.org <-- add your endorsement (by clicking "endorse" as 1st step)