The equidistribution conjecture for digits of powers in base q
Statement
Let be a prime, let be a base that is not a power of , and write the base- expansion of as having digits. Let denote its -th digit from left to right. Digit equidistribution conjecture for powers. For each ,
The paper reports strong computational evidence for this statement in bases , , , and , noting that in base 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.