Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Pentagonal number
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Figurate number}} {{distinguish|centered pentagonal number}} [[Image:Pentagonal number.gif|right|thumb|181px|A visual representation of the first six pentagonal numbers]] A '''pentagonal number''' is a [[figurate number]] that extends the concept of [[triangular number|triangular]] and [[square number]]s to the [[pentagon]], but, unlike the first two, the patterns involved in the construction of pentagonal numbers are not [[rotational symmetry|rotationally symmetrical]]. The ''n''th pentagonal number ''p<sub>n</sub>'' is the number of ''distinct'' dots in a pattern of dots consisting of the ''outlines'' of regular pentagons with sides up to n dots, when the pentagons are overlaid so that they share one [[vertex (geometry)|vertex]]. For instance, the third one is formed from outlines comprising 1, 5 and 10 dots, but the 1, and 3 of the 5, coincide with 3 of the 10 β leaving 12 distinct dots, 10 in the form of a pentagon, and 2 inside. ''p''<sub>n</sub> is given by the formula: :<math>p_n = {\frac{3n^2-n}{2}}=\binom{n}{1}+3\binom{n}{2}</math> for ''n'' ≥ 1. The first few pentagonal numbers are: [[1 (number)|1]], [[5 (number)|5]], [[12 (number)|12]], [[22 (number)|22]], [[35 (number)|35]], [[51 (number)|51]], [[70 (number)|70]], [[92 (number)|92]], [[117 (number)|117]], [[145 (number)|145]], [[176 (number)|176]], [[210 (number)|210]], [[247 (number)|247]], 287, 330, 376, 425, 477, 532, 590, 651, 715, 782, 852, 925, [[1001 (number)|1001]], 1080, 1162, 1247, 1335, 1426, 1520, 1617, 1717, 1820, 1926, 2035, 2147, 2262, 2380, 2501, 2625, 2752, 2882, 3015, 3151, 3290, 3432, 3577, 3725, 3876, 4030, 4187... {{OEIS|id=A000326}}. The ''n''th pentagonal number is the sum of n integers starting from n (i.e. from n to 2n-1). The following relationships also hold: :<math>p_n = p_{n-1} + 3n - 2 = 2p_{n-1} - p_{n-2} + 3</math> Pentagonal numbers are closely related to triangular numbers. The ''n''th pentagonal number is one third of the {{nowrap|(3''n'' β 1)}}th [[triangular number]]. In addition, where T<sub>n</sub> is the ''n''th triangular number: :<math>p_n = T_{n-1} + n^2 = T_n + 2T_{n-1} = T_{2n-1} - T_{n-1}</math> '''Generalized pentagonal numbers''' are obtained from the formula given above, but with ''n'' taking values in the sequence 0, 1, β1, 2, β2, 3, β3, 4..., producing the sequence: 0, 1, 2, 5, 7, 12, 15, 22, 26, 35, 40, 51, 57, 70, 77, 92, 100, 117, 126, 145, 155, 176, 187, 210, 222, 247, 260, 287, 301, 330, 345, 376, 392, 425, 442, 477, 495, 532, 551, 590, 610, 651, 672, 715, 737, 782, 805, 852, 876, 925, 950, 1001, 1027, 1080, 1107, 1162, 1190, 1247, 1276, 1335... {{OEIS|id=A001318}}. Generalized pentagonal numbers are important to [[Euler]]'s theory of [[integer partition]]s, as expressed in his [[pentagonal number theorem]]. The number of dots inside the outermost pentagon of a pattern forming a pentagonal number is itself a generalized pentagonal number. ==Other properties== *<math>p_n</math> for n>0 is the number of different [[Composition (combinatorics)|compositions]] of <math>n+8</math> into n parts that don't include 2 or 3. *<math>p_n</math> is the sum of the first n natural numbers congruent to 1 mod 3. *<math>p_{8n}-p_{8n-1}=p_{2n+2}-p_{2n-2}</math> ==Generalized pentagonal numbers and centered hexagonal numbers== Generalized pentagonal numbers are closely related to [[centered hexagonal number]]s. When the array corresponding to a centered hexagonal number is divided between its middle row and an adjacent row, it appears as the sum of two generalized pentagonal numbers, with the larger piece being a pentagonal number proper: :{| ! 1=1+0 !! !! 7=5+2 !! !! 19=12+7 !! !! 37=22+15 |- align="center" valign="middle" style="line-height:0;" |[[Image:RedDotX.svg|16px|*]] | |[[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]]<br>[[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]]<br>[[Image:GrayDotX.svg|16px|*]][[Image:GrayDotX.svg|16px|*]] | |[[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]]<br>[[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]]<br>[[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]]<br>[[Image:GrayDotX.svg|16px|*]][[Image:GrayDotX.svg|16px|*]][[Image:GrayDotX.svg|16px|*]][[Image:GrayDotX.svg|16px|*]]<br>[[Image:GrayDotX.svg|16px|*]][[Image:GrayDotX.svg|16px|*]][[Image:GrayDotX.svg|16px|*]] | |[[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]]<br>[[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]]<br>[[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]]<br>[[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]][[Image:RedDotX.svg|16px|*]]<br>[[Image:GrayDotX.svg|16px|*]][[Image:GrayDotX.svg|16px|*]][[Image:GrayDotX.svg|16px|*]][[Image:GrayDotX.svg|16px|*]][[Image:GrayDotX.svg|16px|*]][[Image:GrayDotX.svg|16px|*]]<br>[[Image:GrayDotX.svg|16px|*]][[Image:GrayDotX.svg|16px|*]][[Image:GrayDotX.svg|16px|*]][[Image:GrayDotX.svg|16px|*]][[Image:GrayDotX.svg|16px|*]]<br>[[Image:GrayDotX.svg|16px|*]][[Image:GrayDotX.svg|16px|*]][[Image:GrayDotX.svg|16px|*]][[Image:GrayDotX.svg|16px|*]] |} In general: :<math> 3n(n-1)+1 = \tfrac{1}{2}n(3n-1)+\tfrac{1}{2}(1-n)\bigl(3(1-n)-1\bigr)</math> where both terms on the right are generalized pentagonal numbers and the first term is a pentagonal number proper (''n'' ≥ 1). This division of centered hexagonal arrays gives generalized pentagonal numbers as trapezoidal arrays, which may be interpreted as Ferrers diagrams for their partition. In this way they can be used to prove the pentagonal number theorem referenced above. [[File:pentagonal_number_visual_proof.svg|thumb|[[Proof without words]] that the ''n''th pentagonal number can be decomposed into three equal (n-1)th [[triangular number]]s and the number ''n''. ]] ==Sum of reciprocals== A formula for the [[sums of reciprocals|sum of the reciprocals]] of the pentagonal numbers is given by <math display=block> \sum_{n=1}^{\infty}\frac{2}{n\left(3n-1\right)}=3\ln\left(3\right)-\frac{\pi}{\sqrt{3}}. </math> ==Tests for pentagonal numbers== Given a positive integer ''x'', to test whether it is a (non-generalized) pentagonal number we can compute :<math>n = \frac{\sqrt{24x+1} + 1}{6}.</math> The number ''x'' is pentagonal if and only if ''n'' is a [[natural number]]. In that case ''x'' is the ''n''th pentagonal number. For generalized pentagonal numbers, it is sufficient to just check if {{math|24''x'' + 1}} is a perfect square. For non-generalized pentagonal numbers, in addition to the perfect square test, it is also required to check if :<math>\sqrt{24x+1} \equiv 5 \mod 6</math> The mathematical properties of pentagonal numbers ensure that these tests are sufficient for proving or disproving the pentagonality of a number.<ref name="test-generalized-pentagonal-nos">[http://www.divye.in/2012/07/how-do-you-determine-if-number-n-is.html How do you determine if a number N is a Pentagonal Number?]</ref> ==Gnomon== The [[Gnomon (figure)|Gnomon]] of the ''n''th pentagonal number is: :<math> p_{n+1}-p_n = 3n+1</math> == Square pentagonal numbers == A square pentagonal number is a pentagonal number that is also a perfect square.<ref>Weisstein, Eric W. "[http://mathworld.wolfram.com/PentagonalSquareNumber.html Pentagonal Square Number]." From ''MathWorld''--A Wolfram Web Resource.</ref> The first few are: 0, 1, 9801, 94109401, 903638458801, 8676736387298001, 83314021887196947001, 799981229484128697805801, 7681419682192581869134354401, 73756990988431941623299373152801... ([[OEIS]] entry [[oeis:A036353|A036353]]) == Pentagonal Square Triangular Number == In number theory, a pentagonal square triangular number is a positive integer that is simultaneously a pentagonal number, a square number, and a triangular number. This requires solving the following system of [[Diophantine equation|Diophantine equations]] : <math>P_n = \frac{n(3n-1)}{2} = T_m = \frac{m(m+1)}{2} = k^2</math> where <math>P_n</math> is the <math>n</math>-th pentagonal number, <math>T_m</math> is the <math>m</math>-th triangular number, and <math>k^2</math> is a square number. Solutions to this problem can be found by checking pentagonal triangular numbers against square numbers. Other than the trivial solution of 1, computational searches of the first 9,690 pentagonal triangular numbers have revealed no other square numbers, suggesting that no other pentagonal square triangular numbers exist below this limit.<ref name="MathWorld">{{cite web |last=Weisstein |first=Eric W. |title=Pentagonal Square Triangular Number |url=https://mathworld.wolfram.com/PentagonalSquareTriangularNumber.html |access-date=April 2, 2025 |website=MathWorld |publisher=Wolfram}}</ref> Although no formal proof has yet appeared in print, work by J. Sillcox between 2003 and 2006 applied results from W. S. Anglin's 1996 paper on simultaneous Pell equations to this problem. Anglin demonstrated that simultaneous Pell equations have exactly 19,900 solutions with <math>x, y < 10^{20000}</math>.<ref name="Anglin">{{cite journal |last=Anglin |first=W.S. |year=1996 |title=Simultaneous Pell Equations |journal=Math. Comput. |volume=65 |issue=213 |pages=355β359|doi=10.1090/S0025-5718-96-00687-4 }}</ref> Sillcox showed that the pentagonal square triangular number problem can be reduced to solving the equation: : <math>x^2 - 6y^2 = -5</math> This places the problem within the scope of Anglin's proof. For <math>x = 1</math> and <math>y = 1</math>, only the trivial solution exists.<ref name="MathWorld" /><ref name="Anglin" /> ==See also== *[[Hexagonal number]] *[[Triangular number]] ==References== <references /> ==Further reading== *[https://arxiv.org/abs/math/0505373 Leonhard Euler: On the remarkable properties of the pentagonal numbers] {{Figurate numbers}} {{Classes of natural numbers}} {{series (mathematics)}} [[Category:Figurate numbers]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)
Pages transcluded onto the current version of this page
(
help
)
:
Template:Cite journal
(
edit
)
Template:Cite web
(
edit
)
Template:Classes of natural numbers
(
edit
)
Template:Distinguish
(
edit
)
Template:Figurate numbers
(
edit
)
Template:Math
(
edit
)
Template:Nowrap
(
edit
)
Template:OEIS
(
edit
)
Template:Series (mathematics)
(
edit
)
Template:Short description
(
edit
)