521 Math #114: Distinct Sums of subsets (Pigeonhole Principle)

preview_player
Показать описание
Let X be a set of positive integers not exceeding 24. What is the maximum value of |X| so that X have sums of all subsets different.

Example: A={2,3,7,11} is a set of all sums of subsets as
2, 3, 7, 11, 5, 9, 13, 10, 14, 18, 12, 16, 20, 21, 23;
the sums are of different values. In this case |A| = 4.

(A) 4
(B) 5
(C) 6
(D) 7

Please have a good try.

Please give it a try before looking at the answer and explanation.

+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

A math problem will be solved and discussed on every TUESDAY. These problems are suitable for math enthusiasts, it helps in learning and sharpening skills in math Olympiad skill too.

Check it out and share to anyone who may like it. Please comment if you have any idea to improve the videos, or any alternative solutions to the problems.

Have fun and enjoy the problem solving!
Рекомендации по теме
Комментарии
Автор

The way to find that example for |X|=6 confused me for a bit, but then I realized it is not so different from the sieve of Erathostenes. It looks like a greedy algorithm. Maybe I'll try and see if I can obtain another example following this same method (maybe skipping 23 for instance).
EDIT: it did not work XD

andreben
join shbcf.ru