Bounded-offset conjecture for digit sums of multiples
Statement
Let be positive integers with , and let be any integer. Write for the sum of the base- digits of . Bounded-offset conjecture. There exists a constant , depending only on and , such that for every there is an integer satisfying
Moreover, one can take . This conjecture proposes that the weak bound from Proposition can be replaced by a bound only a constant distance above , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.