vault backup: 2023-10-19 21:39:11

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} }
 $$