Problem

Source: Lithuanian TST 2005

Tags: combinatorics unsolved, combinatorics



Find the smallest integer $n$ such that an $n\times n$ square can be partitioned into $40\times 40$ and $49\times 49$ squares, with both types of squares present in the partition, if a) $40|n$; b) $49|n$; c) $n\in \mathbb N$.