The maximum conjecture for uniform-distribution thresholds
Statement
For an integer base , let be the smallest such that, for all , the digits are uniformly distributed in the relevant sequence .
Maximum conjecture. If coprime bases and satisfy and , then
More generally, for any finite set of pairwise coprime bases with , one has
This is proposed as a generalization of Jacobson's method for combining distribution information in coprime bases. The source gives no proof or resolution, so the conjecture is open.
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.