diff --git a/.obsidian/workspace.json b/.obsidian/workspace.json
index 9fca00c..1fa0ed9 100644
--- a/.obsidian/workspace.json
+++ b/.obsidian/workspace.json
@@ -25,7 +25,7 @@
             "state": {
               "type": "markdown",
               "state": {
-                "file": "Algo/Courses/Chapter 6 - Lists.md",
+                "file": "Algo/Séminaire/Chapter 5 - Recursivity.md",
                 "mode": "source",
                 "source": false
               }
@@ -98,7 +98,7 @@
             "state": {
               "type": "backlink",
               "state": {
-                "file": "Algo/Courses/Chapter 6 - Lists.md",
+                "file": "Algo/Séminaire/Chapter 5 - Recursivity.md",
                 "collapseAll": false,
                 "extraContext": false,
                 "sortOrder": "alphabetical",
@@ -115,7 +115,7 @@
             "state": {
               "type": "outgoing-link",
               "state": {
-                "file": "Algo/Courses/Chapter 6 - Lists.md",
+                "file": "Algo/Séminaire/Chapter 5 - Recursivity.md",
                 "linksCollapsed": false,
                 "unlinkedCollapsed": true
               }
@@ -138,7 +138,7 @@
             "state": {
               "type": "outline",
               "state": {
-                "file": "Algo/Courses/Chapter 6 - Lists.md"
+                "file": "Algo/Séminaire/Chapter 5 - Recursivity.md"
               }
             }
           },
@@ -171,9 +171,9 @@
   },
   "active": "26919eaeae9a8f38",
   "lastOpenFiles": [
+    "Algo/Courses/Chapter 6 - Lists.md",
     "Algo/Séminaire/Chapter 3 - Case analysis.md",
     "Algo/Séminaire/Chapter 2 - Functions.md",
-    "Algo/Courses/Chapter 6 - Lists.md",
     "Algo/Courses/Chapter 6 - Lists (Exercises).md",
     "Algo/Séminaire/Chapter 1 - CAML basics.md",
     "Prog/Loops.md",
diff --git a/Algo/Séminaire/Chapter 5 - Recursivity.md b/Algo/Séminaire/Chapter 5 - Recursivity.md
index 2107c47..7da134f 100644
--- a/Algo/Séminaire/Chapter 5 - Recursivity.md	
+++ b/Algo/Séminaire/Chapter 5 - Recursivity.md	
@@ -65,7 +65,7 @@ A[ctd 3] --> B[ctd 2] --> C[ctd 1] --> D[ctd 0] --> E[ctd -1] --> F[ ] --> E -->
 > ctd is countdown
 
 ## 5.3. Several recursive calls
-A function that have several recursive calls is defind like this
+A function that have several recursive calls is defined like this
 $$
 Fn = {1 -> \text{if } n\eqslantless{1} \brace{Fn+1+Fn+2} }
 $$