A Computer-Assisted Proof Solves the Packing Coloring Problem

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.

from Feed: All Latest https://ift.tt/1ImdWo9