Tiling with rectangles: Difference between revisions

Revision as of 19:52, 20 March 2017

Revision as of 22:13, 1 August 2017

Line 15:

== Tilings with non-congruent rectangles ==

The smallest square that can be cut into (m × n) rectangles, such that all m and n are different integers, is the 11 × 11 square, and the tiling uses five rectangles.<ref name="x">{{cite journal|last1=Madachy|first1=Joseph S.|title=Solutions to Problems and conjecturesConjectures |journal=Journal of Recreational Mathematics|date=Winter 19961998|volume=2829|issue=1|page=6473|issn=0022-412X}}</ref>