ILL 1985 Problem 20
Let be the set of all lattice points (i.e., all points with integer coordinates) in three-dimensional space. Two such points and are called neighbors if . Show that there exists a subset of such that for each , there is exactly one point of among and its neighbors.
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.