Problemintro
Magic square problem
Also called Magic squares.
Fill an n-by-n grid with distinct integers so every row, column and diagonal has the same sum.
Fill an n-by-n grid with distinct integers so every row, column and diagonal has the same sum.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag DGVTGW Edit this page History Report an error