Automaticity of the sequence of the last nonzero digits of \(n!\) in a fixed base

DOI10.5802/jtnb.1080zbMath1475.11039arXiv1806.02560OpenAlexW2969977520MaRDI QIDQ2199500

Eryk Lipka

Publication date: 11 September 2020

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.02560

zbMATH Keywords

automatic sequencefactorialthe last nonzero digit

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Radix representation; digital problems (11A63) Automata sequences (11B85)

Related Items (3)

How to prove that a sequence is not automatic ⋮ On \(k\)-regularity of sequences of valuations and last non-zero digits ⋮ On the last nonzero digits of $n!$ in a given base

Cites Work

• Unnamed Item
• Unnamed Item
• The least nonzero digit of $n!$ in base $12$
• On the representation of an integer in two different bases.
• Automatic Sequences
• Yet Another Footnote to the Least Non Zero Digit of n! in Base 12
• A density version of Cobham’s theorem

This page was built for publication: Automaticity of the sequence of the last nonzero digits of \(n!\) in a fixed base