Preprint arXiv: 2402.16210[math.DS]; last accessed May 13, 2024.
ISSN/ISBN: Not available at this time. DOI: Not available at this time.
Abstract: We investigate unipotent dynamics on a torus and apply it to the following problem. Let d be a positive integer. Consider the sequence of digits (wn), where wn is the most significant digit in the decimal representation of 2nd. We prove that the complexity function of the sequence (wn) is, up to finitely many values, a polynomial.
Bibtex:
@misc{,
title={Complexity function of the most significant digits of $2^N^D$},
author={Mehdi Golafshan and Ivan Mitrofanov},
year={2024},
eprint={2402.16210},
archivePrefix={arXiv},
primaryClass={math.DS}
}
Reference Type: Preprint
Subject Area(s): Dynamical Systems, Number Theory