CSC236H5 Lecture Notes - Lecture 4: University Of Toronto Mississauga, Empty Set

• School: UTM
• Department: Computer Science
• Course: CSC236H5
• Professor: Daniel Zingaro

Document Summary

1, if n = 1 t 1 + 1 (n. N2 + n + 1 b) n. F 1 + 2 (n c: 2n n2 e) Let"s take a closer look into the function: (0)f (1)f. Using the function below and the five steps to figure out the closed form. = f 2 + 2 2 + 2 n. = f 2 + 4 2. F 1 = f 2 + 2 1. = f 2 + 2 2 (n) F 2 = f 3 + 2 2 (n. = f 3 + 2 4. = f 3 + 2 4 + 4 2. = f 4 + 2 6 + 6 6. = f 4 + 8 1. F 3 = f 4 + 2 3 (n. Step 3: n k = 0 k = n. = 1 + 2 * n n 1 (n (n) Prove that our closed form is correct by induction.