n sides · k extra numbers on every side · numbers 1 to n(k+1), each used once · one common sum on every side
Created by Inder J. Taneja
A magic n-gon has ncorners (each shared by two sides) and k extra numbers on every side.
Every side — corner + k extras + corner — must have the same sum S. Adding all sides counts every corner twice: n × S = (1 + 2 + … + n(k+1)) + (sum of the corners)
This rule gives the possible sums. The exact search then decides each one: it finds every solution, or proves that none exists.
Rotations and reflections of a polygon count once, and the extras on a side count as one group.
1Choose the polygon
2Possible sums — click one to solve it, or count them all