3-partition problem: Difference between revisions

Content deleted Content added
m {{hsp}}
m Example: <math>
Line 9:
 
# The set <math>S = \{ 20, 23, 25, 30, 49, 45, 27, 30, 30, 40, 22, 19 \}</math> can be partitioned into the four sets <math>\{ 20, 25, 45 \}, \{ 23, 27, 40 \}, \{ 49, 22, 19 \} , \{ 30, 30, 30\}</math>, each of which sums to ''T'' = 90.
# The set <math>S = \{1, 2, 5, 6, 7, 9\}</math> can be partitioned into the two sets <math>\{1, 5, 9\}, \{2, 6, 7\}</math> each of which sum to ''T'' = 15.
# (every integer in ''S'' is strictly between ''T''/4 and ''T''/2): <math>S = \{4,5,5,5,5,6\}</math>, thus ''m''=2, and ''T''=15. There is feasible 3-partition <math>\{4,5,6\}, \{5,5,5\}</math>.
# (every integer in ''S'' is strictly between ''T''/4 and ''T''/2): <math>S = \{4,4,4,6,6,6\}</math>, thus ''m''=2, and ''T''=15. There is no feasible solution.