1 / 4
Sum of triangular numbers
Order a print of this model
We calculate the final price from your selected file. You review and accept it before payment.
Saved on this device.
With these 6 pieces, you can prove that Σₙ Tₙ = n·(n+1)·(n+2)/6
- Rating
- 0 / 5
- Likes
- 2
- Downloads
- 23
- Makes
- 0
- Views
- 141
- Reviews
- 0
Updated at source:
Model information
- Source
- Printables
- Category
- Math
- License
- Creative Commons — Attribution
With these 6 pieces, you can build an n·(n+1)·(n+2) solid brick.
The volume of each piece is the sum of the first n triangular numbers.
Therefore, the sum of the first n triangular numbers is:
Σₙ Tₙ = n·(n+1)·(n+2)/6
In the provided STL file, n=6, but you could use the parametric OpenScad file to get any other value.