The diagram shows an equilateral triangle of side length , made by tessellating smaller equilateral triangles of side length . How many such triangles would a larger equilateral triangle of side length contain?
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.
Let's take a visual approach to this problem. Consider what we would get if we stuck an identical, flipped triangle onto a side of the original triangle:
This creates a parallelogram made up of smaller parallelograms of side length 1 c m . Clearly there are 3 2 = 9 small parallelograms in this example. Each parallelogram is formed by two equilateral triangles of side length 1 c m , so there are 2 ∗ 3 2 small triangles in the diagram. Since the parallelogram is made up of two identical triangles, there are 2 2 ∗ 3 2 = 3 2 smaller triangles in the example triangle. Thus, the number of smaller triangles in a larger triangle of side length n c m , where n ∈ Z , is simply n 2 . This is perhaps more obvious when we 'skew' the parallelogram horizontally to form a square:
There is also a numerical way of solving this problem. Consider the result of counting the number of smaller triangles in each row of the larger example triangle:
Since each row adds two smaller triangles from the previous row, and the first row has 1 such triangle, we can express the number of triangles in the n t h row as 2 n − 1 . Recall the formula for the the n t h triangle number: 2 1 n ( n + 1 ) . We can use this formula to work out the total small triangles in a larger triangle of side length n c m . Since the number of triangles in the n t h row is 2 n − 1 , we can include the − 1 part in the triangle number formula by subtracting n ( n lots of − 1 = − n ), which gives 2 1 n ( n + 1 ) − n . To deal with the 2 n part, remember that the triangle number works for a triangle with n items in the n t h row, so we simply multiply the part of the formula concerned with n by 2 , giving n ( n + 1 ) − n as a formula for the number of equilateral triangles of side length 1 c m that can fit into a larger triangle of side length n c m . Multiplying out the bracket gives: n 2 + n − n = n 2 . Therefore the answer to the question is 1 2 5 2 = 1 5 6 2 5 .
■