Two algorithms for evaluation of the Newman digit sum, and a new proof of Coquet's theorem
arXiv:0709.0885
Abstract
We give two simple algorithms for the evaluation of difference between the numbers of multiples of 3 with even and odd binary digit sums in interval [0,x), and give an elementary proof of Coquet's sharp estimates for it.
arXiv comment18 pages
Cited by in corpus (6)
- Tangent power sums and their applications
- A family of digit functions with large periods
- New Digit Results and Several Problems
- On Monotonic Strengthening of Newman-like Phenomenon on (2m+1)-multiples in Base 2m
- On the Newman sum over multiples of a prime with a primitive or semiprimitive root 2
- Errata and Addenda to Mathematical Constants