Difference between revisions of "1982 USAMO Problems/Problem 1"
(Created page with "== Problem == In a party with <math>1982</math> persons, among any group of four there is at least one person who knows each of the other three. What is the minimum number of peo...") |
|||
| Line 7: | Line 7: | ||
== See Also == | == See Also == | ||
{{USAMO box|year=1982|before=First Question|num-a=2}} | {{USAMO box|year=1982|before=First Question|num-a=2}} | ||
| + | {{MAA Notice}} | ||
[[Category:Olympiad Combinatorics Problems]] | [[Category:Olympiad Combinatorics Problems]] | ||
Revision as of 18:13, 3 July 2013
Problem
In a party with 
persons, among any group of four there is at least one person who knows each of the other three. What is the minimum number of people in the party who know everyone else.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 1982 USAMO (Problems • Resources) | ||
| Preceded by First Question |
Followed by Problem 2 | |
| 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. 
