{
  "aliases": [
    "circle-division-by-chords",
    "circle-points-segments-proof",
    "dividing-a-circle-into-areas"
  ],
  "backlinks": null,
  "body": "\n## Problem\n\n**Moser's circle problem** asks how many regions a circle can be divided into by choosing $n$ points along the circumference of the circle and joining each pair of points by a straight line. The greatest possible number of regions with $n$ points is given by\n\n$$r_G = { n \\choose 4 } + { n \\choose 2 } + 1 = \\frac{1}{24}(n^4 - 6 n^3 + 23 n^2 - 18 n + 24),$$\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "circle-division-by-chords",
      "circle-points-segments-proof",
      "dividing-a-circle-into-areas"
    ],
    "inventory": [
      "H9WTV5BC9H"
    ],
    "kind": "problem",
    "name": "Moser's circle problem",
    "same_as": {
      "wikidata": "Q5284051",
      "wikipedia": "Moser's circle problem"
    },
    "sources": [
      {
        "locator": "Moser's circle problem",
        "mention": "wikipedia://en/399730",
        "note": "adopted",
        "sections": [
          "Problem"
        ],
        "wikipedia": "en:399730@r1374440837"
      }
    ],
    "tag": "M225KZAV4F"
  },
  "kind": "problem",
  "link": "https://math2.tamnd.com/node/M225KZAV4F/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/M225KZAV4F.md",
  "msc": null,
  "name": "Moser's circle problem",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/M22/M225KZAV4F.md",
  "status": null,
  "tag": "M225KZAV4F",
  "uri": "m2://M225KZAV4F",
  "url": "https://math2.tamnd.com/wiki/mosers-circle-problem/",
  "writing": {
    "tag": "M225KZAV4F",
    "kind": "problem",
    "level": "W1",
    "next": [
      {
        "what": "edge bounds both",
        "have": 0,
        "want": 1
      },
      {
        "what": "section History",
        "note": "with the year of the first source",
        "have": 0,
        "want": 1
      }
    ]
  }
}