Polygonal number

In mathematics, a polygonal number is a number that counts dots arranged in the shape of a regular polygon. These are one type of 2-dimensional figurate numbers.
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.

Definition and examples

The number 10 for example, can be arranged as a triangle :
But 10 cannot be arranged as a square. The number 9, on the other hand, can be :
Some numbers, like 36, can be arranged both as a square and as a triangle :
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.

Formula

If is the number of sides in a polygon, the formula for the th -gonal number is
The th -gonal number is also related to the triangular numbers as follows:
Thus:
For a given -gonal number, one can find by
and one can find by

Every hexagonal number is also a triangular number

Applying the formula above:
to the case of 6 sides gives:
but since:
it follows that:
This shows that the th hexagonal number is also the th triangular number. We can find every hexagonal number by simply taking the odd-numbered triangular numbers:

Table of values

The first six 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.
The On-Line Encyclopedia of Integer Sequences eschews terms using Greek prefixes in favor of terms using numerals.
A property of this table can be expressed by the following identity :
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 -gonal -gonal numbers for small values of and.
In some cases, such as and, 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 proved that if three different integers,, and are all at least 3 and not equal to 6, then only finitely many numbers are simultaneously -gonal, -gonal, and -gonal.
Katayama, Furuya, and Nishioka proved that if the integer is such that or, then the only -gonal square triangular number is 1. For example, that paper gave the following proof for the case where. Suppose that for some positive integers,, and. A calculation shows that the point defined by is on the curve. That fact forces, so and the result follows.
The number 1225 is hecatonicositetragonal, hexacontagonal, icosienneagonal, hexagonal, square, and triangular.