1995 USAMO Problems/Problem 5

Revision as of 07:08, 19 July 2016 by 1=2 (talk | contribs) (Created page with "==Problem== Suppose that in a certain society, each pair of persons can be classified as either ''amicable'' or ''hostile''. We shall say that each member of an amicable pair ...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Suppose that in a certain society, each pair of persons can be classified as either amicable or hostile. We shall say that each member of an amicable pair is a friend of the other, and each member of a hostile pair is a foe of the other. Suppose that the society has $\, n \,$ persons and $\, q \,$ amicable pairs, and that for every set of three persons, at least one pair is hostile. Prove that there is at least one member of the society whose foes include $\, q(1 - 4q/n^2) \,$ or fewer amicable pairs.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See Also

1995 USAMO (ProblemsResources)
Preceded by
Problem 1
Followed by
Problem 3
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. AMC logo.png