Problem

Source: Nigerian Senior Mathematics Olympiad Round 3 problem 4

Tags: combinatorial geometry, Integer, rectangle, grid, combinatorics



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. Ps. Collected here