ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be an odd prime, and define the least occurrence exponent kk to be the least positive integer such that pp divides the Mersenne number 2k−12^k-1, when such an integer exists. Fermat's divisibility conjecture. For every odd prime pp, the least occurrence exponent kk exists and satisfies

k∣(p−1).k\mid(p-1).

Equivalently, every odd prime divides 2p−1−12^{p-1}-1, and if it first divides 2k−12^k-1, then kk is a divisor of p−1p-1. This is presented as Fermat's October statement for the base 22 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 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.