For what smallest $n$ can a $n \times n$ square be cut into squares $40 \times 40$ and $49 \times 49$ so that squares of both types are present?
Source:
Tags: combinatorics, tiles, combinatorial geometry
For what smallest $n$ can a $n \times n$ square be cut into squares $40 \times 40$ and $49 \times 49$ so that squares of both types are present?