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
Centered polygonal number
(section)
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!
== Formulas == As can be seen in the above diagrams, the ''n''th centered ''k''-gonal number can be obtained by placing ''k'' copies of the (''n''−1)th triangular number around a central point; therefore, the ''n''th centered ''k''-gonal number is equal to :<math>C_{k,n} =\frac{kn}{2}(n-1)+1.</math> The difference of the ''n''-th and the (''n''+1)-th consecutive centered ''k''-gonal numbers is ''k''(2''n''+1). The ''n''-th centered ''k''-gonal number is equal to the ''n''-th regular ''k''-gonal number plus (''n''-1)<sup>2</sup>. Just as is the case with regular polygonal numbers, the first centered ''k''-gonal number is 1. Thus, for any ''k'', 1 is both ''k''-gonal and centered ''k''-gonal. The next number to be both ''k''-gonal and centered ''k''-gonal can be found using the formula: :<math>\frac{k^2}{2}(k-1)+1</math> which tells us that 10 is both triangular and centered triangular, 25 is both square and centered square, etc. Whereas a [[prime number]] ''p'' cannot be a [[polygonal number]] (except the trivial case, i.e. each ''p'' is the second ''p''-gonal number), many centered polygonal numbers are primes. In fact, if ''k'' β₯ 3, ''k'' β 8, ''k'' β 9, then there are infinitely many centered ''k''-gonal numbers which are primes (assuming the [[Bunyakovsky conjecture]]). Since all [[centered octagonal number]]s are also [[square number]]s, and all [[centered nonagonal number]]s are also [[triangular number]]s (and not equal to 3), thus both of them cannot be prime 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)