MathDB
Coloring a triangular arrangement of circles

Source: Cono Sur 2003 #5

November 18, 2015
combinatoricscono sur

Problem Statement

Let n=3k+1n=3k+1, where kk is a positive integer. A triangular arrangement of side nn is formed using circles with the same radius, as is shown in the figure for n=7n=7. Determine, for each kk, the largest number of circles that can be colored red in such a way that there are no two mutually tangent circles that are both colored red.