Triangular number
From Wikipedia, the free encyclopedia
A triangular number is the sum of the n natural numbers from 1 to n. Triangular numbers are so called because they describe numbers of objects that can be arranged in a triangle. The nth triangular number is given by
- <math>
T_n=\sum_{k=1}^n k = 1+2+3+ \dotsb +(n-2)+(n-1)+n = \frac{n(n+1)}{2} = \frac{n^2+n}{2} = {n+1 \choose 2}.
</math> As shown in the rightmost term of this formula, every triangular number is a binomial coefficient: the nth triangular is the number of distinct pairs to be selected from n + 1 objects. In this form it solves the 'handshake problem' of counting the number of handshakes if each person in a room shakes hands once with each other person.
The sequence of triangular numbers (sequence A000217 in OEIS) for n = 1, 2, 3... is:
Contents |
[edit] Relations to other figurate numbers
Triangular numbers have a wide variety of relations to other figurate numbers.
Most simply, the sum of two consecutive triangular numbers is a square number. Algebraically,
- <math>T_n + T_{n-1} = \left (\frac{n^2}{2} + \frac{n}{2}\right) + \left(\frac{\left(n-1\right)^2}{2} + \frac{n-1}{2} \right ) = \left (\frac{n^2}{2} + \frac{n}{2}\right) + \left(\frac{n^2}{2} - \frac{n}{2} \right ) = n^2.</math>
Alternatively, the same fact can be demonstrated graphically:
| 16 | Image:Square triangle sum 16.png | 25 | Image:Square triangle sum 25.png |
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:
- <math>S_{n+1} = 4S_n \left( 8S_n + 1\right)</math> with <math>S_1 = 1</math>
All square triangular numbers are found from the recursion
- <math>S_n = 34S_{n-1} - S_{n-2} + 2</math> with <math>S_0 = 0</math> and <math>S_1 = 1</math>
Also, the square of the nth triangular number is the same as the sum of the cubes of the integers 1 to n.
The sum of the n first triangular numbers is the nth tetrahedral number,
- <math> \frac {(n)(n+1)(n+2)} {6}.</math>
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. Every other triangular number is a hexagonal number. Knowing the triangular numbers, one can reckon any centered polygonal number: the nth centered k-gonal number is obtained by the formula
- <math>Ck_n = kT_{n-1}+1</math>
where T is a triangular number.
[edit] Other properties
Every even perfect number is triangular, and no odd perfect numbers are known, hence all known perfect numbers are triangular.
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,
- ...
The inverse of the statement above is, however, not always true. For example, the digital root of 12, which is not a triangular number, is 3 and divisible by three.
The sum of the reciprocals of all the triangular numbers is:
- <math> \!\ \sum_{n=1}^{\infty}{1 \over {{n^2 + n} \over 2}} = 2\sum_{n=1}^{\infty}{1 \over {n^2 + n}} = 2 </math>
This can be shown by using the basic sum of a telescoping series:
- <math> \!\ \sum_{n=1}^{\infty}{1 \over {n(n+1)}} = 1 </math>
Two other interesting formulas regarding triangular numbers are:
- <math>T_{a+b} = T_{a} + T_{b} + ab</math>
and
- <math>T_{ab} = T_{a}T_{b} + T_{a-1}T_{b-1},</math>
both of which can easily be established either by looking at dot patterns (see above) or with some simple algebra.
In 1796, German mathematician and scientist Carl Friedrich Gauss discovered that every positive integer is representable as a sum of at most three triangular numbers, writing in his diary his famous words, "Heureka! num= Δ + Δ + Δ." Note that this theorem does not imply that the triangular numbers are different (as in the case of 20=10+10), nor that a solution with three nonzero triangular numbers must exist. This is a special case of Fermat's Polygonal Number Theorem.
[edit] Tests for triangular numbers
One can efficiently test whether a positive integer x is a triangular number by computing
- <math>n = \frac{\sqrt{8x+1}-1}{2}.</math>
If n is an integer, then x is the nth triangular number. If n is not an integer, then x is not triangular.
[edit] External links
- Triangular numbers at cut-the-knot
- There exist triangular numbers that are also square at cut-the-knot
- Mathworldca:Nombre triangular
da:Trekanttal de:Dreieckszahl es:Número triangular fr:Nombre triangulaire ko:삼각수 it:Numero triangolare he:מספר משולשי la:Numerus triangularis hu:Háromszögszámok nl:Driehoeksgetal ja:三角数 pl:Liczba trójkątna pt:Número triangular ru:Треугольное число sl:Trikotniško število fi:Kolmioluku sv:Triangeltal ta:முக்கோண எண் tr:Üçgensel sayı zh:三角形數
