1990 IMO Problems/Problem 2

Revision as of 05:45, 5 July 2016 by Ani2000 (talk | contribs) (Created page with "2. Let <math>n\ge3</math> and consider a set <math>E</math> of <math>2n-1</math> distinct points on a circle. Suppose that exactly <math>k</math> of these points are to be col...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

2. Let $n\ge3$ and consider a set $E$ of $2n-1$ distinct points on a circle. Suppose that exactly $k$ of these points are to be colored black. Such a coloring is “good” if there is at least one pair of black points such that the interior of one of the arcs between them contains exactly $n$ points from $E$. Find the smallest value of $k$ so that every such coloring of $k$ points of $E$ is good.