Search arXivSearch

arXiv · 2110.01855

On the rational approximation to $p$-adic Thue--Morse numbers

Abstract

Let $p$ be a prime number and $ξ$ an irrational $p$-adic number. Its multiplicative irrationality exponent ${μ^{\times}} (ξ)$ is the supremum of the real numbers ${μ^{\times}}$ for which the inequality $$ |b ξ- a|_{p} \leq | a b |^{- {μ^{\times}} / 2} $$ has infinitely many solutions in nonzero integers $a, b$. We show that ${μ^{\times}} (ξ)$ can be expressed in terms of a new exponent of approximation attached to a sequence of rational numbers defined in terms of $ξ$. We establish that ${μ^{\times}} ({{ξ_{{\bf t}, p}}}) = 3$, where ${{ξ_{{\bf t}, p}}}$ is the $p$-adic number $1 - p - p^2 + p^3 - p^4 + \ldots$, whose sequence of digits is given by the Thue--Morse sequence over $\{-1, 1\}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yann Bugeaud. 2021-10-05. On the rational approximation to $p$-adic Thue--Morse numbers. https://arxiv.org/abs/2110.01855

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT