ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let b,rb,r be positive integers with gcd⁡(b−1,r)=1\gcd(b-1,r)=1, and let cc be any integer. Write sb(n)s_b(n) for the sum of the base-bb digits of nn. Bounded-offset conjecture. There exists a constant CC, depending only on bb and rr, such that for every k≥1k\geq 1 there is an integer n≤k+Cn\leq k+C satisfying

sb(kn)≡c(modr).s_b(kn)\equiv c\pmod r.

Moreover, one can take C≤br+cC\leq b^{r+c}. This conjecture proposes that the weak bound from Proposition can be replaced by a bound only a constant distance above kk, generalizing the analogous phenomenon for the classical Thue–Morse sequence.

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.