Triangular number
Encyclopedia : T : TR : TRI : Triangular number
A triangular number is a number that can be arranged in the shape of an equilateral triangle. The sequence of triangular numbers (sequence [[OEIS:A000217|A000217]] in OEIS) for n = 1, 2, 3... is:
| 1 | |
| 3 | |
| 6 | |
| 10 |
|
| 15 |
|
| 21 |
|
The formula for the nth triangular number is ½n(n + 1) or (1 + 2 + 3 + ... + [n − 2] + [n − 1] + n).
It is the binomial coefficient
- [ ]
[ \frac ]
yields the number of points that make up the simplex. For example, a tetrahedron with sides of length 2 corresponds to the number (2)(2 + 1)(2 + 2)/6, or 4. The four points forming this configuration are the vertices of the tetrahedron. (Note: A tetrahedron can be created by taking a number, getting the triangle of that number, and then adding to it all the triangles of the numbers before it, so a tetrahedron of 2 would have 2 triangles = 3 plus 1 triangles = 1 = 4.)
One of the most famous triangular numbers is 666, also known as the Number of the Beast. Every even perfect number is triangular.
The sum of two consecutive triangular numbers is a square number. This can be shown mathematically thus: the sum of the nth and (n-1)th triangular numbers is + . This simplifies to (½n2 + ½n) + (½n2 − ½n), and thus to n2. Alternatively, it can be demonstrated diagrammatically, thus:
| 16 |
|
| 25 |
|
More generally, the difference between the nth m-gonal number and the nth (m+1)-gonal number is the (n-1)th triangular number. For example, the sixth heptagonal number (81) minus the sixth hexagonal number (66) equals the fifth triangular number, 15.
Also, the square of a triangular number n is the same as the sum of the cubes of the integers 1 to n.
In base 10, the digital root of a triangular number is always 1, 3, 6 or 9. Hence every triangular number is either divisible by three or has a remainder of 1 when divided by nine:
- 6 = 3×2,
- 10 = 9×1+1,
- 15 = 3×5,
- 21 = 3×7,
- 28 = 9×3+1,
- ...
Knowing the triangular numbers, one can reckon any centered polygonal number. The nth centered k-gonal number is obtained by the formula
[Ck_n = kT_+1]
where T is a triangular number.
There are infinitely many triangular numbers that are also square numbers; e.g., 1, 36. Some of them can be generated by a simple recursive formula:
- [S_ = 4S_n \left( 8S_n + 1\right)] with [S_1 = 1]
- [S_n = 34S_ - S_ + 2] with [S_0 = 0] and [S_1 = 1]
- [T_ = T_ + T_ + ab]
- [T_ = T_T_ + T_T_],
External links
- [Triangular numbers] at cut-the-knot
- [There exist triangular numbers that are also square] at cut-the-knot
- [Mathworld]
From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.





