{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "FHFWE27514"
    },
    {
      "field": "uses",
      "target": "YBCZ9VY7SX"
    }
  ],
  "body": "\n## Summary\n\nThe minimal period, or prime period, of a [[periodic point|T75CZ5H47N]] is the least number of steps after which it returns to itself.\nIt equals the number of distinct points in its orbit.\nEvery period of the point is a multiple of the minimal period.\nResults such as Sharkovskii's theorem are stated in terms of minimal periods.\n\n## Explanations\n\n### L1 human\n\nA periodic point comes back to its start after some steps, and then again and again.\nThe minimal period is the length of one trip around the loop.\nFor the rotation of a clock face by $3$ hours, the point at $12$ visits $3$, $6$, $9$ and returns to $12$.\nSo its minimal period is $4$, even though it is also back after $8$ or $12$ steps.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "kind": "concept",
    "msc": [
      "37C25",
      "37B02"
    ],
    "name": "Minimal period",
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Periodic_point"
      }
    ],
    "tag": "VFZRVZ9SD8"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/VFZRVZ9SD8/",
  "links": null,
  "markdown": "https://tamnd.github.io/math2/node/VFZRVZ9SD8.md",
  "msc": [
    "37C25",
    "37B02"
  ],
  "name": "Minimal period",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/VFZ/VFZRVZ9SD8.md",
  "status": null,
  "tag": "VFZRVZ9SD8",
  "uri": "m2://VFZRVZ9SD8",
  "url": "https://tamnd.github.io/math2/wiki/minimal-period/",
  "writing": {
    "tag": "VFZRVZ9SD8",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      },
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}