English

On the length of Pierce expansions

Number Theory 2022-11-16 v1 Combinatorics

Abstract

For a given positive integer nn, how long can the process xn (mod x)x \mapsto n\text{ }(\text{mod } x) last before reaching 00? We improve Erd\H{o}s and Shallit's upper bound of O(n13+ε)O(n^{\frac{1}{3}+\varepsilon}) to O(n132177+ε)O(n^{\frac{1}{3}-\frac{2}{177}+\varepsilon}) for any ε>0\varepsilon > 0.

Keywords

Cite

@article{arxiv.2211.08374,
  title  = {On the length of Pierce expansions},
  author = {Zachary Chase and Mayank Pandey},
  journal= {arXiv preprint arXiv:2211.08374},
  year   = {2022}
}

Comments

8 pages