{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "0SBRX5CZ5R"
    }
  ],
  "body": "\n## Summary\n\nThe multiplicative order of an integer $a$ modulo $n$, with $a$ coprime to $n$, is the smallest positive exponent $k$ such that $a^k \\equiv 1 \\pmod n$.\nThe [[definition of the multiplicative order|0SBRX5CZ5R]] gives the precise form.\n",
  "commit": "545acf83a9b75c8ddc375ef8b23d2ae101a4d7e4",
  "front": {
    "kind": "concept",
    "msc": [
      "11A07"
    ],
    "name": "Multiplicative order",
    "same_as": {
      "wikidata": "Q282723",
      "wikipedia": "Multiplicative order"
    },
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Multiplicative_order"
      }
    ],
    "tag": "02RRHJ7R98"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/02RRHJ7R98/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/02RRHJ7R98.md",
  "msc": [
    "11A07"
  ],
  "name": "Multiplicative order",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/02R/02RRHJ7R98.md",
  "status": null,
  "tag": "02RRHJ7R98",
  "uri": "m2://02RRHJ7R98",
  "url": "https://math2.tamnd.com/wiki/multiplicative-order/",
  "writing": {
    "tag": "02RRHJ7R98",
    "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
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}