ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Conjecture 3

Chapter A: Lecture Notes

Lecture notes were TeXed in real time by John Voight.

#A.1 Agrawal: A Polynomial Time Algorithm for Testing Primality

The primality testing algorithm we present is based upon the following identity: n is prime if and only if (1 + X)n ≡ 1 + Xn (mod n),

where we consider this congruence as an identity in the polynomial ring ( Z/n Z)[ X]. This easily gives a randomized algorithm which runs in polynomial time: rather than verifying it completely (which would be far too expensive), you verify it modulo a randomly chosen degree log n polynomial Q(X); repeating this sufficiently often, you expect to witness a failure of this congruence to hold fairly quickly if n is composite.

Conjecture. To prove that n is prime, it is enough to let Q(X) run over the set

{X − 1, X 2 − 1,..., X log 2 n − 1}.

We were unable to prove this conjecture, but, instead the modified conjecture, which is then a proposition:

Proposition (Modified conjecture). To prove that n is prime, it is enough to let Q(X) run over the set

R = {(X + a)r − 1: 1 ≤ r ≤ 16(log n)5, 1 ≤ a ≤ 8(log n)7/2},

except when n has a 'small' prime factor ( ≤ (log n)5).

Record

Added
Links

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.