Triangular number
A triangular number or triangle number counts objects arranged in an equilateral triangle. Triangular numbers are a type of figurate number, other examples being square numbers and cube numbers. The Template:Mvarth triangular number is the number of dots in the triangular arrangement with Template:Mvar dots on each side, and is equal to the sum of the Template:Mvar natural numbers from 1 to Template:Mvar. The first 100 terms sequence of triangular numbers, starting with the 0th triangular number, are Template:Block indent (sequence A000217 in the OEIS)
FormulaEdit
Template:Pascal triangle simplex numbers.svg The triangular numbers are given by the following explicit formulas: Template:Bi{2} = \frac{n(n+1)}{2} \\ &= {n+1 \choose 2} \end{align}</math>}} where <math>\textstyle {n+1 \choose 2}</math> is notation for a binomial coefficient. It represents the number of distinct pairs that can be selected from Template:Math objects, and it is read aloud as "Template:Mvar plus one choose two".
The fact that the <math>n</math>th triangular number equals <math>n(n+1)/2</math> can be illustrated using a visual proof.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> For every triangular number <math>T_n</math>, imagine a "half-rectangle" arrangement of objects corresponding to the triangular number, as in the figure below. Copying this arrangement and rotating it to create a rectangular figure doubles the number of objects, producing a rectangle with dimensions <math>n \times (n+1)</math>, which is also the number of objects in the rectangle. Clearly, the triangular number itself is always exactly half of the number of objects in such a figure, or: <math>T_n = \frac{n(n+1)}{2} </math>. The example <math>T_4</math> follows:
This formula can be proven formally using mathematical induction.<ref>Template:Cite book</ref> It is clearly true for <math>1</math>:
<math display=block>T_1 = \sum_{k=1}^{1}k = \frac{1(1 + 1)}{2} = \frac{2}{2} = 1.</math>
Now assume that, for some natural number <math>m</math>, <math>T_m = \sum_{k=1}^{m}k = \frac{m(m + 1)}{2}</math>. We can then verify it for <math>m+1</math>: <math display=block> \begin{align}
\sum_{k=1}^{m+1}k &= \sum_{k=1}^{m}k + (m + 1) \\
&= \frac{m(m + 1)}{2} + m + 1\\
&= \frac{m^2 + m}{2} + \frac{2m + 2}{2}\\
&= \frac{m^2 + 3m + 2}{2}\\
&= \frac{(m + 1)(m + 2)}{2},
\end{align} </math>
so if the formula is true for <math>m</math>, it is true for <math>m+1</math>. Since it is clearly true for <math>1</math>, it is therefore true for <math>2</math>, <math>3</math>, and ultimately all natural numbers <math>n</math> by induction.
The German mathematician and scientist, Carl Friedrich Gauss, is said to have found this relationship in his early youth, by multiplying Template:Math pairs of numbers in the sum by the values of each pair Template:Math.<ref name=Gauss>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> However, regardless of the truth of this story, Gauss was not the first to discover this formula, and some find it likely that its origin goes back to the Pythagoreans in the 5th century BC.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> The two formulas were described by the Irish monk Dicuil in about 816 in his Computus.<ref>Template:Cite journal</ref> An English translation of Dicuil's account is available.<ref>Template:Cite journal</ref>
Occasionally it is necessary to compute large triangular numbers where the standard formula t = n*(n+1)/2 would suffer integer overflow before the final division by 2. For example, Template:Math = 210 < 256, so will fit into an 8-bit byte, but not the intermediate product 420. This can be solved by dividing either Template:Mvar or Template:Mvar by 2 before the multiplication, whichever is even. This does not require a conditional branch if implemented as t = (n|1) * ((n+1)/2). If n is odd, the binary OR operation n|1 has no effect, so this is equivalent to t = n * ((n+1)/2) and thus correct. If n is even, setting the low bit with n|1 is the same as adding 1, while the 1 added before the division is truncated away, so this is equivalent to t = (n+1) * (n/2) and also correct.
Relations to other figurate numbersEdit
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, since:<ref>Template:Cite journal</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }} See equations 18 - 20.</ref>
- <math>T_{n - 1} + T_{n}</math>
- <math>= \frac{1}{2} \, n(n-1) + \frac{1}{2} \, n (n + 1)</math>
- <math>= \frac{1}{2} \, n\Bigl((n - 1) + (n + 1)\Bigr)</math>
- <math>= n^2</math>
with the sum being the square of the difference between the two (and thus the difference of the two being the square root of the sum): <math display="block">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 \vphantom{\left(n-1\right)^2}}{2} \right ) = \left (\frac{n^2}{2} + \frac{n}{2}\right) + \left(\frac{n^2}{2} - \frac{n}{2} \right ) = n^2 = (T_n - T_{n-1})^2.</math>
This property, colloquially known as the theorem of Theon of Smyrna,<ref>Template:Cite book</ref> is visually demonstrated in the following sum, which represents <math>T_{4} + T_{5} = 5^2</math> as digit sums:
<math>\begin{array}{ccccccc}
& 4 & 3 & 2 & 1 & \\
+ & 1 & 2 & 3 & 4 & 5 \\ \hline
& 5 & 5 & 5 & 5 & 5
\end{array}</math>
This fact can also be demonstrated graphically by positioning the triangles in opposite directions to create a square: Template:Bi
The double of a triangular number, as in the visual proof from the above section Template:Section link, is called a pronic number.
There are infinitely many triangular numbers that are also square numbers; e.g., 1, 36, 1225. Some of them can be generated by a simple recursive formula: <math display=block>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 display=block>S_n = 34S_{n-1} - S_{n-2} + 2</math> with <math>S_0 = 0</math> and <math>S_1 = 1.</math>
Also, the [[squared triangular number|square of the Template:Mvarth triangular number]] is the same as the sum of the cubes of the integers 1 to Template:Mvar. This can also be expressed as <math display="block"> \sum_{k=1}^n k^3 = \left(\sum_{k=1}^n k \right)^2.</math>
The sum of the first Template:Mvar triangular numbers is the Template:Mvarth tetrahedral number: <math display=block> \sum_{k=1}^n T_k = \sum_{k=1}^n \frac{k(k+1)}{2} = \frac {n(n+1)(n+2)} {6}.</math>
More generally, the difference between the Template:Mvarth [[polygonal number|Template:Mvar-gonal number]] and the Template:Mvarth Template:Math-gonal number is the Template:Mathth 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 Template:Mvarth centered Template:Mvar-gonal number is obtained by the formula <math display=block>Ck_n = kT_{n-1}+1</math>
where Template:Mvar is a triangular number.
The positive difference of two triangular numbers is a trapezoidal number.
The pattern found for triangular numbers <math> \sum_{n_1=1}^{n_2}n_1=\binom{n_2+1}{2}</math> and for tetrahedral numbers <math> \sum_{n_2=1}^{n_3}\sum_{n_1=1}^{n_2} n_1=\binom{n_3+2}{3},</math> which uses binomial coefficients, can be generalized. This leads to the formula:<ref>Template:Cite journal</ref> <math display=block> \sum_{n_{k-1}=1}^{n_k}\sum_{n_{k-2}=1}^{n_{k-1}} \dots \sum_{n_2=1}^{n_3}\sum_{n_1=1}^{n_2}n_1 =\binom{n_k+k-1}{k}</math>
Other propertiesEdit
Triangular numbers correspond to the first-degree case of Faulhaber's formula.
Template:Annotated image Alternating triangular numbers (1, 6, 15, 28, ...) are also hexagonal numbers.
Every even perfect number is triangular (as well as hexagonal), given by the formula <math display=block>M_p 2^{p-1} = \frac{M_p (M_p + 1)}2 = T_{M_p}</math> where Template:Mvar is a Mersenne prime. No odd perfect numbers are known; hence, all known perfect numbers are triangular.
For example, the third triangular number is (3 × 2 =) 6, the seventh is (7 × 4 =) 28, the 31st is (31 × 16 =) 496, and the 127th is (127 × 64 =) 8128.
The final digit of a triangular number is 0, 1, 3, 5, 6, or 8, and thus such numbers never end in 2, 4, 7, or 9. A final 3 must be preceded by a 0 or 5; a final 8 must be preceded by a 2 or 7.
In base 10, the digital root of a nonzero 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 9: Template:Block indent
The digital root pattern for triangular numbers, repeating every nine terms, as shown above, is "1, 3, 6, 1, 6, 3, 1, 9, 9".
The converse 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.
If Template:Mvar is a triangular number, Template:Mvar is an odd square, and Template:Math, then Template:Math is also a triangular number. Note that Template:Mvar will always be a triangular number, because Template:Math, which yields all the odd squares are revealed by multiplying a triangular number by 8 and adding 1, and the process for Template:Mvar given Template:Mvar is an odd square is the inverse of this operation. The first several pairs of this form (not counting Template:Math) are: Template:Math, Template:Math, Template:Math, Template:Math, Template:Math, Template:Math, ... etc. Given Template:Mvar is equal to Template:Mvar, these formulas yield Template:Math, Template:Math, Template:Math, Template:Math, and so on.
The sum of the reciprocals of all the nonzero triangular numbers is <math display=block> \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 display=block> \sum_{n=1}^\infty{1 \over {n(n+1)}} = 1 .</math>
In addition, the nth partial sum of this series can be written as Template:Sfrac
Two other formulas regarding triangular numbers are <math display=block>T_{a+b} = T_a + T_b + ab</math> and <math display=block>T_{ab} = T_aT_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. The first formula are relevant to multiplication algorithm#Quarter square multiplication.
In 1796, Gauss discovered that every positive integer is representable as a sum of three triangular numbers, writing in his diary his famous words, "ΕΥΡΗΚΑ! Template:Nowrap". The three triangular numbers are not necessarily distinct, or nonzero; for example 20 = 10 + 10 + 0. This is a special case of the Fermat polygonal number theorem.
The largest triangular number of the form Template:Math is 4095 (see Ramanujan–Nagell equation).
Wacław Franciszek Sierpiński posed the question as to the existence of four distinct triangular numbers in geometric progression. It was conjectured by Polish mathematician Kazimierz Szymiczek to be impossible and was later proven by Fang and Chen in 2007.<ref>Chen, Fang: Triangular numbers in geometric progression</ref><ref>Fang: Nonexistence of a geometric progression that contains four triangular numbers</ref>
Formulas involving expressing an integer as the sum of triangular numbers are connected to theta functions, in particular the Ramanujan theta function.<ref>Template:Cite journal</ref><ref>Template:Cite arXiv</ref>
The number of line segments between closest pairs of dots in the triangle can be represented in terms of the number of dots or with a recurrence relation: <math display=block>L_n = 3 T_{n-1} = 3{n \choose 2};\qquad L_n = L_{n-1} + 3(n-1), ~L_1 = 0.</math>
In the limit, the ratio between the two numbers, dots and line segments is <math display=block>\lim_{n\to\infty} \frac{T_n}{L_n} = \frac{1}{3}.</math>
ApplicationsEdit
The triangular number Template:Mvar solves the handshake problem of counting the number of handshakes if each person in a room with Template:Math people shakes hands once with each person. In other words, the solution to the handshake problem of Template:Mvar people is Template:Math.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>
Equivalently, a fully connected network of Template:Mvar computing devices requires the presence of Template:Math cables or other connections.
A triangular number <math>T_{n} </math> is equivalent to the number of principal rotations in dimension <math>n+1</math>. For example, in five dimensions the number of principal rotations is 10 which is <math>T_{4}</math>.<ref>https://henders.one/2022/05/09/lost-4D-rotation/</ref>
In a tournament format that uses a round-robin group stage, the number of matches that need to be played between Template:Mvar teams is equal to the triangular number Template:Math. For example, a group stage with 4 teams requires 6 matches, and a group stage with 8 teams requires 28 matches. This is also equivalent to the handshake problem and fully connected network problems.
Template:Central polygonal numbers.svg One way of calculating the depreciation of an asset is the sum-of-years' digits method, which involves finding Template:Mvar, where Template:Mvar is the length in years of the asset's useful life. Each year, the item loses Template:Math, where Template:Mvar is the item's beginning value (in units of currency), Template:Mvar is its final salvage value, Template:Mvar is the total number of years the item is usable, and Template:Mvar the current year in the depreciation schedule. Under this method, an item with a usable life of Template:Mvar = 4 years would lose Template:Sfrac of its "losable" value in the first year, Template:Sfrac in the second, Template:Sfrac in the third, and Template:Sfrac in the fourth, accumulating a total depreciation of Template:Sfrac (the whole) of the losable value.
Board game designers Geoffrey Engelstein and Isaac Shalev describe triangular numbers as having achieved "nearly the status of a mantra or koan among game designers", describing them as "deeply intuitive" and "featured in an enormous number of games, [proving] incredibly versatile at providing escalating rewards for larger sets without overly incentivizing specialization to the exclusion of all other strategies".<ref>Template:Cite book</ref>
| Max. pips | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| n | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 |
| Tn | 1 | 3 | 6 | 10 | 15 | 21 | 28 | 36 | 45 | 55 | 66 | 78 | 91 | 105 | 120 | 136 | 153 | 161 | 190 | 210 | 231 | 253 |
Triangular roots and tests for triangular numbersTemplate:AnchorEdit
By analogy with the square root of Template:Mvar, one can define the (positive) triangular root of Template:Mvar as the number Template:Mvar such that Template:Math:<ref name="EulerRoots">Template:Citation</ref> <math display=block>n = \frac{\sqrt{8x+1}-1}{2}</math>
which follows immediately from the quadratic formula. So an integer Template:Mvar is triangular if and only if Template:Math is a square. Equivalently, if the positive triangular root Template:Mvar of Template:Mvar is an integer, then Template:Mvar is the Template:Mvarth triangular number.<ref name="EulerRoots" />
Alternative nameEdit
By analogy with the factorial function, a product whose factors are the integers from 1 to Template:Mvar, Donald Knuth proposed the name Termial function,<ref>Template:TAOCP</ref> with the notation Template:Mvar? for the sum whose terms are the integers from 1 to Template:Mvar (the Template:Mvarth triangular number). Although some other sources use this name and notation,<ref>Template:Citation</ref> they are not in wide use.
See alsoEdit
- 1 + 2 + 3 + 4 + ⋯
- Doubly triangular number, a triangular number whose position in the sequence of triangular numbers is also a triangular number
- Tetractys, an arrangement of ten points in a triangle, important in Pythagoreanism
- Factoriangular number
ReferencesEdit
External linksEdit
- Template:SpringerEOM
- Triangular numbers at cut-the-knot
- There exist triangular numbers that are also square at cut-the-knot
- {{#invoke:Template wrapper|{{#if:|list|wrap}}|_template=cite web
|_exclude=urlname, _debug, id |url = https://mathworld.wolfram.com/{{#if:TriangularNumber%7CTriangularNumber.html}} |title = Triangular Number |author = Weisstein, Eric W. |website = MathWorld |access-date = |ref = Template:SfnRef }}
- Hypertetrahedral Polytopic Roots by Rob Hubbard, including the generalisation to triangular cube roots, some higher dimensions, and some approximate formulas
Template:Figurate numbers Template:Series (mathematics) Template:Classes of natural numbers