Triangular shapes, triangular numbers
Investigate Consider this set of shapes. Each triangular shape is made up of small equilateral triangles, a new base row of small triangles being added successively. In successive large triangles there are 1, 1 + 3, 1 + 3 + 5, 1 + 3 + 5 + 7, ... small triangles. These numbers are of course the squares or square numbers 1, 4, 9, 16, ... . We are led to the slightly paradoxical situation of squares being generated by equilateral triangles. Can you explain this?
Investigate Next consider the vertices occurring in the above figure:
The number of dots (vertices) in successive triangular arrays is 1, 1 + 2, 1 + 2 + 3, 1 + 2 + 3 + 4, ... or 1, 3, 6, 10, ... . These are the triangular numbers, which consist of the sums of consecutive integers beginning with 1 (which has been added for completeness). Show that the nth triangular number, Tn, is n(n+1)/2.
Investigate Use the triangular numbers up to 100 to test the hypothesis that any positive integer up to 100 is either a triangular number or can be written as the sum of at least two (perhaps equal) triangular numbers. For example, 9 is not a triangular number, but can be written as the sum of triangular numbes 3 and 6. [Hint: There is an obvious trivial solution! Look for sums of as few terms as possible.]
|