The second week of school has passed. We were still doing induction, but this past week we worked at strong inductions. Strong induction we learn this year is different than what i've learned in the past, in the past, all we learned was more like proving something similar to fibonacci numbers, now, i will need more explanation in how i derive the proof and the n+1 cases
i'm glad problem set 1 is out of the way, i read problem set #2 and similarly what we did in class, so i think i'll start working on that tomorrow, then after i can finally start working on A1 now that most work are out of the way.
1 comment:
Yes, induction for the fibonacci sequence goes back exactly two values --- to n-2 and n-1. Complete induction allows you to consider any of the values smaller than n. Sometimes this is needed in your induction argument, but there's no automatic way to tell.
Post a Comment