Polygonal numbers were first studied during the 6th century BC by the Ancient Greeks, who investigated and discussed properties of oblong, triangular, and square numbers[1]: 1 .
But 10 cannot be arranged as a square. The number 9, on the other hand, can be (see square number):
Some numbers, like 36, can be arranged both as a square and as a triangle (see square triangular number):
By convention, 1 is the first polygonal number for any number of sides. The rule for enlarging the polygon to the next size is to extend two adjacent arms by one point and to then add the required extra sides between those points. In the following diagrams, each extra layer is shown as in red.
Triangular numbers
The triangular number sequence is the representation of the numbers in the form of equilateral triangle arranged in a series or sequence. These numbers are in a sequence of 1, 3, 6, 10, 15, 21, 28, 36, 45, and so on.
Square numbers
Polygons with higher numbers of sides, such as pentagons and hexagons, can also be constructed according to this rule, although the dots will no longer form a perfectly regular lattice like above.
Pentagonal numbers
Hexagonal numbers
Formula
An s-gonal number greater than 1 can be decomposed into s−2 triangular numbers and a natural number.
If s is the number of sides in a polygon, the formula for the nth s-gonal number P(s,n) is
The nth s-gonal number is also related to the triangular numbers Tn as follows:[2]
Thus:
For a given s-gonal number P(s,n) = x, one can find n by
and one can find s by
.
Every hexagonal number is also a triangular number
This shows that the nth hexagonal number P(6,n) is also the (2n − 1)th triangular number T2n−1. We can find every hexagonal number by simply taking the odd-numbered triangular numbers:[2]
1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 66, ...
Table of values
The first 6 values in the column "sum of reciprocals", for triangular to octagonal numbers, come from a published solution to the general problem, which also gives a general formula for any number of sides, in terms of the digamma function.[3]
A property of this table can be expressed by the following identity (see A086270):
with
Combinations
Some numbers, such as 36 which is both square and triangular, fall into two polygonal sets. The problem of determining, given two such sets, all numbers that belong to both can be solved by reducing the problem to Pell's equation. The simplest example of this is the sequence of square triangular numbers.
The following table summarizes the set of s-gonal t-gonal numbers for small values of s and t.
In some cases, such as s = 10 and t = 4, there are no numbers in both sets other than 1.
The problem of finding numbers that belong to three polygonal sets is more difficult. Katayama[5] proved that if three different integers s, t, and u are all at least 3 and not equal to 6, then only finitely many numbers are simultaneously s-gonal, t-gonal, and u-gonal.
Katayama, Furuya, and Nishioka[6] proved that if the integer s is such that or , then the only s-gonal square triangular number is 1. For example, that paper gave the following proof for the case where .[7] Suppose that for some positive integers n, p, and q. A calculation shows that the point defined by is on the curve . That fact forces (as an elliptic curve database[8] confirms), so and the result follows.
The number 1225 is hecatonicositetragonal (s = 124), hexacontagonal (s = 60), icosienneagonal (s = 29), hexagonal, square, and triangular.