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 Wired https://ift.tt/rT9Uf7s

Comments

Popular posts from this blog

Tableau launches new enterprise plans, big data tools

Galaxy Book 3 leak spills the beans on the latest Samsung laptops