Difference between revisions of "1979 USAMO Problems/Problem 5"
Danielguo94 (talk | contribs) (→Problem) |
Danielguo94 (talk | contribs) |
||
Line 4: | Line 4: | ||
==Solution== | ==Solution== | ||
− | + | {{solution}} | |
+ | ==See also== | ||
{{USAMO box|year=1979|num-b=4|after=Last Problem}} | {{USAMO box|year=1979|num-b=4|after=Last Problem}} |
Revision as of 22:44, 11 April 2012
Problem
Let be distinct subsets of with . Prove that for some pair .
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
1979 USAMO (Problems • Resources) | ||
Preceded by Problem 4 |
Followed by Last Problem | |
1 • 2 • 3 • 4 • 5 | ||
All USAMO Problems and Solutions |