ISSN:
1572-9125
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract We investigate binary-exponent alternating sums, i.e. sums with the general appearance $$\sum\nolimits_{k = 0}^{2^p - 1} {( - 1)^{b_k } f} (k)$$ , whereb k is the sum of the digits in the binary representation ofk. Whenf(k)=k s ,s integer, the sum cancels ifs〈p, and, whens≧p, takes values which can be recursively calculated. This recursion is studied more in detail. The casef(k)=sin(2π(x+k)/2 s ) illustrates the properties of the current summation operator.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01932273
Permalink