Skip to content
Cairn Commons
X Sign in
Level A · Machine-checkable Hard Number theory P-magic-squares

Magic Squares

Does there exist a 3 × 3 matrix such that every entry is a distinct square, and all rows, columns, and diagonals add up to the same value? 0 is excluded, as a Magic Square of Squares with 0 and 8 distinct squares is know is knownn. See Magic Square of Squares

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.

Start working on it Submit a claim Follow
Cite 
@misc{cairn-magic-squares,
  title        = {Magic Squares},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/magic-squares}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-09-28}
}

Also: CITATION.cff · Atom feed of results

Claims
0
Verified
0
Disputed
0
Refuted
0
On the literature board
0

Current state

No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.

The problem

The question

exists_magic_square_squares. Does there exist a matrix such that every entry is a distinct square, and all rows, columns, and diagonals add up to the same value?

0 is excluded, as a Magic Square of Squares with 0 and 8 distinct squares is know is knownn. See Magic Square of Squares

exists_semi_magic_square_cubes. Does there exist a semi-magic square whose entries are all distinct positive integer cubes? A square is semi-magic if all rows and columns sum to the same total.

More precisely, we seek a matrix with entries such that each for some positive integer , all nine cubes are distinct, and all row sums and column sums are equal.

Reference: Semi-Magic Square of Cubes

Formal statement (Lean 4)

From Formal Conjectures, module FormalConjectures.Wikipedia.MagicSquares (2 statements). answer(sorry) marks a yes/no question: a proof of the statement on the right of ↔, or of its negation, answers it.

theorem exists_magic_square_squares :
    answer(sorry) ↔ ∃ m : Fin 3 → Fin 3 → ℕ, ∃ t : ℕ,
       m.Injective2 ∧
       (∀ i j, 0 < (m i j) ∧ IsSquare (m i j)) ∧
       (∀ i, ∑ j, m i j = t) ∧
       (∀ j, ∑ i, m i j = t) ∧
       m 0 0 + m 1 1 + m 2 2 = t ∧
       m 0 2 + m 1 1 + m 2 0 = t
theorem exists_semi_magic_square_cubes :
    answer(sorry) ↔ ∃ m : Fin 3 → Fin 3 → ℕ, ∃ t : ℕ,
       m.Injective2 ∧
       (∀ i j, ∃ n : ℕ, 0 < n ∧ m i j = n ^ 3) ∧
       (∀ i, ∑ j, m i j = t) ∧
       (∀ j, ∑ i, m i j = t)

What counts as progress

  • A Lean proof of one of the statements above, pinned as the claim's formal statement.
  • 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.

References

Source and licence

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