Difference between revisions of "1972 IMO Problems/Problem 1"
Mathwiz0803 (talk | contribs) |
Mathwiz0803 (talk | contribs) (→Solution (Cheap Way)) |
||
| Line 11: | Line 11: | ||
By definition an empty set is disjoint to any other set. Therefore, our subsets will be empty set and empty set. | By definition an empty set is disjoint to any other set. Therefore, our subsets will be empty set and empty set. | ||
| + | |||
| + | Solution by: mathwiz0803 | ||
{{alternate solutions}} | {{alternate solutions}} | ||
Revision as of 19:28, 12 July 2017
Problem
Prove that from a set of ten distinct two-digit numbers (in the decimal system), it is possible to select two disjoint subsets whose members have the same sum.
Solution
Note that there are 
distinct subsets of our set of 10 two-digit numbers. Also note that the sum of the elements of any subset of our set of 10 two-digit numbers must be between 10 and 
. This shows that there are 846 attainable sums. The Pigeonhole Principle then implies that there are two distinct subsets whose members have the same sum. Let these sets be 
and 
. Note that 
and 
are two distinct sets whose members have the same sum. These two sets are subsets of our set of 10 distinct two-digit numbers, so this proves the claim. 
Solution (Cheap Way)
By definition an empty set is disjoint to any other set. Therefore, our subsets will be empty set and empty set.
Solution by: mathwiz0803
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.
See Also
| 1972 IMO (Problems) • Resources | ||
| Preceded by First Problem |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 2 |
| All IMO Problems and Solutions | ||
