Bell-Bruin-Coons conjecture on multiplicative automatic functions
Statement
Let be a positive integer, and let be a multiplicative -automatic function, meaning that is -automatic and satisfies for all . A function is eventually periodic if there exist integers and such that for all .
Bell-Bruin-Coons conjecture. There exists an eventually periodic function such that
for all primes .
The conjecture concerns the restrictions to the primes of multiplicative automatic functions. It was stated by Bell, Bruin and Coons and is still open in general; the paper proves the corresponding assertion for completely multiplicative functions.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.