Searcharxiv⌕ Search

arXiv · 2610.26594

Uniform lower bounds for the average length of finite Pierce expansions

Abstract

For integers $1\leq a\leq b$, the length of the finite Pierce expansion of $a/b$ is the number of steps of the iteration $r\mapsto b\bmod r$ which starts at $a$ and ends at zero. Erdős and Shallit (1991) proved that the average of these lengths over $1\leq a\leq b$ is bounded below by a positive constant times $\log\log b$, and suggested that it is at least of order $\log b$. In this paper, we prove that the average length is at least $\sqrt{2\log b}-3(\log b)^{1/4}-11$ for every $b\geq2$. We also show that, for each $0<c<\sqrt2$, the proportion of numerators $a$ for which the length is less than $c\sqrt{\log b}$ tends to zero exponentially fast in $\sqrt{\log b}$, with an explicit rate. Our approach refines the interval-counting argument of Erdős and Shallit by restricting the product of the initial digits. As applications, we obtain similar bounds for reduced fractions and for numerators in a fixed congruence class.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Min Woong Ahn. 2026-10-19. Uniform lower bounds for the average length of finite Pierce expansions. https://arxiv.org/abs/2610.26594

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

KEEP EXPLORING

Related papers

Dynamical systems defined by polynomials with algebraic properties

Let (x_n; n\in Z) be a bisequence of elements x_n in the 1-dimensional torus R/Z, which is called a stream over R/Z. Let P(z)=a_k z^k+...+a_1 z+a_0 be a polynomial with integer coefficients. Define the set of streams over R/Z such that the convolution product P(z)\times(x_n; n\in Z)=(\sum_{i=0}^k a_i x_{n-i}; n\in Z)=(0; n\in Z), which is called the stream 0 of P. We study similarities between stream 0 of P and the roots of P(z)=0.

math.NT↗

Effective existence of primitive k-normal elements via affine spaces

Let $\mathbb{F}_{q^n}$ be the finite field with $q^n$ elements. An element $α\in \mathbb{F}_{q^n}$ is $k$-normal over $\mathbb{F}_q$ if $α$ and its conjugates span an $\mathbb{F}_q$-subspace of dimension $n-k$. It is known that, for $q$ sufficiently large, a primitive $k$-normal element exists if and only if there exists a $k$-normal element free of binomials, but the lower bound on $q$ is not explicit. We count the $k$-normal elements in specific affine subspaces of $\mathbb{F}_{q^n}$ and show that, in some of them, all but at most one element is $k$-normal. Combining this with character sum estimates over affine spaces and a sieve, we obtain an explicit lower bound on $q$ above which a primitive $k$-normal element exists, provided there is a $k$-normal element free of binomials whose $\mathbb{F}_q$-order has a linear factor or is irreducible. As an application, we compute these bounds for $5 \le n \le 8$ and give a complete characterization of the existence of primitive $k$-normal elements in $\mathbb{F}_{q^6}$ over $\mathbb{F}_q$.

math.NT↗