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

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

by
Kevin Hartnett
from Feed: All Latest 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: All Latest
Feed Link https://www.wired.com/
Feed Copyright © Condé Nast 2024
Reply 0 comments