Inspired by Chung Kevin

Use distinct positive integers to fill in the grid such that any 2 connected squares have a greatest common divisor that is not 1.

What is the smallest possible value of the largest positive integer used?

×

Problem Loading...

Note Loading...

Set Loading...