Search arXivSearch

arXiv · 2609.15531

Periodicity and Period-Length Bounds for Browkin $p$-Adic Continued Fractions

Abstract

Continued fractions have been introduced and studied in the field of $p$--adic numbers by several authors, with the aim of developing analogues of the classical theory of real continued fractions. In this paper, we focus on Browkin's continued fraction algorithm, for which several fundamental questions remain open, especially concerning periodic expansions of quadratic irrationals. In this paper, we solve a conjecture about periodicity left open in [6]. As a consequence, we prove that, for every positive integer $t$, there exist infinitely many square roots of integers whose Browkin continued fraction expansion is periodic with period length $2t$. This also settles a problem originating from previous classical results on the possible period lengths of square roots of integers. Moreover, we provide new sufficient conditions for the periodicity of quadratic irrationals and derive explicit bounds for the corresponding period lengths. These results also restrict the possible behaviour of a quadratic irrational whose Browkin continued fraction expansion is non-periodic, and therefore provide new tools for investigating whether an analogue of Lagrange's theorem can hold. Finally, we also provide a computational study of the Browkin expansions of quadratic irrationals, with particular attention to the behaviour of square roots of integers and to the search for possible non-periodic examples.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stefano Barbero, Nadir Murru, Matilda Urani. 2026-09-14. Periodicity and Period-Length Bounds for Browkin $p$-Adic Continued Fractions. https://arxiv.org/abs/2609.15531

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