Combinatoricshard
0:00.0
A set is partitioned into two disjoint subsets and such that the sum of elements in equals the sum of elements in . How many such partitions exist?
A set is partitioned into two disjoint subsets and such that the sum of elements in equals the sum of elements in . How many such partitions exist?