Erdős Problem #724
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: combinatorics.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
Let f(n) be the maximum number of mutually orthogonal Latin squares of order n, where each square has n symbols and no symbol repeats within a row or column, and two squares are orthogonal when their ordered-pair superposition gives each of the n² pairs exactly once. Erdős asks whether f(n)≥c sqrt(n) for a fixed c>0 and all sufficiently large n. This remains OPEN.
A small example
For n=3, define L_a(i,j)=i+a j modulo 3 for a=1,2. Each L_a is a Latin square. For a≠b, the map (i,j)↦(i+a j,i+b j) is invertible over F_3, so the pair of squares is orthogonal; f(3)≥2. A general upper bound f(n)≤n−1 follows from orthogonal-array counting, so f(3)=2. This finite prime-power construction cannot establish an all-n square-root lower bound.
What is known
Bose–Parker–Shrikhande disproved Euler's n≡2 mod4 'no orthogonal pair' belief; they proved f(n)≥2 for n≥7. Chowla–Erdős–Straus gave f(n)≫n^(1/91), Wilson improved to n^(1/17), and Beth to n^(1/14.8), as maintained source attributes. Those exponents are strictly below 1/2, so do not settle #724. Prime-power orders have a full family n−1 by finite-field construction; controlling ALL n is the challenge. Original BPS/CES/Wilson/Beth full theorem proof pages not directly inspected.
GCL's current state
The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.
Preserved source-review qualifications: mols all n sqrt lower open; prime power n minus one only special. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Prove the finite-field linear construction of n−1 MOLS for n prime, including n=3 exact pair fixture, then audit Beth's best currently cited uniform exponent and its all-n hypothesis. Acceptance is exact algebra with prime-field inversibility; no extrapolation to general n≈sqrt bound.
Sources and claim boundaries
Maintained Erdős #724; GCL source report. Original historical theorem pages and full formal proof chain not independently inspected; no new independent primary theorem certification, browser readback is a protected publication verification gateor V2 admission.
Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1995 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_REQUIRED.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.