A rectangular grid whose side lengths are integers greater than 1 is given. Smaller rectangles with area equal to an odd integer and length of each side equal to an integer greater than 1 are cut out one by one. Finally one single unit is left. Find the least possible area of the initial grid before the cuttings.

2x3 is smallest rectangle possible and four of them fit nicely around a central unit square in a 5x5 rectangle.

Posted by xdog on 2020-12-31 11:43:35