Difference between revisions of "1979 USAMO Problems/Problem 5"
Danielguo94 (talk | contribs) |
m |
||
| Line 5: | Line 5: | ||
==Solution== | ==Solution== | ||
{{solution}} | {{solution}} | ||
| − | ==See | + | ==See Also== |
| − | {{USAMO box|year=1979|num-b=4|after=Last | + | {{USAMO box|year=1979|num-b=4|after=Last Question}} |
| + | |||
| + | [[Category:Olympiad Combinatorics Problems]] | ||
Revision as of 10:59, 5 October 2012
Problem
Let 
be distinct subsets of ![$[n]$](http://latex.artofproblemsolving.com/0/d/e/0deff9086fd7840ef23860f5bc924f1d4d2d2310.png)
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 Question | |
| 1 • 2 • 3 • 4 • 5 | ||
| All USAMO Problems and Solutions | ||
