A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
The circulant Hadamard conjecture
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Gaussian Moat Hopper <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:counting, coloring Levels:1
Category:Combinatorics Lean version:YES! ✔
Rate this game! 4.5 out of 5 (2,049 votes)

>>> How to Play <<<
The circulant Hadamard and Barker-sequence conjectures. Proves that real circulant Hadamard matrices exist exactly in orders 1 and 4, resolving the circulant Hadamard conjecture. Together with classical Barker-sequence results, this shows that binary sequences whose nontrivial aperiodic autocorrelations have magnitude at most 1 exist at lengths n > 1 exactly when $n\in\{2,3,4,5,7,11,13\}$.

>>> Level Select <<<
released 2026-09-23  |  1 theorem · 4 lemmas · 8 proofs · 6,391 words  |  PLAY LEVEL 1 »  (pdf)
We prove the circulant Hadamard conjecture: a real circulant Hadamard matrix has order 1 or 4. As a consequence, Barker sequences of length greater than one exist exactly at lengths 2, 3, 4, 5, 7, 11, 13, proving the Barker-sequence conjecture.

More Combinatorics Games!
Pinned distances and a power saving for planar unit distancesCombinatorial invariance of Kazhdan–Lusztig polynomialsThe Shareshian–Wachs $e$-positivity conjectureSharp logarithmic exponents for off-diagonal Ramsey numbers HOT!
The hypercube Ramsey conjectureClassification of finite Euclidean Ramsey configurationsSeymour's second-neighborhood conjecture HOT!Deterministic construction of strong thin spanning trees

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games