Problem #WSP-000188

Problems Methods Colouring

Problem

Vincent would like to colour the entire \(3\)-dimensional space in such a way that no two points distance \(1\) apart are of the same colour. Prove that he needs at least \(5\) colours.