{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "0C8QENHYZW"
    },
    {
      "field": "uses",
      "target": "4G65M0ZWAZ"
    },
    {
      "field": "uses",
      "target": "SVTT5MWB2X"
    }
  ],
  "body": "\n## Summary\n\nThe Möbius function $\\mu$ is an arithmetic function that is $0$ on integers with a square factor greater than $1$.\nOn a squarefree integer, its value $1$ or $-1$ depends on the parity of the number of prime factors.\nThe [[definition of the Möbius function|0C8QENHYZW]] gives the precise form.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "inventory": [
      "NM5SF34DCG"
    ],
    "kind": "concept",
    "msc": [
      "11A25"
    ],
    "name": "Möbius function",
    "same_as": {
      "wikidata": "Q205243",
      "wikipedia": "Möbius function"
    },
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/M%C3%B6bius_function"
      }
    ],
    "specializes": [
      "0NTWN57GM3"
    ],
    "tag": "0FANE7P0DY"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/0FANE7P0DY/",
  "links": [
    {
      "field": "specializes",
      "target": "0NTWN57GM3"
    }
  ],
  "markdown": "https://tamnd.github.io/math2/node/0FANE7P0DY.md",
  "msc": [
    "11A25"
  ],
  "name": "Möbius function",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0FA/0FANE7P0DY.md",
  "status": null,
  "tag": "0FANE7P0DY",
  "uri": "m2://0FANE7P0DY",
  "url": "https://tamnd.github.io/math2/wiki/mobius-function/",
  "writing": {
    "tag": "0FANE7P0DY",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      }
    ]
  }
}