MathDB
2008 Korea P1

Source:

August 9, 2015
combinatorics

Problem Statement

Let V=[(x,y,z)∣0≤x,y,z≤2008]V=[(x,y,z)|0\le x,y,z\le 2008] be a set of points in a 3-D space. If the distance between two points is either 1,2,21, \sqrt{2}, 2, we color the two points differently. How many colors are needed to color all points in VV?
Back to ProblemsView on AoPS