On Newman's phenomenon in higher bases
Sai Teja Somu

TL;DR
This paper extends Newman's phenomenon, showing that the dominance of numbers with even number of 1's in their base-b expansion persists in higher bases and analyzing its strength and distribution among primes.
Contribution
It generalizes Newman's phenomenon to higher bases and establishes conditions for its occurrence, also comparing the strength of the phenomenon across bases.
Findings
Newman's phenomenon exists for bases greater than 2.
The phenomenon is stronger in higher bases than in binary.
Number of primes with the phenomenon grows slower than x/log x.
Abstract
A well known result of Newman says that upto a limit, multiples of with even number of 1's in binary representation always exceed multiples of with odd number of 1's. The phenomenon of preponderance of even number of 1's is now known as Newman's phenomenon. We show that this phenomenon exists for higher bases. Let be a positive integer(). Let be the set of all natural numbers which contain only 0's and 1's in b-ary expansion and be the difference between the corresponding number of , , and has even number of 1's in b-ary expansion and the number of , , and has odd number of 1's in b-ary expansion. Let be a multiple or divisor of which is relatively prime to then we show that for sufficiently large . We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · History and Theory of Mathematics · Logic, programming, and type systems
