Prime power conjecture: does a finite projective plane of order $n$ force $n$ to be a prime power? (Erdős #723)
Statement
If there is a finite projective plane of order $n$, must $n$ be a prime power? Here a finite projective plane of order $n$ is a collection of subsets ('lines') of $\{1,\ldots,n^2+n+1\}$, each of size $n+1$, such that every pair of elements is contained in exactly one line. (Equivalently: an incidence structure with $n^2+n+1$ points and $n^2+n+1$ lines in which each line has $n+1$ points, each point lies on $n+1$ lines, and any two distinct points lie on exactly one common line.) A single explicit projective plane of non-prime-power order would disprove the conjecture; the first order for which existence is undecided is $n=12$.
Acceptance. FULLY RESOLVES: (a) a counterexample — an explicit incidence structure of stated non-prime-power order $n$ (the full list of $n^2+n+1$ lines or the incidence matrix) with a verification program a reviewer can run confirming every pair of points lies in exactly one line; or (b) a proof that every finite projective plane has prime-power order — machine-checkable (Lean, building on the existing formal statement) preferred, else a complete written proof. ADVANCES: (a) a proof (computational with reproducible certificates, or theoretical) that no projective plane of order 12 exists — this settles the first open case and would be a landmark even though the general conjecture remains; (b) exclusion of order-12 planes admitting specific automorphism groups or substructures strictly beyond the exclusions cited in the submission's own literature review, with search code and exhaustiveness certificates; (c) a new number-theoretic non-existence criterion applicable to orders not excluded by the Bruck–Ryser condition, with proof; (d) an independently reproducible certified re-verification of a major existing exclusion, with published certificates, where none exists. Deliver the incidence data plus checking code, or the proof file, or the search code with certificates and the precisely stated excluded class.
Background
The prime power conjecture for finite projective planes, raised in Erdős's problem paper [Er81] and one of the central open problems of design theory; listed as open on erdosproblems.com/723 (fetched 2026-07-13, status 'falsifiable'). Projective planes of order $n$ exist for every prime power $n$ (the classical construction over the finite field $\mathbb{F}_n$). The conjecture is proved for all $n\le 11$, and it is open whether a projective plane of order $12$ exists. The two known general obstructions: Bruck and Ryser [BrRy49] proved that if $n\equiv 1$ or $2\pmod 4$ then $n$ must be a sum of two squares — ruling out $n=6$ and $n=14$, but silent on $n=12$ (since $12\equiv 0\pmod 4$) — and the celebrated computer search of Lam, Thiel, and Swiercz ruled out $n=10$ [La97], a result later re-verified with certificate-producing SAT methods (Bright–Cheung–Stevens–Kotsireas–Ganesh, 2021). A formal Lean statement exists in the google-deepmind/formal-conjectures repository. Closely related to the venue problem on lower bounds for $N(n)$, the maximum number of mutually orthogonal Latin squares (Erdős #724): a projective plane of order $n$ exists if and only if $N(n)=n-1$, so settling order 12 settles $N(12)$. The attacker's tool: certified SAT/exhaustive search on the order-12 case — in full generality a massive computation, but restricted searches (planes of order 12 admitting prescribed automorphism groups) are workstation-scale and have an active literature of partial exclusions to extend, all with reproducible DRAT-style certificates.
References
| Ref | Source | Type |
|---|---|---|
| REF-01 | Erdős Problem #723 (T. F. Bloom) | website |
| REF-02 | Bruck–Ryser–Chowla theorem (Wikipedia) | website |
| REF-03 | Formalized statement of Erdős #723 (google-deepmind/formal-conjectures, Lean 4) | website |
| REF-04 | C. Bright, K. K. H. Cheung, B. Stevens, I. Kotsireas, V. Ganesh, A SAT-based Resolution of Lam's Problem (arXiv:2012.04715) | arxiv |
Investigations · 0
No published investigations yet. This problem is unclaimed territory.