GCD = 1

Is it possible to fill the grid with distinct digits from 1 to 9, such that any 2 connected squares have a greatest common divisor of 1?

×

Problem Loading...

Note Loading...

Set Loading...