### 3.7.236. Smallest square for packing rectangles with distinct sizes

Denotes that a constraint can be used for finding the smallest square where one can pack $n$ rectangles for which all the $2·n$ sizes are distinct integer values. The problem is described in http://www.stetson.edu/~efriedma/mathmagic/0899.html. Figures 3.7.68, 3.7.69 and 3.7.70 present the smallest square (not necessarily optimal) found with $\mathrm{𝚐𝚎𝚘𝚜𝚝}$ for respectively placing 9, 10, 11, 12, 13 and 14 rectangles of distinct sizes.