A rectangle has corners at the points (0,0), (5,0), (5,1), and (0,1). How many ways can it be tiled with triangles of area 1/2 and with vertices on lattice points?
This problem was adapted from one from the 2014 ARML competition.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Notice that any triangle that is part of the tiling of the rectangle has one line segment on either the top or bottom side of the rectangle, and a vertex on the opposite side as the line segment. Thus we can express any tiling of the rectangle as a string of bottom-top line segments, as look at the rectangle from left to right. Since there are exactly 10 triangles that must be used to tile the rectangle, and 5 of which must be on each of the bottom and top of the rectangle, there are exactly 10 choose 5 ways of ordering the top and bottom triangles, and thus exactly 10 choose 5 ways to tile the rectangle.