One great problem, three kinds of immersion

From a story to your own conjecture

Problem stories open curiosity. The problem workshop is the next place, where curiosity becomes a testable idea.

  1. 1 · DiscoverMeet the questionLearn when it appeared and why it still holds people’s attention.
  2. 2 · ChallengeTest one caseMake your first observation in five minutes with a drawing, calculation, or colors.
  3. 3 · DevelopYou are hereBuild on ideasPublish an observation and grow it through comparisons, conjectures, and counterexamples.
Week 13 · ErdősOpen
Primary source

Magic Square of Squares — Can 3×3 Be Done?

Simple rule · open problem· Posed 1996

Problem

Is there a 3×33\times 3 magic square (rows, columns, diagonals all sum to the same value) whose nine entries are distinct positive perfect squares?

Why it matters

Martin Gardner popularized this with a 100prizein1996.AndrewBremnerthatyearshowedanearmisswhere7of8sumsmatch.Computersearchhascoveredallsumvaluesbelow100 prize in 1996. Andrew Bremner that year showed a near-miss where 7 of 8 sums match. Computer search has covered all sum-values below10^{14}withnopositiveresult.Awith no positive result. A10{,}000 prize is now on offer for a true solution.

Progress so far

Bremner (1996) and Boyer (2005) found near-misses where 7 of 8 sums match. Robertson (2010) showed rational solutions exist but no integer-square solution has been found. As of 2025, exhaustive computer search has ruled out all 8-tuples up to large bounds.

Further reading

💡 Explore together, one line at a time(0 contributions)

Contributions are not ranked by popularity. Curator feedback names what is clear or reproducible, and peer signals mean someone understood or actually reproduced it.

What did you notice?

You do not need a complete proof. A small observation can open the next path.

Markdown + KaTeX supported (`$x^2$` inline, `$$\sum_{k=1}^n k$$` display)
0 / 3000 characters

moderation policy. Sign in after submitting if you want to edit or delete this attempt from another device.

Loading…