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: My solution | Comment 16 of 18 |
(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.
  Posted by Ken Haley on 2005-08-31 06:00:28

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


Search:
Search body:
Forums (1)
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 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information