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

 Make it equal (Posted on 2010-05-26)
Divide the set {1,2,3,4, ....,n} into three disjoint subsets A , B , C whose sums of elements are equal. For what values of n it is feasible?

 See The Solution Submitted by Ady TZIDON Rating: 3.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 re: half of it SOME HINTS(a partial spoiler) | Comment 3 of 7 |
(In reply to half of it by Daniel)

You say:..".Thus it is possible to form A,B, and C for all even n>=6.."

Not so.    Try n=10,16,22,28...  etc and you will not be able to provide the  desired  partition.
The sum of n numbers must be a multiple of 3 - otherwise you cannot create 3 equal parts.

Now you have enough background to define  precise criteria for the solvability of the division and (not asked in the post) describe the exact way of doing it for any given n , fitting those criteria.

 Posted by Ady TZIDON on 2010-05-26 19:29:38
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 (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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