A Computer-Assisted Proof Solves the ‘Packing Coloring’ Problem
www.wired.com
There’s a surprisingly straightforward answer to how many numbers are needed to fill an infinite grid so that identical numbers never get too close together.