A triangle can be cut into congruent smaller triangles by lines parallel to its sides.
What is the sum of all possible positive integers
Note : The lines must cut the larger triangle into smaller triangles—they cannot create any other kinds of polygons.
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.
The first thing to notice is that you need an equal amount of lines in each direction to slice the triangle into congruent parts.
Then you can try out the different possibilities. One line in every direction slices into 4 equal parts (the original example). 2 lines slice into 9 parts, and 3 lines into 16, 4 lines into 25. A pattern emerges: n lines per direction slice up the triangle into ( n − 1 ) 2 parts. The most triangles for this given problem is exactly 100 using 9 lines in every direction.
To get to the solution you just have to add up all square numbers ≤ 1 0 0 (leaving out 1, because that is not slicing the triangle at all). So:
N = 2 2 + 3 2 + 4 2 + 5 2 + 6 2 + 7 2 + 8 2 + 9 2 + 1 0 2
N = 4 + 9 + 1 6 + 2 5 + 3 6 + 4 9 + 6 4 + 8 1 + 1 0 0
N = 3 8 4