ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Mp=2p−1M_p=2^p-1 be the Mersenne number associated with a prime number pp. For a positive integer qq, let Gq/RqG_q/R_q denote the cycle decomposition of the multiplication-by-22 map modulo qq, and let the number of kk-cycles of qq mean the number of cycles of length kk in this decomposition. Mersenne-cycle-count conjecture. For each prime number pp, the number of kk-cycles of MpM_p is

(p−1)!k!(p−k)!.\frac{(p-1)!}{k!(p-k)!}.

Moreover, a positive integer dd other than 11 is a factor of MpM_p if and only if the number of kk-cycles of dd is equal to the number of (p−k)(p-k)-cycles of dd. The conjecture is motivated by the displayed cycle decompositions and binomial expansion in the source; no proof or resolution is supplied there.

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.