Conjecture on the cycle counts of Mersenne numbers and their factors
Statement
Let be the Mersenne number associated with a prime number . For a positive integer , let denote the cycle decomposition of the multiplication-by- map modulo , and let the number of -cycles of mean the number of cycles of length in this decomposition. Mersenne-cycle-count conjecture. For each prime number , the number of -cycles of is
Moreover, a positive integer other than is a factor of if and only if the number of -cycles of is equal to the number of -cycles of . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.