Y by Adventure10, Mango247, ItsBesi
Consider decompositions of an chessboard into non-overlapping rectangles subject to the following conditions:
(i) Each rectangle has as many white squares as black squares.
(ii) If is the number of white squares in the -th rectangle, then .
Find the maximum value of for which such a decomposition is possible. For this value of , determine all possible sequences .
(i) Each rectangle has as many white squares as black squares.
(ii) If is the number of white squares in the -th rectangle, then .
Find the maximum value of for which such a decomposition is possible. For this value of , determine all possible sequences .