Automaticity of the sequence of the last nonzero digits of n! in a fixed base
From MaRDI portal
Publication:2199500
DOI10.5802/JTNB.1080zbMATH Open1475.11039arXiv1806.02560OpenAlexW2969977520MaRDI QIDQ2199500FDOQ2199500
Publication date: 11 September 2020
Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1806.02560
Recommendations
Formal languages and automata (68Q45) Radix representation; digital problems (11A63) Combinatorics on words (68R15) Automata sequences (11B85)
Cites Work
- Automatic Sequences
- On the representation of an integer in two different bases.
- Title not available (Why is that?)
- A footnote to the least non zero digit of \(n!\) in base \(12\)
- The least nonzero digit of \(n!\) in base \(12\)
- A density version of Cobham’s theorem
- Yet Another Footnote to the Least Non Zero Digit of n! in Base 12
Cited In (4)
This page was built for publication: Automaticity of the sequence of the last nonzero digits of \(n!\) in a fixed base
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199500)