Y by
The Proenc has a new
chess board and requires composing it into rectangles that do not overlap, so that:
(i) each rectangle has as many white squares as black ones;
(ii) there are no two rectangles with the same number of squares.
Determines the maximum value of
for which such a decomposition is possible. For this value of
, determine all possible sets
, where
is the number of rectangle
in squares, for which a decomposition of the board under the conditions intended actions is possible.

(i) each rectangle has as many white squares as black ones;
(ii) there are no two rectangles with the same number of squares.
Determines the maximum value of




