Hubbry Logo
Polygonal numberPolygonal numberMain
Open search
Polygonal number
Community hub
Polygonal number
logo
7 pages, 0 posts
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
Polygonal number
Polygonal number
from Wikipedia

In mathematics, a polygonal number is a number that counts dots arranged in the shape of a regular polygon.[1]: 2-3  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.[1]: 1 

Definition and examples

[edit]

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

******
******
******
******
******
******
*
**
***
****
*****
******
*******
********

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

[edit]

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

[edit]

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

[edit]

Hexagonal numbers

[edit]

Formula

[edit]
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

[edit]
Proof without words that hexagonal numbers are odd-sided triangular numbers
Proof without words that hexagonal numbers are odd-sided triangular numbers

Applying the formula above:

to the case of 6 sides gives:

but since:

it follows that:

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

[edit]

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.[3]

s Name Formula n Sum of reciprocals[3][4] OEIS number
1 2 3 4 5 6 7 8 9 10 11
2 Natural (line segment) 1/2(0n2 + 2n) = n 1 2 3 4 5 6 7 8 9 10 11 ∞ (diverges) A000027
3 Triangular 1/2(n2 + n) 1 3 6 10 15 21 28 36 45 55 66 2[3] A000217
4 Square 1/2(2n2 − 0n)
= n2
1 4 9 16 25 36 49 64 81 100 121 π2/6[3][α] A000290
5 Pentagonal 1/2(3n2n) 1 5 12 22 35 51 70 92 117 145 176 3 ln 3 − π3/3[3] A000326
6 Hexagonal 1/2(4n2 − 2n)
= 2n2n
1 6 15 28 45 66 91 120 153 190 231 2 ln 2[3] A000384
7 Heptagonal 1/2(5n2 − 3n) 1 7 18 34 55 81 112 148 189 235 286 [3] A000566
8 Octagonal 1/2(6n2 − 4n)
= 3n2 − 2n
1 8 21 40 65 96 133 176 225 280 341 3/4 ln 3 + π3/12[3] A000567
9 Nonagonal 1/2(7n2 − 5n) 1 9 24 46 75 111 154 204 261 325 396 A001106
10 Decagonal 1/2(8n2 − 6n)
= 4n2 − 3n
1 10 27 52 85 126 175 232 297 370 451 ln 2 + π/6 A001107
11 Hendecagonal 1/2(9n2 − 7n) 1 11 30 58 95 141 196 260 333 415 506 A051682
12 Dodecagonal 1/2(10n2 − 8n) 1 12 33 64 105 156 217 288 369 460 561 A051624
13 Tridecagonal 1/2(11n2 − 9n) 1 13 36 70 115 171 238 316 405 505 616 A051865
14 Tetradecagonal 1/2(12n2 − 10n) 1 14 39 76 125 186 259 344 441 550 671 2/5 ln 2 + 3/10 ln 3 + π3/10 A051866
15 Pentadecagonal 1/2(13n2 − 11n) 1 15 42 82 135 201 280 372 477 595 726 A051867
16 Hexadecagonal 1/2(14n2 − 12n) 1 16 45 88 145 216 301 400 513 640 781 A051868
17 Heptadecagonal 1/2(15n2 − 13n) 1 17 48 94 155 231 322 428 549 685 836 A051869
18 Octadecagonal 1/2(16n2 − 14n) 1 18 51 100 165 246 343 456 585 730 891 4/7 ln 2 − 2/14 ln (3 − 22) + π(1 + 2)/14 A051870
19 Enneadecagonal 1/2(17n2 − 15n) 1 19 54 106 175 261 364 484 621 775 946 A051871
20 Icosagonal 1/2(18n2 − 16n) 1 20 57 112 185 276 385 512 657 820 1001 A051872
21 Icosihenagonal 1/2(19n2 − 17n) 1 21 60 118 195 291 406 540 693 865 1056 A051873
22 Icosidigonal 1/2(20n2 − 18n) 1 22 63 124 205 306 427 568 729 910 1111 A051874
23 Icositrigonal 1/2(21n2 − 19n) 1 23 66 130 215 321 448 596 765 955 1166 A051875
24 Icositetragonal 1/2(22n2 − 20n) 1 24 69 136 225 336 469 624 801 1000 1221 A051876
s = 25 1/2(23n221n) 1 25 72 142 235 351 490 652 837 1045 1276

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

