A density version of Cobham's theorem
Byszewski, Jakub · Konieczny, Jakub
Original · EN
Cobham's theorem asserts that if a sequence is automatic with respect to two multiplicatively independent bases, then it is ultimately periodic. We prove a stronger density version of the result: if two sequences which are automatic with respect to two multiplicatively independent bases coincide on a set of density one, then they also coincide on a set of density one with a periodic sequence. We apply the result to a problem of Deshouillers and Ruzsa concerning the least nonzero digit of n! in base 12.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.