Template:Central polygonal numbers.svg

From Vigyanwiki
Revision as of 14:54, 30 November 2022 by Admin (talk | contribs) (1 revision imported)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
The maximum number of pieces, p obtainable with n straight cuts is the n-th triangular number plus one, forming the lazy caterer's sequence (OEIS A000124)