Slipt checkboardDiscrete Mathematics Level 3
Consider the decomposition of a checkerboard in \(p\) rectangles that do not intersect and umple the following conditions:
Each rectangle has the same quantity of white and black squares.
There is not two rectangle with the same quatity of squares.
Find the maximum value of \(p\)