Difference between revisions of "1979 USAMO Problems/Problem 5"
m |
|||
| Line 7: | Line 7: | ||
==See Also== | ==See Also== | ||
{{USAMO box|year=1979|num-b=4|after=Last Question}} | {{USAMO box|year=1979|num-b=4|after=Last Question}} | ||
| + | {{MAA Notice}} | ||
[[Category:Olympiad Combinatorics Problems]] | [[Category:Olympiad Combinatorics Problems]] | ||
Revision as of 19:08, 3 July 2013
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 | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
