polygonal number

figurate number

Uses your system voice; voice and rate in settings.

Q836270Snapshot

≈ 3 min read

Names in other languages

  • eoplurlatera nombro
  • Englishpolygonal number
  • Françaisnombre polygonal
  • Portuguêsnúmero poligonal
  • עבריתמספר מצולע
  • 简体中文多边形数
  • 繁體中文多邊形數
  • 中文多邊形數

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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.

With squares for the Nth and diff we start at the first square 1 and a diff (or offset) of 1. For the next square the difference is first incremented by 2: 1+2=3. We then add the difference to the current square: 1+3=4.

The 2nd square number. Continuing the pattern for Nth+diff: 4+5=9, 9+7=16, 16+9=25. In other words, for the Nth polygonal number the difference between it and the next is X * N + 1.

Where X is the number of sides (beginning at 1 for triangular). If is the number of sides in a polygon, the formula for the th -gonal number is P(s,n) = \frac{(s-2)n^2-(s-4)n}{2} The th -gonal number is also related to the triangular numbers 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 -gonal number , one can find by n = \frac{\sqrt{8(s-2)x+{(s-4)}^2}+(s-4)}{2(s-2)} and one can find by s = 2+\frac{2}{n}\cdot\frac{x-n}{n-1} . 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 th hexagonal number is also the th triangular number .

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, ... 2\,P(s,n) = P(s+k,n) + P(s-k,n), with k = 0, 1, 2, 3, ..., s-3. Katayama, Furuya, and Nishioka proved that if the integer is such that s=5 or 7\le s\le 12 , then the only -gonal square triangular number is 1.

For example, that paper gave the following proof for the case where s=5 . Suppose that P(3,n)=P(4,p)=P(5,q) for some positive integers , , and . A calculation shows that the point (x,y) defined by (x,y)=(48p^{2}+3,24p(2n+1)(6q-1)) is on the curve Y^{2}=X^{3}-X^{2}-9X+9 .

That fact forces (x,y)=(51,360) (as an elliptic curve database confirms), so p=1 and the result follows. The number 1225 is hecatonicositetragonal ( ), hexacontagonal ( ), icosienneagonal ( ), hexagonal, square, and triangular. Polygonal Numbers: Every s-polygonal number between 1 and 1000 clickable for 2<=s<=337 Polygonal Number Counting Function

Text derived from https://en.wikipedia.org/w/index.php?oldid=1369421143 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot polygonal-number-096176-8726b61c47df7e31 · hash 8726b61c47df7e31e7a36cf9b87c0ad7709e8c8b49ce71aefaf1428d9cbd8fbe · captured 2026-08-14 · not yet sealed in the ledger · verify the chain · version history

Cite this page as: encyclopegia.org, “polygonal number”, snapshot polygonal-number-096176-8726b61c47df7e31. https://encyclopegia.org/a/polygonal-number

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.