Prove it is always possible for a n x n board to be tiled ( where n >=6 is odd and not divisible by 3) using (3-unit) L-shaped tiles, so that one tile always remains empty. What approach should I take? - remainder analysis - induction ? - graphs?
Follow Math Help Forum on Facebook and Google+
View Tag Cloud