diff --git a/semester4/fmfp/formal-methods-functional-programming-summary.pdf b/semester4/fmfp/formal-methods-functional-programming-summary.pdf
index 283fc64..e524611 100644
Binary files a/semester4/fmfp/formal-methods-functional-programming-summary.pdf and b/semester4/fmfp/formal-methods-functional-programming-summary.pdf differ
diff --git a/semester4/fmfp/parts/06_exercises/01_fp/01_haskell.tex b/semester4/fmfp/parts/06_exercises/01_fp/01_haskell.tex
index 1183aad..92d2152 100644
--- a/semester4/fmfp/parts/06_exercises/01_fp/01_haskell.tex
+++ b/semester4/fmfp/parts/06_exercises/01_fp/01_haskell.tex
@@ -68,3 +68,5 @@ Remember:
     \item in the base case / simple case, fix $n$
     \item in the end state that since it holds for all $n$, it, in particular, holds for $n = 0$ (or equivalent)
 \end{itemize}
+For generalizing, a very helpful tactic is to think about the statement some, come up with the generalization you think is correct, then doing the base case in the proof
+after only a very short amount of time, as the correct generalized statement will become apparent there very quickly