ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p1,…,pkp_1,\dots,p_k be k≥2k\geq 2 different odd prime numbers. For each i∈1,…,ki\in\\{1,\dots,k\\}, set

Bi=0,…,(pi−1)/2.B_i=\\{0,\dots,(p_i-1)/2\\}.

Define

s=\sum_{i=1}^k\frac{\log\\#B_i}{\log p_i}=\sum_{i=1}^k\frac{\log(p_i+1)-\log 2}{\log p_i}.

Here Np1,…,pkB1,…,BkN_{p_1,\dots,p_k}^{B_1,\dots,B_k} denotes the set of nonnegative integers whose base-pip_i expansions use only digits from BiB_i for every ii. Restricted-digit counting conjecture. If s∈(k−1,k)s\in(k-1,k), then for every ϵ>0\epsilon>0 there is a constant Cϵ>1C_\epsilon>1 such that

C_\epsilon^{-1}N^{s-(k-1)-\epsilon}\leq\\#\left(N_{p_1,\dots,p_k}^{B_1,\dots,B_k}\cap[1,N]\right)\leq C_\epsilon N^{s-(k-1)+\epsilon}

for all integers N≥2N\geq2. If s<k−1s<k-1, then Np1,…,pkB1,…,BkN_{p_1,\dots,p_k}^{B_1,\dots,B_k} is finite. The upper bound is known under Schanuel's conjecture, while the lower bound and finiteness assertion remain open; the claim is related to Furstenberg-type intersection problems.

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.