« Vrati se
Let {n} and k be positive integers. There are given {n} circles in the plane. Every two of them intersect at two distinct points, and all points of intersection they determine are pairwisely distinct (i. e. no three circles have a common point). No three circles have a point in common. Each intersection point must be colored with one of n distinct colors so that each color is used at least once and exactly k distinct colors occur on each circle. Find all values of n\geq 2 and k for which such a coloring is possible.

Slični zadaci

#NaslovOznakeRj.KvalitetaTežina
2278IMO Shortlist 2008 problem G212
2163IMO Shortlist 2004 problem G213
2133IMO Shortlist 2003 problem G214
2127IMO Shortlist 2003 problem C22
2051IMO Shortlist 2000 problem G17
2025IMO Shortlist 1999 problem G20