Can you partition the numbers 1, 2, 3, ... nē in n separate subsets, each with n numbers, all subsets having the same sum?
(In reply to
My solution by Ken Haley)
Actually, now that I've reread bractal's solution, I see that mine is the same as his. By cycling the columns to the left as he describes, he's turning my diagonals into vertical columns. Same result.