All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
A quite even partition (Posted on 2005-08-28) Difficulty: 3 of 5
Can you partition the numbers 1, 2, 3, ... nē in n separate subsets, each with n numbers, all subsets having the same sum?

See The Solution Submitted by Federico Kereki    
Rating: 4.3333 (3 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: The Odd-Sided Squares Principle | Comment 14 of 18 |
(In reply to The Odd-Sided Squares Principle by Bruno)

There is a classical algorithm for filling such a magic square -- and you may have rediscovered it, or invented a new one altogether. The method I know of, implies imposing another square on the original, but at 45 degrees, then filling this with the numbers from 1 to n^2 in a certain way, and finally moving the numbers from the big square to the original one.
  Posted by Federico Kereki on 2005-08-31 03:21:40

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information