Recursive squaring Inductive step(n≥2) n+1 FnFn211「1 FF n-1 17 10 n Day 4 Introduction to Algorithms L3.16Day 4 Introduction to Algorithms L3.16 Recursive squaring . . Inductive step (n ≥ 2): n n F F F F F F F F n n n n n n n n   =  ⋅ −   =  ⋅   =  − −− − + 1 0 1 1 1 0 1 1 1 1 0 1 1 1 0 1 1 1 2 1 1 1