Skip to content
Surf Wiki
Save to docs
general/figurate-numbers

From Surf Wiki (app.surf) — the open knowledge base

Polygonal number

Type of figurate number

Polygonal number

Type of figurate 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 (see triangular number):

:{| |}

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):

:{| cellpadding="5" |- align="center" valign="bottom" |}

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

:[[File:Polygonal Number 3.gif|500px|none]]

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

:[[File:Polygonal Number 4.gif|500px|none]]

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

:[[File:Polygonal Number 5.gif|500px|none]]

Hexagonal numbers

:[[File:Polygonal Number 6.gif|500px|none]]

Formula

''P''(''s'',''n'')}} is

:P(s,n) = \frac{(s-2)n^2-(s-4)n}{2}

The nth s-gonal number is also related to the triangular numbers T**n as follows:

:P(s,n) = (s-2)T_{n-1} + n = (s-3)T_{n-1} + T_n, .

Thus:

:\begin{align} P(s,n+1)-P(s,n) &= (s-2)n + 1, ,\ P(s+1,n) - P(s,n) &= T_{n-1} = \frac{n(n-1)}{2}, ,\ P(s+k,n) - P(s,n) &= k T_{n-1} = k\frac{n(n-1)}{2}, . \end{align}

For a given s-gonal number , one can find n by

:n = \frac{\sqrt{8(s-2)x+{(s-4)}^2}+(s-4)}{2(s-2)}

and one can find s by

:s = 2+\frac{2}{n}\cdot\frac{x-n}{n-1}.

Every hexagonal number is also a triangular number

Applying the formula above: :P(s,n) = (s-2)T_{n-1} + n

to the case of 6 sides gives: :P(6,n) = 4T_{n-1} + n

but since: :T_{n-1} = \frac{n(n-1)}{2}

it follows that: :P(6,n) = \frac{4n(n-1)}{2} + n = \frac{2n(2n-1)}{2} = T_{2n-1}

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:

:1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 66, ...

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.

sNameFormulanSum of reciprocalsOEIS number12345678910
2Natural (line segment)12345678910∞ (diverges)
3Triangular(n2 + n)136101521283645552
4Square149162536496481100
5Pentagonal(3n2 − n)151222355170921171453 ln 3 −
6Hexagonal1615284566911201531902 ln 2
7Heptagonal(5n2 − 3n)1718345581112148189235\begin{matrix}
8Octagonal1821406596133176225280ln 3 +
9Nonagonal(7n2 − 5n)19244675111154204261325
10Decagonal110275285126175232297370ln 2 +
11Hendecagonal(9n2 − 7n)111305895141196260333415
12Dodecagonal(10n2 − 8n)1123364105156217288369460
13Tridecagonal(11n2 − 9n)1133670115171238316405505
14Tetradecagonal(12n2 − 10n)1143976125186259344441550ln 2 + ln 3 +
15Pentadecagonal(13n2 − 11n)1154282135201280372477595
16Hexadecagonal(14n2 − 12n)1164588145216301400513640
17Heptadecagonal(15n2 − 13n)1174894155231322428549685
18Octadecagonal(16n2 − 14n)11851100165246343456585730ln 2 − ln (3 − 2) +
19Enneadecagonal(17n2 − 15n)11954106175261364484621775
20Icosagonal(18n2 − 16n)12057112185276385512657820
21Icosihenagonal(19n2 − 17n)12160118195291406540693865
22Icosidigonal(20n2 − 18n)12263124205306427568729910
23Icositrigonal(21n2 − 19n)12366130215321448596765955
24Icositetragonal(22n2 − 20n)124691362253364696248011000
** =

The On-Line Encyclopedia of Integer Sequences eschews terms using Greek prefixes (e.g., "octagonal") in favor of terms using numerals (i.e., "8-gonal").

A property of this table can be expressed by the following identity (see ):

:2,P(s,n) = P(s+k,n) + P(s-k,n),

with

:k = 0, 1, 2, 3, ..., s-3.

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. :{| class="wikitable" border="1" |- ! s ! t ! Sequence ! OEIS number |- |4 |3 |1, 36, 1225, 41616, 1413721, 48024900, 1631432881, 55420693056, 1882672131025, 63955431761796, 2172602007770041, 73804512832419600, 2507180834294496361, 85170343853180456676, 2893284510173841030625, 98286503002057414584576, 3338847817559778254844961, ... | |- |5 |3 |1, 210, 40755, 7906276, 1533776805, 297544793910, 57722156241751, 11197800766105800, 2172315626468283465, … | |- |5 |4 |1, 9801, 94109401, 903638458801, 8676736387298001, 83314021887196947001, 799981229484128697805801, ... | |- |6 |3 |All hexagonal numbers are also triangular. | |- |6 |4 |1, 1225, 1413721, 1631432881, 1882672131025, 2172602007770041, 2507180834294496361, 2893284510173841030625, 3338847817559778254844961, 3853027488179473932250054441, ... | |- |6 |5 |1, 40755, 1533776805, … | |- |7 |3 |1, 55, 121771, 5720653, 12625478965, 593128762435, 1309034909945503, 61496776341083161, 135723357520344181225, 6376108764003055554511, 14072069153115290487843091, … | |- |7 |4 |1, 81, 5929, 2307361, 168662169, 12328771225, 4797839017609, 350709705290025, 25635978392186449, 9976444135331412025, … | |- |7 |5 |1, 4347, 16701685, 64167869935, … | |- |7 |6 |1, 121771, 12625478965, … | |- |8 |3 |1, 21, 11781, 203841, … | |- |8 |4 |1, 225, 43681, 8473921, 1643897025, 318907548961, 61866420601441, 12001766689130625, 2328280871270739841, 451674487259834398561, 87622522247536602581025, 16998317641534841066320321, … | |- |8 |5 |1, 176, 1575425, 234631320, … | |- |8 |6 |1, 11781, 113123361, … | |- |8 |7 |1, 297045, 69010153345, … | |- |9 |3 |1, 325, 82621, 20985481, … | |- |9 |4 |1, 9, 1089, 8281, 978121, 7436529, 878351769, 6677994961, 788758910641, 5996832038649, 708304623404049, 5385148492712041, 636056763057925561, ... | |- |9 |5 |1, 651, 180868051, … | |- |9 |6 |1, 325, 5330229625, … | |- |9 |7 |1, 26884, 542041975, … | |- |9 |8 |1, 631125, 286703855361, … | |- |}

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{{cite journal

Katayama, Furuya, and Nishioka{{cite journal |access-date = July 12, 2025

The number 1225 is hecatonicositetragonal (), hexacontagonal (), icosienneagonal (), hexagonal, square, and triangular.

Notes

References

Bibliography

  • The Penguin Dictionary of Curious and Interesting Numbers, David Wells (Penguin Books, 1997) [].

References

  1. (2012-12-06). "The Book of Numbers". Springer Science & Business Media.
  2. "Sums of Reciprocals of Polygonal Numbers and a Theorem of Gauss".
  3. "Beyond the Basel Problem: Sums of Reciprocals of Figurate Numbers".
  4. Ibid., p. 4.
Info: Wikipedia Source

This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.

Want to explore this topic further?

Ask Mako anything about Polygonal number — get instant answers, deeper analysis, and related topics.

Research with Mako

Free with your Surf account

Content sourced from Wikipedia, available under CC BY-SA 4.0.

This content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.

Report