On the Number of Binary Digits in a Multiple of Three (Q5590132)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3309301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Number of Binary Digits in a Multiple of Three |
scientific article; zbMATH DE number 3309301 |
Statements
1969
0 references
number theory
0 references
On the Number of Binary Digits in a Multiple of Three (English)
0 references
0.7781511545181274
0 references
0.7444981336593628
0 references
0.7237943410873413
0 references
L. Moser conjectured that considering the binary expansion of multiples of three \((11, 110, 1001, \dots)\) we can always find a preponderance of numbers containing an even number of digits 1 over those containing an odd number of digits 1. I. Barrodale and R. MacLeod verified this up to 500,000. This article contains a proof of the mentioned conjecture: Denote \(D(n)\) the number of digits 1 in the binary expansion of \(n\) and \[ S(N)=\sum_{0\leq j\leq N/3} (-1)^{D(N-3j)}. \] Theorem: For arbitrary \(n\) \[ 1/20<S(3n)/n^\alpha<5, \quad\text{where}\;\alpha=\log 3/\log 4. \] From the first inequality the Moser's inequality follows. Further it is proved that \[ \lim_{n\to\infty} (S(3n)/n^\alpha) \] does not exist. The proof uses analytical methods but it is noted that S. Klein has found an elementary proof.
0 references