Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn Simply Normal Numbers to Different Bases
398
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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 powers, hence X is the set {2,3, 5,6,7,10,11,...} . Let M be a function from X to sets of positive integers such that, for each s in X, if m is in M(s) then each divisor of m is in M(s) and if M(s) is infinite then it is equal to the set of all positive integers. These conditions on M are necessary for there to be a real number which is simply normal to exactly the bases s^m such that s is in X and m is in M(s). We show these conditions are also sufficient and further establish that the set of real numbers that satisfy them has full Hausdorff dimension. This extends a result of W. M. Schmidt (1961/1962) on normal numbers to different bases.
rate research
Read More
We prove independence of normality to different bases We show that the set of real numbers that are normal to some base is Sigma^0_4 complete in the Borel hierarchy of subsets of real numbers. This was an open problem, initiated by Alexander Kechris, and conjectured by Ditzen 20 years ago.
A folklore conjecture in number theory states that the only integers whose expansions in base $3,4$ and $5$ contain solely binary digits are $0, 1$ and $82000$. In this paper, we present the first progress on this conjecture. Furthermore, we investigate the density of the integers containing only binary digits in their base $3$ or $4$ expansion, whereon an exciting transition in behaviour is observed. Our methods shed light on the reasons for this, and relate to several well-known questions, such as Grahams problem and a related conjecture of Pomerance. Finally, we generalise this setting and prove that the set of numbers in $[0, 1]$ who do not contain some digit in their $b$-expansion for all $b geq 3$ has zero Hausdorff dimension.
M. B. Levin used Sobol-Faure low discrepancy sequences with Pascal matrices modulo $2$ to construct, for each integer $b$, a real number $x$ such that the first $N$ terms of the sequence $(b^n x mod 1)_{ngeq 1}$ have discrepancy $O((log N)^2/N)$. This is the lowest discrepancy known for this kind of sequences. In this note we characterize Levins construction in terms of nested perfect necklaces, which are a variant of the classical de Bruijn necklaces. Moreover, we show that every real number $x$ whose base $b$ expansion is the concatenation of nested perfect necklaces of exponentially increasing order satisfies that the first $N$ terms of $(b^n x mod 1)_{ngeq 1}$ have discrepancy $O((log N)^2/N)$. For base $2$ and the order being a power of $2$, we give the exact number of nested perfect necklaces and an explicit method based on matrices to construct each of them.
Let $b ge 2$ and $ell ge 1$ be integers. We establish that there is an absolute real number $K$ such that all the partial quotients of the rational number $$ prod_{h = 0}^ell , (1 - b^{-2^h}), $$ of denominator $b^{2^{ell+1} - 1}$, do not exceed $exp(K (log b)^2 sqrt{ell} 2^{ell/2})$.
Given an integer $k$, define $C_k$ as the set of integers $n > max(k,0)$ such that $a^{n-k+1} equiv a pmod{n}$ holds for all integers $a$. We establish various multiplicative properties of the elements in $C_k$ and give a sufficient condition for the infinitude of $C_k$. Moreover, we prove that there are finitely many elements in $C_k$ with one and two prime factors if and only if $k>0$ and $k$ is prime. In addition, if all but two prime factors of $n in C_k$ are fixed, then there are finitely many elements in $C_k$, excluding certain infinite families of $n$. We also give conjectures about the growth rate of $C_k$ with numerical evidence. We explore a similar question when both $a$ and $k$ are fixed and prove that for fixed integers $a geq 2$ and $k$, there are infinitely many integers $n$ such that $a^{n-k} equiv 1 pmod{n}$ if and only if $(k,a) eq (0,2)$ by building off the work of Kiss and Phong. Finally, we discuss the multiplicative properties of positive integers $n$ such that Carmichael function $lambda(n)$ divides $n-k$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
