Revision as of 22:50, 19 June 2025 edit OAbot (talk \| contribs) Bots 643,717 edits m Open access bot: url-access updated in citation with #oabot. ← Previous edit		Revision as of 02:53, 23 July 2025 edit undo Beland (talk \| contribs) Autopatrolled, Administrators 259,156 edits m MOS:ELLIPSES / convert special characters found by Wikipedia:Typo Team/moss (via WP:JWB) Tag: JWB Next edit →
Line 3: * Input: a multiset ''S'' containing ''n'' positive integer elements. * Conditions: ''S'' must be partitionable into ''m'' triplets, ''S''<sub>1</sub>, ''S''<sub>2</sub>, …..., ''S''<sub>''m''</sub>, where ''n = 3m''. These triplets [[Partition of a set\|partition]] ''S'' in the sense that they are [[Disjoint sets\|disjoint]] and they [[Cover (topology)\|cover]] ''S''. The target value ''T'' is computed by taking the sum of all elements in ''S'', then dividing by ''m''. * Output: whether or not there exists a partition of ''S'' such that, for all triplets, the sum of the elements in each triplet equals ''T''.

3-partition problem: Difference between revisions