ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be a prime, let qq be a base that is not a power of pp, and write the base-qq expansion of pnp^n as having kn=⌈nlog⁡qp⌉k_n=\lceil n\log_q p\rceil digits. Let dj,nd_{j,n} denote its jj-th digit from left to right. Digit equidistribution conjecture for powers. For each d∈{0,1,…,q−1}d\in\{0,1,\ldots,q-1\},

lim⁡n→∞1kn#{1≤j≤kn:dj,n=d}=1q.\lim_{n\to\infty}\frac{1}{k_n}\#\left\{1\leq j\leq k_n:d_{j,n}=d\right\}=\frac{1}{q}.

The paper reports strong computational evidence for this statement in bases 33, 44, 55, and 1010, noting that in base 33 it is stronger than the paper's base-3 persistence conjecture.

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.