The baby brother of: Cutting a square into seven rectangles
Tile a square with five rectangles. Select the lengths of the edges of the rectangles from the set $1$ through $10$, with no length repeated.
Find all possible tilings.
The baby brother of: Cutting a square into seven rectangles
Tile a square with five rectangles. Select the lengths of the edges of the rectangles from the set $1$ through $10$, with no length repeated.
Find all possible tilings.
Here are the solutions
In each example, the dimensions of each rectangle are listed vertical side first.
Square has side length $13$![]()
Square has side length $13$![]()
Square has side length $11$![]()
Square has side length $11$
I think that, up to rotations and reflections, these are the only solutions.
This computer program produces the same answer as the one above. It is written in tinyC, a C-like language.