Related papers: On Simply Normal Numbers to Different Bases
We consider sets of reals $X$ endowed with the Sorgenfrey lower limit topology denoted $X[\leq]$. Przymusi\'nski proved that if $X$ is a $Q$-set then $(X[\leq])^2$ is normal. While the converse is not in general true we consider examples of…
Given a positive integer $M$ and a real number $q>1$, we consider the univoque set $\mathcal{U}_q$ of reals which have a unique $q$-expansion over the alphabet $\set{0,1,\cdots,M}$. In this paper we show that for any $x\in\mathcal{U}_q$ and…
Representing real numbers using convenient numeration systems (integer bases, $\beta$-numeration, Cantor bases, etc.) has been a longstanding mathematical challenge. This paper focuses on Cantor real bases and, specifically, on automatic…
For two real bases $q_0, q_1 > 1$, we consider expansions of real numbers of the form $\sum_{k=1}^{\infty} i_k/(q_{i_1}q_{i_2}\cdots q_{i_k})$ with $i_k \in \{0,1\}$, which we call $(q_0,q_1)$-expansions. A sequence $(i_k)$ is called a…
Given natural parameters s and r, where $2\leq s\leq r$, we consider the distribution of a random variable $\xi=\sum\limits_{k=1}^{\infty}s^{-k}\xi_k\equiv\Delta^{r_s}_{\xi_1\xi_2...\xi_k...},$ where $(\xi_k)$ is a sequence of independent…
Much has been written about expansions of real numbers in noninteger bases. Particularly, for a finite alphabet $\{0,1,\dots,\alpha\}$ and a real number (base) $1<\beta<\alpha+1$, the so-called {\em univoque set} of numbers which have a…
We create a simple test for distinguishing between sets of primes and random numbers using just the sum-of-digits function. We find that the sum-of-the-digits of prime numbers does not have an equal probability of being odd or even. The…
It is known that any symmetric matrix $M$ with entries in $\R[x]$ and which is positive semi-definite for any substitution of $x\in\R$, has a Smith normal form whose diagonal coefficients are constant sign polynomials in $\R[x]$. We…
We construct an absolutely normal number whose continued fraction expansion is normal in the sense that it contains all finite patterns of partial quotients with the expected asymptotic frequency as given by the Gauss-Kuzmin measure. The…
In this article, we define the notion of slim (normal) bases and show their existence for various fields. As an application, an algorithm will be given that computes the spectrum of a basefield transform by merely using O(n) additions.
For a word $S$, let $f(S)$ be the largest integer $m$ such that there are two disjoints identical (scattered) subwords of length $m$. Let $f(n, \Sigma) = \min \{f(S): S \text{is of length} n, \text{over alphabet} \Sigma \}$. Here, it is…
Let $\beta >1$ be an integer or generally a Pisot number. Put $T(x) = \{ \beta x \}$ on $[0,1]$ and let $S: [0,1]\to [0,1]$ be a piecewise linear transformation whose slopes have the form $\pm \beta^m$ with positive integers $m$. We give…
A Friedman number is a positive integer which is the result of an expression combining all of its own digits by use of the four basic operations, exponentiation and digit concatenation. A "nice" Friedman number is a Friedman number for…
Let $r$ and $s$ be multiplicatively independent positive integers. We establish that the $r$-ary expansion and the $s$-ary expansion of an irrational real number, viewed as infinite words on $\{0, 1, \ldots , r-1\}$ and $\{0, 1, \ldots ,…
It is known that for an arbitrary positive integer \(n\) the sequence \(S(x^n)=(1^n, 2^n, \ldots)\) is complete, meaning that every sufficiently large integer is a sum of distinct \(n\)th powers of positive integers. We prove that every…
A subset of a topological space is said to be \emph{universally measurable} if it is measured by the completion of each countably additive $\sigma$-finite Borel measure on the space, and \emph{universally null} if it has measure zero for…
We use transference principle to show that whenever $s$ is suitably large depending on $k \geq 2$, every sufficiently large natural number $n$ satisfying some congruence conditions can be written in the form $n = p_1^k + \dots + p_s^k$,…
Let $\psi:\mathbb R_+\to\mathbb R_+$ be a non-increasing function. A real number $x$ is said to be $\psi$-Dirichlet improvable if the system $$|qx-p|< \, \psi(t) \ \ {\text{and}} \ \ |q|<t$$ has a non-trivial integer solution for all large…
A positive integer $n$ is said to be a practical number if every integer in $[1,n]$ can be represented as the sum of distinct divisors of $n$. In this article, we consider practical numbers of a given polynomial form. We give a necessary…
In DOI:10.1017/etds.2022.2 the author proved that for each integer $k$ there is an implicit number $M > 0$ such that if $b_1, \cdots , b_k$ are multiplicatively independent integers greater than $M$, there are infinitely many integers whose…