Partition of a set!

Level 2

A positive integer k k is said to be "good" if there exists a partition of {1,2,3,...20} in to disjoint proper subsets such that the sum of the numbers in each subset of the partition is k k . How many "good" numbers are there?

8 6 4 10

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...