Let m 2 be an integer. Let A be a finite set of (not necessarily positive) integers, and let B1, …

Let m gt; 2 be an integer. Let A be a finite set of (not necessarily positive) integers, and let B1, B2, B3, ..., Bm be subsets of A. Assume that for each k = 1, 2, ..., m, the sum of the elements of Bk is mk. Prove that A contains at least m/2 elements.

Watch the full video at:

Never get lost on homework again. Numerade is a STEM learning website and app with the world’s largest STEM video library.
Join today and access millions of expert-created videos, each one skillfully crafted to teach you how to solve tough problems step-by-step.

Join Numerade today at: