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

F1 live stream: how to watch every 2021 Grand Prix online from anywhere

Best blogging sites of 2021: Free and paid blog platforms

Tableau launches new enterprise plans, big data tools