Slipt checkboard

Consider the decomposition of a checkerboard in \(p\) rectangles that do not intersect and umple the following conditions:

  1. Each rectangle has the same quantity of white and black squares.

  2. There is not two rectangle with the same quatity of squares.

Find the maximum value of \(p\)

×

Problem Loading...

Note Loading...

Set Loading...