ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let qq be a positive integer, and let f:N→Cf:\mathbb{N}\to\mathbb{C} be a multiplicative qq-automatic function, meaning that ff is qq-automatic and satisfies f(mn)=f(m)f(n)f(mn)=f(m)f(n) for all m,n∈Nm,n\in\mathbb{N}. A function g:N→Cg:\mathbb{N}\to\mathbb{C} is eventually periodic if there exist integers NN and T≥1T\geq 1 such that g(n+T)=g(n)g(n+T)=g(n) for all n≥Nn\geq N.

Bell-Bruin-Coons conjecture. There exists an eventually periodic function g:N→Cg:\mathbb{N}\to\mathbb{C} such that

f(p)=g(p)f(p)=g(p)

for all primes pp.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.