MathDB

Each square of

1\times 1

, of a

n\times n

grid is colored using red or blue, in such way that between all the

2\times 2

subgrids, there are all the possible colorations of a

2\times 2

grid using red or blue, (colorations that can be obtained by using rotation or symmetry, are said to be different, so there are 16 possibilities). Find: a) The minimum value of

n

. b) For that value, find the least possible number of red squares.

Problem Statement