ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an integer base β\beta, let Υ(β)\Upsilon(\beta) be the smallest KK such that, for all k≥Kk\geq K, the digits 0,1,…,β−10,1,\ldots,\beta-1 are uniformly distributed in the relevant sequence (Φβk(n))n=1Nk\left(\Phi_{\beta^k}(n)\right)_{n=1}^{N_k}.

Maximum conjecture. If coprime bases β1\beta_1 and β2\beta_2 satisfy Υ(β1)=u\Upsilon(\beta_1)=u and Υ(β2)=v\Upsilon(\beta_2)=v, then

Υ(β1β2)=max⁡(uv).\Upsilon(\beta_1\beta_2)=\operatorname{max}(uv).

More generally, for any finite set of pairwise coprime bases β1,…,βn\beta_1,\ldots,\beta_n with Υ(βi)=ui\Upsilon(\beta_i)=u_i, one has

Υ(β1,…,βn)=max⁡(u1,…,un).\Upsilon(\beta_1,\ldots,\beta_n)=\operatorname{max}(u_1,\ldots,u_n).

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 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.