Article 6CNBS A Computer-Assisted Proof Solves the ‘Packing Coloring’ Problem

A Computer-Assisted Proof Solves the ‘Packing Coloring’ Problem

by
Kevin Hartnett
from on (#6CNBS)
Story ImageThere'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.
External Content
Source RSS or Atom Feed
Feed Location http://feeds.wired.com/wired/index
Feed Title
Feed Link http://feeds.wired.com/
Reply 0 comments