Problem:
A grid of unit squares is partitioned into pairwise incongruent rectangles with sides lying on the gridlines. Find the maximum possible value of the product of their areas.
Problem:
A grid of unit squares is partitioned into pairwise incongruent rectangles with sides lying on the gridlines. Find the maximum possible value of the product of their areas.
Solution:
The greatest possible value for the product is , achieved when the rectangles are , , , , . To see that this is possible, orient these rectangles so that the first number is the horizontal dimension and the second number is the vertical dimension. Then, place the bottom-left corners of these rectangles at , , , , respectively on the grid.
We will now prove that no larger product can be achieved. Suppose that there is at least one rectangle of area at most . Then the product is at most by AM-GM. Now suppose that there is at least one rectangle of area at least . Then the product is at most by AM-GM. (Neither of these is tight, since you cannot have non-integer areas, nor can you have four rectangles all of area .)
Now consider the last possibility that is not covered by any of the above: that there are no rectangles of size at most and no rectangles of area at least . There can be at most one rectangle of area each, at most two rectangles of area , and no rectangles of area . The only way to achieve a sum of with these constraints is , which produces a product of . We have shown through the earlier cases that a larger product cannot be achieved, so this is indeed the maximum.