Problem

Source: China TST 1989, problem 7

Tags: combinatorics unsolved, combinatorics



$1989$ equal circles are arbitrarily placed on the table without overlap. What is the least number of colors are needed such that all the circles can be painted with any two tangential circles colored differently.