1982 USAMO Problems/Problem 1

Revision as of 10:36, 6 March 2013 by 1=2 (talk | contribs) (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...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

In a party with $1982$ 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 (ProblemsResources)
Preceded by
First Question
Followed by
Problem 2
1 2 3 4 5
All USAMO Problems and Solutions