arXiv 0709.08852007-09math.NT

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

Vladimir Shevelev

备注：: 18 pages

英文摘要：

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.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Joint distribution in residue classes of the base-$q$ and Ostrowski digital sums

Let $q$ be an integer $\geq 2$ and let $S_q(n)$ denote the sum of digits of $n$ in base $q$. For \[ α=[0;\overline{1,m}],\ m\geq 2, \] let $S_α(n)$ denote the sum of digits in the Ostrowski $α$-representation of $n$. Let $m_1,m_2\geq 2$ be integers with $$\gcd(q-1,m_1)=\gcd(m,m_2)=1.$$ We prove that there exists $δ>0$ such that for all integers $a_1,a_2$, \begin{eqnarray*} &&|\{0\leq n<N: S_{q}(n)\equiv a_1\pmod{m_1},\ S_α(n)\equiv a_2\pmod{m_2}\}| &=&\frac{N}{m_1m_2}+O(N^{1-δ}). \end{eqnarray*} The asymptotic relation implied by this equality was proved by Coquet, Rhin & Toffin and the equali…

2017-10-26math.NT

On Monotonic Strengthening of Newman-like Phenomenon on (2m+1)-multiples in Base 2m

We obtain exact and asymptotic expressions for the excess of nonnegative (2m+1)-multiples less than (2m)^k with even digit sums in the base 2m.

2007-10-25math.NT

Estimates of Newman Sum over Numbers Multiple of a Fixed Integer

We prove that the ratio of the Newman sum over numbers multiple of a fixed integer which is not multiple of 3 and the Newman sum over numbers multiple of a fixed integer divisible by 3 is o(1) when the upper limit of summing tends to infinity.We also discuss a connection of our results with a digit conjecture on primes.

2008-08-20math.NT

New Digit Results and Several Problems

We give some new relations for Newman digit sums respectively different modulos and put some problems. In particular, for the odd prime modulos we put an important conjecture.

2007-10-12math.NT

On a conjecture of Dekking : The sum of digits of even numbers

Let $q\geq 2$ and denote by $s_q$ the sum-of-digits function in base $q$. For $j=0,1,...,q-1$ consider $$# \{0 \le n < N : \;\;s_q(2n) \equiv j \pmod q \}.$$ In 1983, F. M. Dekking conjectured that this quantity is greater than $N/q$ and, respectively, less than $N/q$ for infinitely many $N$, thereby claiming an absence of a drift (or Newman) phenomenon. In this paper we prove his conjecture.

2013-05-08math.COmath.NT