Two algorithms for evaluation of the Newman digit sum, and a new proof of Coquet's theorem

2007/09/06 by Vladimir Shevelev, Shevelev, Vladimir · 3 citations
Computer Science · Mathematics · #11A63 #FOS: Mathematics #Iterative Methods for Nonlinear Equations #Mathematical and Theoretical Analysis #Number Theory (math.NT) #Numerical Methods and Algorithms #math.NT #msc:11A63

paper · pdf · doi:10.48550/arxiv.0709.0885

18 pages

openalex publication_date 2007/09/06 · arxiv created 2012/09/17 · arxiv updated 2012/09/18 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

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.

Cited by

• On the Newman sum over multiples of a prime with a primitive or semiprimitive root 2
• Errata and Addenda to Mathematical Constants
• Tangent power sums and their applications

Related

• A family of digit functions with large periods
• Estimates of Newman Sum over Numbers Multiple of a Fixed Integer
• New Digit Results and Several Problems
• Properties of the cumulated deficient binary digit sum
• Weyl sums over integers with digital restrictions