A Computer-Assisted Proof Solves the ‘Packing Coloring’ ProblemThere’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.
Powered by WPeMatico
https://www.wired.com/feedFeed: All LatestChannel DescriptionTechnology124Kevin Hartnett