Moser's circle problem
Problem
Moser's circle problem asks how many regions a circle can be divided into by choosing points along the circumference of the circle and joining each pair of points by a straight line. The greatest possible number of regions with points is given by
Further reading
- Wikipedia, page 399730, revision 1374440837, Moser's circle problem. adopted
About this page
| Tag | M225KZAV4F |
|---|---|
| URI | m2://M225KZAV4F |
| Aliases | circle-division-by-chords, circle-points-segments-proof, dividing-a-circle-into-areas |
| Kind | problem |
| Writing | W1 stated |
| Status | This copy of the site has no build data. Run m2 status M225KZAV4F. |
| Same as | |
| Changed | 4 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.