Magic squares are grids where every row, column, and main diagonal sums to a constant, typically using consecutive numbers from 1 to n^2. Algorithms exist for constructing normal magic squares of every order greater than 2.
Magic hexagons apply this concept to a hexagonal grid, where cells form lines in three directions, and each line must have the same sum. A normal magic hexagon uses consecutive numbers from 1 to 3n^2-3n+1, which is the total number of cells for a hexagon of order n.
There is only one non-trivial normal magic hexagon, excluding rotations and reflections. This uniqueness is proven by a divisibility test: for every order n greater than 3, the sum of numbers from 1 to 3n^2-3n+1 is not divisible by 2n-1, which is required for a magic hexagon.
The single existing normal magic hexagon has 19 cells, corresponding to an order of n=3.
Abnormal magic hexagons relax the constraint that numbers must start from 1, only requiring them to be consecutive. This relaxation allows for new solutions to appear.
However, finding these solutions is difficult due to the lack of formulaic construction or deterministic algorithms. The current approach involves searching a large space of possible arrangements. As of July 2026, the largest known solution was a hexagon of order n=9, discovered in 2024.
✨ This summary was generated by AI from the outlets' reporting listed below. It is not independently verified and may contain errors — check the original sources. How BrevFeed works →
One email each morning: the day's tech stories, clustered across outlets and summarized. No account needed.
One email a day. Unsubscribe in one click, any time.
Spend a few minutes, get the whole day. Every topic's top stories in one hands-free rundown — listen, watch, or read the transcript.
▶ Play today's briefNew every morning, and the back catalogue is archived by date.
This article delves into the mathematical concept of magic hexagons, contrasting them with magic squares and highlighting the difficulty in finding solutions for "abnormal" magic hexagons. It explains that while normal magic hexagons have only one non-trivial solution, relaxing the starting number constraint for abnormal hexagons opens up a complex search space.