The prime-power formula for the minimal period of the generalized digit map
Statement
Let and be integers with and . For each prime factor , define
The sequence is assumed to have a minimal period . Minimal-period formula. If for every prime factor , then
where
This refines the preceding general bounds for the minimal period and is supported by numerical evidence under the stated restriction ; its validity beyond these conditions is not asserted here.
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.