{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "02M2K4QH9P"
    }
  ],
  "body": "\n## Summary\n\nA Fermat pseudoprime to a base $a$ is a composite number $n$ that satisfies the congruence $a^{n-1} \\equiv 1 \\pmod n$ of Fermat's little theorem.\nThe [[definition of a Fermat pseudoprime|02M2K4QH9P]] gives the precise form.\n",
  "commit": "545acf83a9b75c8ddc375ef8b23d2ae101a4d7e4",
  "front": {
    "kind": "concept",
    "msc": [
      "11A51"
    ],
    "name": "Fermat pseudoprime",
    "same_as": {
      "wikidata": "Q1406394",
      "wikipedia": "Fermat pseudoprime"
    },
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Fermat_pseudoprime"
      }
    ],
    "tag": "0W93FJAC8F"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/0W93FJAC8F/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/0W93FJAC8F.md",
  "msc": [
    "11A51"
  ],
  "name": "Fermat pseudoprime",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0W9/0W93FJAC8F.md",
  "status": null,
  "tag": "0W93FJAC8F",
  "uri": "m2://0W93FJAC8F",
  "url": "https://math2.tamnd.com/wiki/fermat-pseudoprime/",
  "writing": {
    "tag": "0W93FJAC8F",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}