ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Fn=22n+1F_n=2^{2^n}+1 be the nnth Fermat number. For a positive integer qq, let Gq/RqG_q/R_q denote the cycle decomposition of the multiplication-by-22 map modulo qq, and call each orbit a cycle; an rr-cycle has length rr. Fermat-cycle conjecture. For each natural number nn, the cycles of FnF_n are all 2n2^n-cycles. Moreover, a positive integer dd other than 11 is a factor of FnF_n if and only if the cycles of dd are all 2n2^n-cycles. This conjecture proposes a symmetric characterization of the factors of Fermat numbers through the cycle lengths of the associated modular doubling map; the source provides examples but no resolution.

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.