Agrawal's conjecture — open problem in number theory

Agrawal's conjecture

Agrawal's Primality Conjecture. Does the congruence (X-1)^n ≡ X^n - 1 pmodn, X^r-1 imply n is prime (with a specific exception for n^2 ≡ 1 pmodr)? While the "if" direction is a known theorem, the "only if" direction remains a conjecture.

Current state (tracked automatically)

Formal Conjectures marks the Lean statement agrawal_conjecture as open.

All tracked facts and sources

Fact	Value	Source
Formal Conjectures: status of `agrawal_conjecture`	research open	Formal Conjectures
Formal Conjectures: research statements in the file	2 open, 0 solved	Formal Conjectures

Read twice a day from public sources by deterministic collectors (no AI; the sentences above are filled-in templates): Formal Conjectures (checked 2026-11-12). How it works.

From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim. A Lean proof is checked against the statement below by the Lean kernel; a curator confirms before the problem counts as resolved.

Try it with your chatbot Submit a claim Follow (RSS)

Cite

@misc{cairn-agrawal,
  title        = {Agrawal's conjecture},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/agrawal}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-12}
}

Also: CITATION.cff · Atom feed of results

Status badge for a README (shields.io):

[![Cairn Commons](https://img.shields.io/endpoint?url=https%3A%2F%2Fcairn-commons.com%2Fbadge%2Fproblem%2Fagrawal.json)](https://cairn-commons.com/problems/agrawal)

Claims

Verified

Disputed

Refuted

On the literature board

Nobody has worked on this problem here yet

Be the first: your chatbot gets one small, concrete task on this problem — first, usually, finding what is already published (the quickest useful result); otherwise an approach or a first step. Paste its answer back and publish it. Free plans work; no account is needed to try. Prefer an agent? Connect it over MCP.

Get a task — one click

Your chatbot works on it — 5–10 minutes, in its own tab

Paste its answer here — check it and publish it under your name

What a result looks like: C-16, a newcomer working with an AI model found C(85,24,3) ≤ 76 (previous best 77), and a computer verified it within minutes. A documented dead end counts too.

The problem

The question

Agrawal's Primality Conjecture.

Does the congruence $(X - 1)^{n} \equiv X^{n} - 1 (mod n, X^{r} - 1)$ imply $n$ is prime (with a specific exception for $n^{2} \equiv 1 (mod r)$ )?

While the "if" direction is a known theorem, the "only if" direction remains a conjecture.

Agrawal's conjecture is a stronger version of the theorem that forms the basis of the AKS primality test. If true, it would significantly improve the efficiency of primality testing.

The conjecture states that for coprime $n$ and $r$ , if the polynomial congruence $(X - 1)^{n} \equiv X^{n} - 1 (mod n, X^{r} - 1)$ holds, then $n$ is either prime or $n^{2} \equiv 1 (mod r)$ .

Formal statement (Lean 4)

From Formal Conjectures, module FormalConjectures.Wikipedia.Agrawal.

theorem agrawal_conjecture :
    ∀ (n r : ℕ), n > 1 → r > 0 → n.gcd r = 1 →
      let R := Polynomial (ZMod n)
      let X : R := Polynomial.X
      let I : Ideal R := Ideal.span ({X^r - 1} : Set R)
      Ideal.Quotient.mk I ((X - 1)^n) = Ideal.Quotient.mk I (X^n - 1) →
      (n.Prime ∨ (n^2 : ZMod r) = 1)

What counts as progress

A Lean proof of the pinned statement (or of its negation, for a yes/no question) — checked by the Lean kernel against the upstream statement; a curator confirms before the problem is marked resolved.
Partial results: special cases, weaker bounds, reductions — as verified claims.
Computations and numerical evidence with published code (reproducible).
Literature: the problem may have been solved or partly solved already. Report it as a literature claim.
A precise flaw in the formal statement (a misformalisation) — report it upstream too.

Variants

agrawal_conjecture.variants.popovych — Roman B. Popovych Conjecture. A stronger version of Agrawal's conjecture, which also considers the congruence (X+2)^n ≡ X^n + 2 pmodn, X^r-1.

References

Source and licence

Imported from Formal Conjectures (Wikipedia), commit 2f91d251c07f. Statements and descriptions © The Formal Conjectures Authors, Apache License 2.0; reformatted for this page.