PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: Very high
triangular numbers (Definition)

The triangular numbers are defined by the series

$\displaystyle t_n = \sum_{i=1}^n i $

That is, the $ n$th triangular number is simply the sum of the first $ n$ natural numbers. The first few triangular numbers are

$\displaystyle 1, 3, 6, 10, 15, 21, 28, \ldots $

The name triangular number comes from the fact that the summation defining $ t_n$ can be visualized as the number of dots in

$\displaystyle \begin{matrix} \bullet & & & & & & & \ \bullet & \bullet & & & ... ...et & \bullet & \bullet & & \ \vdots & & & & & \vdots & \ddots & \end{matrix} $

where the number of rows is equal to $ n$.

The closed-form for the triangular numbers is

$\displaystyle t(n) = \frac{n(n+1)}{2} $

Legend has it that a grammar-school-aged Gauss was told by his teacher to sum up all the numbers from 1 to 100. He reasoned that each number $ i$ could be paired up with $ 101-i$, to form a sum of $ 101$, and if this was done $ 100$ times, it would result in twice the actual sum (since each number would get used twice due to the pairing). Hence, the sum would be

$\displaystyle 1+2+3+\cdots+100 = \frac{100(101)}{2} $

The same line of reasoning works to give us the closed form for any $ n$.

Another way to derive the closed form is to assume that the $ n$th triangular number is less than or equal to the $ n$th square (that is, each row is less than or equal to $ n$, so the sum of all rows must be less than or equal to $ n\cdot n$ or $ n^2$), and then use the first few triangular numbers to solve the general 2nd degree polynomial $ An^2 + Bn + C$ for $ A$, $ B$, and $ C$. This leads to $ A=1/2$, $ B=1/2$, and $ C=0$, which is the same as the above formula for $ t(n)$.



"triangular numbers" is owned by akrowne.
(view preamble)

View style:


Attachments:
triangular number counting function (Definition) by PrimeFan
Nicomachus' theorem (Theorem) by PrimeFan
Log in to rate this entry.
(view current ratings)

Cross-references: polynomial, degree, square, line, pairing, Gauss, closed-form, rows, number, natural numbers, sum, series
There are 23 references to this entry.

This is version 2 of triangular numbers, born on 2002-02-02, modified 2002-02-02.
Object id is 1698, canonical name is TriangularNumbers.
Accessed 10441 times total.

Classification:
AMS MSC11A99 (Number theory :: Elementary number theory :: Miscellaneous)
 40-00 (Sequences, series, summability :: General reference works )

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)