Math 2.0

Problem

Moser's circle problem

Problem

Moser's circle problem asks how many regions a circle can be divided into by choosing nn points along the circumference of the circle and joining each pair of points by a straight line. The greatest possible number of regions with nn points is given by

rG=(n4)+(n2)+1=124(n4−6n3+23n2−18n+24),r_G = { n \choose 4 } + { n \choose 2 } + 1 = \frac{1}{24}(n^4 - 6 n^3 + 23 n^2 - 18 n + 24),

Further reading

  1. Wikipedia, page 399730, revision 1374440837, Moser's circle problem. adopted
About this page
TagM225KZAV4F
URIm2://M225KZAV4F
Aliasescircle-division-by-chords, circle-points-segments-proof, dividing-a-circle-into-areas
Kindproblem
WritingW1 stated
StatusThis copy of the site has no build data. Run m2 status M225KZAV4F.
Same as
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge bounds both (0 of 1)
  • section History: with the year of the first source (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.