Skip to main content ↑ ↓
Topic: A co*puter-Assisted Proof Solves the ‘Packing Coloring’ Problem (Read 13 times) previous topic - next topic

A co*puter-Assisted Proof Solves the ‘Packing Coloring’ Problem

A co*puter-Assisted Proof Solves the ‘Packing Coloring’ Problem

[html]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.[/html]

Source: A co*puter-Assisted Proof Solves the ‘Packing Coloring’ Problem (http://ht**://www.wired.c**/story/a-co*puter-assisted-proof-solves-the-packing-coloring-problem/)