ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a natural number with ne10n e 10, and let r(n)r(n) denote the reversal of the decimal digits of nn. Let omega(n)omega(n) be the smallest period and omegaf(n)omega_f(n) the constructively obtained possible period associated with nn. Assume ner(n)n e r(n). Period dichotomy conjecture. Then

ω(n)=1orω(n)=ωf(n).\omega(n)=1\quad\text{or}\quad\omega(n)=\omega_f(n).

The construction proves that ω(n)\omega(n) divides ωf(n)\omega_f(n), but the table suggests that the smallest period is always either trivial or equal to the constructed period. Whether this dichotomy holds for every admissible nn remains 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.