MathDB
155 birds are sitting down on the boundary of a circle

Source: IMO Shortlist 1989, Problem 29, ILL 89

September 18, 2008
combinatoricsgraph theoryExtremal Graph TheoryExtremal combinatoricsIMO Shortlist

Problem Statement

155 birds P1,,P155 P_1, \ldots, P_{155} are sitting down on the boundary of a circle C. C. Two birds Pi,Pj P_i, P_j are mutually visible if the angle at centre m() m(\cdot) of their positions m(PiPj)10. m(P_iP_j) \leq 10^{\circ}. Find the smallest number of mutually visible pairs of birds, i.e. minimal set of pairs {x,y} \{x,y\} of mutually visible pairs of birds with x,y{P1,,P155}. x,y \in \{P_1, \ldots, P_{155}\}. One assumes that a position (point) on C C can be occupied simultaneously by several birds, e.g. all possible birds.