Problem

Source: Serbia 2001

Tags: combinatorics unsolved, combinatorics



Determine all positive integers $ n$ for which there is a coloring of all points in space so that each of the following conditions is satisfied: (i) Each point is painted in exactly one color. (ii) Exactly $ n$ colors are used. (iii) Each line is painted in at most two different colors.