Fermat's divisibility conjecture for Mersenne numbers
Statement
Let be an odd prime, and define the least occurrence exponent to be the least positive integer such that divides the Mersenne number , when such an integer exists. Fermat's divisibility conjecture. For every odd prime , the least occurrence exponent exists and satisfies
Equivalently, every odd prime divides , and if it first divides , then is a divisor of . This is presented as Fermat's October statement for the base and as the broader claim from which Fermat's theorem follows.
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.