Factor and arithmetic complexity of concatenating the \(n!\)

DOI10.22405/2226-8383-2023-24-4-341-344MaRDI QIDQ6498986

Abdullah Duaa, Mahdi Meisami

Publication date: 8 May 2024

Published in: Chebyshevskiĭ Sbornik (Search for Journal in Brave)

zbMATH Keywords

digital problemsfactor complexityfactorialsWeyl's criterionequidistributed modulo 1

Mathematics Subject Classification ID

Computer science (68-XX) Number theory (11-XX)

Cites Work

• Unnamed Item
• Formal Languages, Automata and Numeration Systems 1
• A Note on N!
• Symbolic Dynamics

This page was built for publication: Factor and arithmetic complexity of concatenating the \(n!\)