Divide a square into non-congruent rectangles. If all the sides are integers, what is the smallest possible difference in area between the largest and smallest rectangles? This is known as the Mondrian art problem. This Demonstration shows optimal solutions up to size 57 and best known solutions up to 900.

Up to the square of side 100, check the "analysis" box to see the possible improvements. If all of those possibilities can be checked in a packing program without a new solution turning up, the given solution is optimal.

Can the defect be 0? If the rectangles do not have integer sides, there are many solutions, known as Blanche dissections. Whether there is an integer Blanche dissection is an unsolved question. The defect for square

might be bounded above by

. The quality of a solution is the favorable distance from this upper bound [6,9].

In the variant, a rectangle can be repeated if it has a different orientation. It is is a tiling where no rectangle has a direct translation to another rectangle. The upper bound seems to be

. Solutions up to size 45 are optimal.