Employing concepts from additive number theory, together with results on binary evaluations and partial series, we establish bounds on the density of 1’s in the binary expansions of real algebraic numbers. A central result is that if a real $y$ has algebraic degree $D\>1$, then the number $\#\left(\right|y|,N)$ of 1-bits in the expansion of $\left|y\right|$ through bit position $N$ satisfies$$\#\left(\right|y|,N)\>C{N}^{1/D}$$for a positive number $C$ (depending on $y$) and sufficiently large $N$. This in itself establishes the transcendency of a class of reals ${\sum }_{n\ge 0}1/2^{f\left(n\right)}$ where the integer-valued...

We construct a Markov normal sequence with a discrepancy of $O\left(N^{-1/2}{log}^{2}N\right)$. The estimation of the discrepancy was previously known to be $O\left(e^{-c{(logN)}^{1/2}}\right)$.

If $w=(q_k{)}_{k\in \mathbf{N}}$ denotes the sequence of best approximation denominators to a real $\alpha$, and $s_{\alpha }\left(n\right)$ denotes the sum of digits of $n$ in the digit representation of $n$ to base $w$, then for all $x$ irrational, the sequence $\left(s_{\alpha }\right(n)·x{)}_{n\in \mathbf{N}}$ is uniformly distributed modulo one. Discrepancy estimates for the discrepancy of this sequence are given, which turn out to be best possible if $\alpha$ has bounded continued fraction coefficients.

For a real number $q>1$ and a positive integer $m$, let $Y_m\left(q\right):=\left\{{\sum }_{i=0}^n{ϵ}_i{q}^i:{ϵ}_i\in \left\{0,\pm 1,...,\pm m\right\},n=0,1,...\right\}$. In this paper, we show that $Y_m\left(q\right)$ is dense in $ℝ$ if and only if $q<m+1$ and $q$ is not a Pisot number. This completes several previous results and answers an open question raised by Erdös, Joó and Komornik [8].