Related papers: Insertion in constructed normal numbers
After a short review of the historical milestones on normal numbers, we introduce the Borel numbers as the reals admitting a probability function on their different bases representations. In this setting, we provide two probabilistic…
In 1909 Borel defined normality as a notion of randomness of the digits of the representation of a real number over certain base (fractional expansion). If we think the representation of a number over a base as an infinite sequence of…
Let s be an integer greater than or equal to 2. A real number is simply normal to base s if in its base-s expansion every digit 0, 1, ..., s-1 occurs with the same frequency 1/s. Let X be the set of positive integers that are not perfect…
We give metric theorems for the property of Borel normality for real numbers under the assumption of digit dependencies in their expansion in a given integer base. We quantify precisely how much digit dependence can be allowed such that,…
It is well known that all numbers that are normal of order $k$ in base $b$ are also normal of all orders less than $k$. Another basic fact is that every real number is normal in base $b$ if and only if it is simply normal in base $b^k$ for…
Given a real number $0.a_1a_2 a_3\dots$ that is normal to base $b$, we examine increasing sequences $n_i$ so that the number $0.a_{n_1}a_{n_2}a_{n_3}\dots$ are normal to base $b$. Classically it is known that if the $n_i$ form an arithmetic…
We give a construction of a real number that is normal to all integer bases and continued fraction normal. The computation of the first n digits of its continued fraction expansion performs in the order of n^4 mathematical operations. The…
We construct the base $2$ expansion of an absolutely normal real number $x$ so that, for every integer $b$ greater than or equal to $2$, the discrepancy modulo $1$ of the sequence $(b^0 x, b^1 x, b^2 x , \ldots)$ is essentially the same as…
Given an integer $b\geqslant 2$ and a set $P$ of prime numbers, the set $T_P $ of Toeplitz numbers comprises all elements of $[0,b[$ whose digits $(a_n)_{n\geqslant 1}$ in the base-$b$ expansion satisfy $a_n=a_{pn}$ for all $p\in P$ and…
A real number $x$ is normal with respect to an integer base $b \geq 2$ if its digit expansion in this base is ``equitable'', in the sense that for $k \geq 1$, every ordered sequence of $k$ digits from $\{0, 1, \ldots, b-1\}$ occurs in the…
Normal numbers were introduced by Borel and later proven to be a weak notion of algorithmic randomness. We introduce here a natural relativization of normality based on generalized number representation systems. We explore the concepts of…
We show that normality for continued fractions expansions and normality for base-$b$ expansions are maximally logically separate. In particular, the set of numbers that are normal with respect to the continued fraction expansion but not…
In 2008 or earlier, Michel Mend\`es France asked for an instance of a real number $x$ such that both $x$ and $1/x$ are simply normal to a given integer base $b$. We give a positive answer to this question by constructing a number $x$ such…
A real number $x$ is considered normal in an integer base $b \geq 2$ if its digit expansion in this base is ``equitable'', ensuring that for each $k \geq 1$, every ordered sequence of $k$ digits from $\{0, 1, \ldots, b-1\}$ occurs in the…
A real number $x$ is absolutely normal if, for every base $b\ge 2$, every two equally long strings of digits appear with equal asymptotic frequency in the base-$b$ expansion of $x$. This paper presents an explicit algorithm that generates…
Let $\alpha=0.a_1a_2a_3\ldots$ be an irrational number in base $b>1$, where $0\leq a_i<b$. The number $\alpha \in (0,1)$ is a \textit{normal number} if every block $(a_{n+1}a_{n+2}\ldots a_{n+k})$ of $k$ digits occurs with probability…
In the present note we study the interrelations between the sets of so-called typical numbers and numbers that are normal in base two. Employing results by Nakai and Shiokawa, we exhibit examples of numbers that belong to one set but do not…
A number is normal in base $b$ if, in its base $b$ expansion, all blocks of digits of equal length have the same asymptotic frequency. The rate at which a number approaches normality is quantified by the classical notion of discrepancy,…
Let $g \geq 2$. A real number is said to be g-normal if its base g expansion contains every finite sequence of digits with the expected limiting frequency. Let \phi denote Euler's totient function, let \sigma be the sum-of-divisors…
We give a construction of an absolutely normal real number $x$ such that for every integer $b $ greater than or equal to $2$, the discrepancy of the first $N$ terms of the sequence $(b^n x \mod 1)_{n\geq 0}$ is of asymptotic order…