with

Combinations

[edit]

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.

s t Sequence OEIS number
4 3 1, 36, 1225, 41616, 1413721, 48024900, 1631432881, 55420693056, 1882672131025, 63955431761796, 2172602007770041, 73804512832419600, 2507180834294496361, 85170343853180456676, 2893284510173841030625, 98286503002057414584576, 3338847817559778254844961, ... A001110
5 3 1, 210, 40755, 7906276, 1533776805, 297544793910, 57722156241751, 11197800766105800, 2172315626468283465, … A014979
5 4 1, 9801, 94109401, 903638458801, 8676736387298001, 83314021887196947001, 799981229484128697805801, ... A036353
6 3 All hexagonal numbers are also triangular. A000384
6 4 1, 1225, 1413721, 1631432881, 1882672131025, 2172602007770041, 2507180834294496361, 2893284510173841030625, 3338847817559778254844961, 3853027488179473932250054441, ... A046177
6 5 1, 40755, 1533776805, … A046180
7 3 1, 55, 121771, 5720653, 12625478965, 593128762435, 1309034909945503, 61496776341083161, 135723357520344181225, 6376108764003055554511, 14072069153115290487843091, … A046194
7 4 1, 81, 5929, 2307361, 168662169, 12328771225, 4797839017609, 350709705290025, 25635978392186449, 9976444135331412025, … A036354
7 5 1, 4347, 16701685, 64167869935, … A048900
7 6 1, 121771, 12625478965, … A048903
8 3 1, 21, 11781, 203841, … A046183
8 4 1, 225, 43681, 8473921, 1643897025, 318907548961, 61866420601441, 12001766689130625, 2328280871270739841, 451674487259834398561, 87622522247536602581025, 16998317641534841066320321, … A036428
8 5 1, 176, 1575425, 234631320, … A046189
8 6 1, 11781, 113123361, … A046192
8 7 1, 297045, 69010153345, … A048906
9 3 1, 325, 82621, 20985481, … A048909
9 4 1, 9, 1089, 8281, 978121, 7436529, 878351769, 6677994961, 788758910641, 5996832038649, 708304623404049, 5385148492712041, 636056763057925561, ... A036411
9 5 1, 651, 180868051, … A048915
9 6 1, 325, 5330229625, … A048918
9 7 1, 26884, 542041975, … A048921
9 8 1, 631125, 286703855361, … A048924

In some cases, such as s = 10 and t = 4, there are no numbers in both sets other than 1.[citation needed]

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.

See also

[edit]

Notes

[edit]

References

[edit]

Bibliography

