Tiling with rectangles: Difference between revisions

Revision as of 22:11, 1 March 2017

Revision as of 21:54, 3 March 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=Problems and conjectures |journal=Journal of Recreational Mathematics|date=Winter 1996|volume=28|issue=1|pagespage=61-64|issn=0022-412X}}</ref>

<ref name="y">{{cite journal|last1=Madachy|first1=Joseph S|title=Solutions to problems and conjectures |journal=Journal of Recreational Mathematics|date=Winter 1996|volume=28|issue=1|pages=65-78|issn=0022-412X}}</ref>

The smallest rectangle that can be cut into (m × n) rectangles, such that all m and n are different integers, is the 9 × 13 rectangle, and the tiling uses five rectangles.<ref name="x" /><ref name="y"/>

==See also==