Automaticity of the sequence of the last nonzero digits of $n!$ in a fixed base
Eryk Lipka

TL;DR
This paper investigates the automaticity of the sequence of last nonzero digits of factorials in various bases, providing a new proof and a complete characterization of when this sequence is automatic.
Contribution
It offers an alternative proof to previous results and generalizes the problem to characterize all bases for which the sequence is automatic.
Findings
The sequence is not automatic in base 12.
Provides a complete characterization of bases with automatic last nonzero digit sequences.
Generalizes previous results to a broader class of bases.
Abstract
In 2011 Deshouillers and Ruzsa tried to argument that the sequence of the last nonzero digit of in base 12 is not automatic. This statement was proved few years later by Deshoulliers. In this paper we provide alternate proof that lets us generalize the problem and give an exact characterization in which bases the sequence of the last nonzero digits of is automatic.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Computability, Logic, AI Algorithms · Algorithms and Data Compression