[edit]
[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia
from Grokipedia
A polygonal number is a that represents the number of dots arranged in the shape of a with a given number of sides, generalizing familiar sequences such as triangular numbers (3 sides), square numbers (4 sides), and pentagonal numbers (5 sides) to polygons with any number of sides r3r \geq 3. The general formula for the nn-th rr-gonal number, denoted P(r,n)P(r, n), is P(r,n)=n2(r2)n(r4)2P(r, n) = \frac{n^2 (r-2) - n (r-4)}{2}, where nn is a positive ; this expression arises from the cumulative sum of terms that add successive layers to the polygonal figure. For n=1n = 1, every polygonal number is 1, forming the initial single dot at the center. Specific cases include triangular numbers, given by P(3,n)=n(n+1)2P(3, n) = \frac{n(n+1)}{2} (e.g., 1, 3, 6, 10, 15); square numbers, P(4,n)=n2P(4, n) = n^2 (e.g., 1, 4, 9, 16, 25); and pentagonal numbers, P(5,n)=n(3n1)2P(5, n) = \frac{n(3n-1)}{2} (e.g., 1, 5, 12, 22, 35). These sequences appear in various mathematical contexts, such as binomial coefficients and lattice point counts. Polygonal numbers have been studied since antiquity by the Pythagoreans, who explored figurate numbers geometrically. In the 17th century, conjectured that every positive integer can be expressed as the sum of at most rr rr-gonal numbers for any r3r \geq 3; proved the case for triangular numbers in 1796, and established the general theorem in 1813. This result connects polygonal numbers to broader themes in , including representations as sums of squares and other quadratic forms.

Definition and Basic Concepts

General Definition

A polygonal number is a that represents the number of dots or points arranged to form the shape of a with [n](/page/N+)3[n](/page/N+) \geq 3 sides. These numbers generalize patterns observed in simpler geometric arrangements, capturing the structure of polygons through successive layers of points. The [k](/page/K)[k](/page/K)-th [n](/page/N+)[n](/page/N+)-gonal number, denoted P(n,k)P(n, k), quantifies the total points in the [k](/page/K)[k](/page/K)-th of such a figure, constructed by adding successive polygonal layers around a central point or along the sides of the . Here, [n](/page/N+)[n](/page/N+) specifies the number of sides, while [k](/page/K)[k](/page/K) indicates the term's position in the sequence for that type. The concept originated in , with early explorations by Pythagoreans around 500 BC and a formal definition provided by Hypsicles circa 150 BC, linking polygonal numbers to arithmetic progressions. Systematic study advanced in the 16th and 17th centuries, notably through Pierre de Fermat's 1638 proposal of the polygonal number theorem—that every positive integer is a sum of at most nn nn-gonal numbers—and Blaise Pascal's 1654 treatise on the arithmetical triangle, which connected figurate numbers to combinatorial patterns. Unlike broader categories of figurate numbers, which encompass one-dimensional linear arrangements or three-dimensional polyhedral forms, polygonal numbers are distinctly limited to two-dimensional representations of s. The simplest case arises with triangular numbers, P(3,k)P(3, k).

Visual and Geometric Interpretation

Polygonal numbers can be visualized as arrangements of dots forming the filled shape of a with nn sides, constructed layer by layer to represent the kk-th polygonal number. The process begins with a single central dot for k=1k=1, which forms the initial "layer" or core of the figure. Subsequent layers are added around this core, with each new layer consisting of dots placed along the sides of the emerging polygon, where corners are shared between adjacent sides to avoid double-counting. This layered buildup creates a , discrete pattern that grows outward, with the number of dots added per layer increasing progressively to maintain the polygonal . In this geometric construction, each layer intuitively expands the figure by encircling the previous one, adding dots in a way that forms straight edges along each side while ensuring the overall shape remains a regular nn-gon. For instance, the incremental dots per layer build upon the prior structure, resulting in a cumulative total that visually scales with the polygon's size. This method emphasizes the additive nature of the arrangement, where the shared corners and aligned edges prevent overlaps and maintain uniformity. For n=3n=3, the triangular numbers appear as dots arranged in an , with each layer adding a new row of dots parallel to the base, forming a stepped triangular lattice that approximates the continuous shape. Similarly, for n=4n=4, square numbers form a square lattice of dots, where layers add perimeter dots around the inner square, creating nested squares that highlight the orthogonal grid alignment. These visualizations illustrate how higher nn values extend the pattern to pentagons, hexagons, and beyond, with dots positioned at lattice points to evoke the polygon's vertices and edges. Unlike continuous polygonal shapes defined by smooth boundaries and areas in , polygonal numbers focus solely on the discrete count of dots at coordinates, representing a finite, countable rather than an infinite or filled region. This distinction underscores their role as figurate numbers, bridging arithmetic sequences with geometric intuition through point-based configurations.

Specific Examples

Triangular Numbers

Triangular numbers constitute the polygonal numbers for the case of triangles, with 3 sides (r=3r = 3), forming the simplest non-trivial sequence in this family. The first few terms of the sequence are 1, 3, 6, 10, 15, and so on, generated by accumulating successive integers in a triangular arrangement. These numbers can be interpreted geometrically as the count of dots arranged in an equilateral triangle, with the kk-th triangular number representing the total dots up to kk rows. Algebraically, the kk-th triangular number TkT_k is given by the formula Tk=i=1ki=(k+12),T_k = \sum_{i=1}^k i = \binom{k+1}{2}, where the summation reflects the arithmetic progression of natural numbers, and the binomial coefficient arises from combinatorial selection principles. In combinatorics, triangular numbers hold significant applications, notably as the sum of the first kk natural numbers, which underpins many counting problems in discrete mathematics. They also feature prominently in the hockey-stick identity, which states that i=rn(ir)=(n+1r+1)\sum_{i=r}^n \binom{i}{r} = \binom{n+1}{r+1}; for r=1r = 1, this directly yields Tn=i=1niT_n = \sum_{i=1}^n i, providing a binomial proof for the summation formula and extending to broader enumerative identities. A distinctive combinatorial appearance of triangular numbers occurs along the second diagonal of Pascal's triangle, where the entries 1, 3, 6, 10, and subsequent terms align precisely with this sequence, illustrating their embedded role in binomial expansions.

Square Numbers

Square numbers, also known as quadratic numbers or perfect squares, represent the second type of polygonal numbers, corresponding to the case where the polygon has four sides (r=4r = 4 in the general polygonal ). They are of the form k2k^2, where kk is a positive , and form the sequence 1, 4, 9, 16, 25, 36, and so on. Geometrically, square numbers can be visualized as arrangements of dots or objects in a square grid with kk dots along each side, forming a k×kk \times k lattice that encloses an area proportional to k2k^2. This interpretation underscores their role as figurate numbers, where the incremental addition of a ""—a of 2k12k - 1 units—builds the next larger square from the previous one. In , these numbers are fundamental, appearing in contexts such as Diophantine equations and quadratic residues. A notable property is their connection to the , which states that in a right-angled , the square of the equals the sum of the squares of the other two sides (a2+b2=c2a^2 + b^2 = c^2); this can be visualized by constructing squares on each side of the , demonstrating the equality of areas through and rearrangement. One distinctive relation of square numbers to other polygonal sequences is that every square number equals the sum of two consecutive triangular numbers: the kk-th square k2k^2 is Tk1+TkT_{k-1} + T_k, where Tm=m(m+1)2T_m = \frac{m(m+1)}{2} is the mm-th . For example, 9=6+39 = 6 + 3, corresponding to the third and second . This identity highlights interdependencies among low-order polygonal numbers and can be illustrated geometrically by combining two adjacent rows of a triangular arrangement to form a square.

Pentagonal and Hexagonal Numbers

Pentagonal numbers are the fifth polygonal numbers, representing the number of dots that form a figure composed of successive layers arranged in the shape of a regular . The sequence begins with 1, 5, 12, 22, 35, and continues accordingly. The kk-th pentagonal number is given by P(5,k)=k(3k1)2P(5, k) = \frac{k(3k-1)}{2}. Geometrically, these numbers arise from starting with a central dot and adding layers around it, where each layer consists of dots along the five sides of the pentagon; due to the odd number of sides, the layer additions do not align as symmetrically as in even-sided polygons, resulting in a more irregular incremental structure compared to triangular or square figures. Hexagonal numbers, the sixth polygonal numbers, denote the count of dots forming a hexagonal figure through layered additions. Their sequence starts as 1, 6, 15, 28, 45, and so on. The kk-th hexagonal number is given by P(6,k)=k(2k1)P(6, k) = k(2k-1). In geometric terms, they are constructed by surrounding a central dot with successive hexagonal layers, each comprising six sides; this arrangement aligns naturally with the , akin to the structure observed in centered hexagonal patterns and extending to three-dimensional interpretations like cubic close-packing efficiencies in sphere arrangements. A notable application of pentagonal numbers appears in Euler's , which relates the for the partition to a series involving generalized pentagonal numbers as exponents, providing key insights into integer partitions.

Mathematical Formulas

General Formula

The general for the nnth kk-gonal number, denoted P(n,k)P(n, k), is given by P(n,k)=n+n(n1)(k2)2.P(n, k) = n + \frac{n(n-1)(k-2)}{2}. This expression arises from the geometric construction where the kkth term adds layers of dots around a central , with the number of added dots in each successive layer following an dependent on the number of sides kk. An equivalent closed-form expression, quadratic in the index nn with coefficients depending on the number of sides kk, is P(n,k)=n2(k2)n(k4)2.P(n, k) = \frac{n^2 (k-2) - n (k-4)}{2}. This form highlights the polynomial nature of the sequence for fixed kk, where the leading coefficient k22\frac{k-2}{2} scales quadratically with nn. To verify the formula, consider specific cases. For k=3k=3 (triangular numbers), it reduces to P(n,3)=n(n+1)2P(n, 3) = \frac{n(n+1)}{2}, the standard nnth . For k=4k=4 (square numbers), it simplifies to P(n,4)=n2P(n, 4) = n^2, matching the nnth square. These reductions confirm the formula's consistency with well-known special cases. For integer values n1n \geq 1 and k3k \geq 3, P(n,k)P(n, k) is always an integer, as the formula represents the total count of dots in a discrete geometric arrangement, equivalent to a sum of consecutive integers adjusted by the side length. This integer property holds due to the even denominator dividing the numerator, which combines even and odd terms appropriately for integer inputs.

Derivation of the Formula

The derivation of the general formula for the nth k-gonal number, denoted P(n,k)P(n, k), begins with the geometric construction of the figure as a central dot surrounded by successive layers or . The central dot contributes 1 to the total. Each subsequent layer mm (for m=1m = 1 to n1n-1) adds a gnomon consisting of 1+m(k2)1 + m(k-2) new dots, where k3k \geq 3 is the number of sides and n1n \geq 1 is the order of the polygonal number. This incremental addition reflects the structure: the "1" accounts for the corner dot shared across sides in the layer, while m(k2)m(k-2) accounts for the additional dots along the extending sides. Thus, the total number of dots is expressed as the P(n,k)=1+m=1n1[1+m(k2)].P(n, k) = 1 + \sum_{m=1}^{n-1} \left[1 + m(k-2)\right]. This separates into P(n,k)=1+m=1n11+(k2)m=1n1m=1+(n1)+(k2)(n1)n2,P(n, k) = 1 + \sum_{m=1}^{n-1} 1 + (k-2) \sum_{m=1}^{n-1} m = 1 + (n-1) + (k-2) \cdot \frac{(n-1)n}{2}, using the standard formulas for the sum of the first n1n-1 natural numbers and the sum of n1n-1 ones. Simplifying the expression yields P(n,k)=n+(k2)n(n1)2.P(n, k) = n + \frac{(k-2)n(n-1)}{2}. Further algebraic manipulation confirms the quadratic form. Rewriting the combined term gives P(n,k)=2n+(k2)n(n1)2=(k2)n2(k4)n2,P(n, k) = \frac{2n + (k-2)n(n-1)}{2} = \frac{(k-2)n^2 - (k-4)n}{2}, which is the standard for the nth k-gonal number. This derivation relies directly on the summation of layer contributions and holds for all k3k \geq 3. An equivalent approach expresses P(n,k)P(n, k) as i=1n[(k2)i(k3)]\sum_{i=1}^n [(k-2)i - (k-3)], which simplifies identically using arithmetic series sums, emphasizing the linear progression in each layer's .

Key Properties and Identities

Interrelations Among Polygonal Numbers

Polygonal numbers exhibit notable overlaps, where certain integers belong to multiple polygonal sequences. For example, 1 is the first term in every polygonal sequence, while 36 serves as both the 6th and the 8th . Such intersections are not isolated; infinitely many square-triangular numbers exist, arising as solutions to the m2=n(n+1)2m^2 = \frac{n(n+1)}{2}, which transforms into the Pell equation x22y2=±1x^2 - 2y^2 = \pm 1. Transformation formulas reveal how polygonal numbers interrelate through lower-order sequences, particularly triangular numbers. The nn-th kk-gonal number can be expressed as Pk(n)=n+(k2)Tn1P_k(n) = n + (k-2) T_{n-1}, where Tm=m(m+1)2T_m = \frac{m(m+1)}{2} is the mm-th ; this relation builds higher polygonal forms by scaling and shifting triangular contributions. Similar expressions connect other sequences, such as pentagonal numbers as P5(n)=n+3Tn1P_5(n) = n + 3 T_{n-1}. These formulas underscore triangular numbers as a foundational basis for the broader family. In , interrelations among polygonal numbers often involve Diophantine equations, whose or rational solutions identify multi-polygonal numbers or generalized representations. For instance, determining if a number NN is kk-gonal requires solving 8(k2)N+(k4)2=s28(k-2)N + (k-4)^2 = s^2 for ss, yielding the index n=s+k42(k2)n = \frac{s + k - 4}{2(k-2)}; rational solutions extend this to non- indices, representing rational polygonal values. Fermat's polygonal number theorem further links them by asserting that every is the sum of at most kk kk-gonal numbers for k3k \geq 3. The density of kk-gonal numbers diminishes with increasing kk, reflecting their asymptotic growth Pk(n)k22n2P_k(n) \approx \frac{k-2}{2} n^2; up to a large NN, the count is roughly 2Nk2\sqrt{\frac{2N}{k-2}}
Add your contribution
Related Hubs
User Avatar
No comments yet.