Furstenberg-type restricted-digit counting conjecture
Statement
Let be different odd prime numbers. For each , set
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 denotes the set of nonnegative integers whose base- expansions use only digits from for every . Restricted-digit counting conjecture. If , then for every there is a constant 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 . If , then 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.