ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let q>1q>1 be an integer, let F={p1,…,pk}F=\{p_1,\dots,p_k\} be a finite set of primes that does not contain all the primes dividing qq, and let aa be a positive integer. Say that an integer is ε\varepsilon-equidistributed in base qq when the proportion of each digit in its base-qq expansion differs from 1/q1/q by less than ε\varepsilon. Uniform equidistribution conjecture. For every ε>0\varepsilon>0, there exists NN such that

a∏i=1kpiαia\prod_{i=1}^k p_i^{\alpha_i}

is ε\varepsilon-equidistributed in base qq whenever αi≥N\alpha_i\geq N for some i∈{1,…,k}i\in\{1,\dots,k\}. This uniform, or multidimensional, version is needed for applications in larger bases, while the source notes that the underlying equidistribution assertions are not known even in simple cases; its status is therefore 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.