1985 USAMO Problems/Problem 4
There are people at a party. Prove that there are two people such that, of the remaining people, there are at least of them, each of whom knows both or else knows neither of the two. Assume that "know" is a symmetrical relation; denotes the greatest integer less than or equal to .
This problem needs a solution. If you have a solution for it, please help us out by adding it.
|1985 USAMO (Problems • Resources)|
|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.