Forgot password? New user? Sign up

Existing user? Log in

Use 16 distinct positive integers to fill up the grid, such that the integers in any two connected squares have a greatest common divisor that is greater than 1.

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

Inspiration.

Here is the 5 by 5 version, if you're up for it.

Problem Loading...

Note Loading...

Set Loading...