{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nLet $n$ be a natural number, and let $F_m$ be the [[Fibonacci numbers|0GA9K57A39]].\nThen\n$$F_{n+2} = F_{n+1} + F_n.$$\n\n## Remarks\n\nWith the values $F_0 = 0$ and $F_1 = 1$, the recurrence determines the whole sequence.\nThe recurrence extends to negative indices with $F_{-n} = (-1)^{n+1} F_n$.\n\n## Explanations\n\n### L1 human\n\nTo get the next Fibonacci number, add the last two.\nFrom $3$ and $5$ you get $8$, and from $5$ and $8$ you get $13$.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "kind": "statement",
    "msc": [
      "11B39"
    ],
    "name": "Fibonacci recurrence",
    "role": "fact",
    "sources": [
      {
        "locator": "Definition",
        "url": "https://en.wikipedia.org/wiki/Fibonacci_sequence"
      }
    ],
    "tag": "0D0SMQYEJA",
    "uses": [
      "0GA9K57A39"
    ]
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/0D0SMQYEJA/",
  "links": [
    {
      "field": "uses",
      "target": "0GA9K57A39"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/0D0SMQYEJA.md",
  "msc": [
    "11B39"
  ],
  "name": "Fibonacci recurrence",
  "prov": null,
  "role": "fact",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0D0/0D0SMQYEJA.md",
  "status": null,
  "tag": "0D0SMQYEJA",
  "uri": "m2://0D0SMQYEJA",
  "url": "https://math2.tamnd.com/wiki/fibonacci-recurrence/",
  "writing": {
    "tag": "0D0SMQYEJA",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}