There are 2005 young people sitting around a large circular table. Of these, at most 668 are boys. We say that a girl G has a strong position, if, counting from G in either direction, the number of girls is always strictly larger than the number of boys (G is herself included in the count). Prove that there is always a girl in a strong position. combinatorics proposedcombinatorics