Difficult: This is most certainly the most difficult lesson I have read so far. I just don't get why we are using i... that inductive step is just throwing me off! So is all we're doing is more base cases so we can assume more about that k is a bigger number? I thought we already did that...
When you throw four variables in there, (a, k, i and n) then these proofs get so much harder to follow. I can't even understand this concept well enough to make a sensible question about it: it's all just a blur... I watched a YouTube video about strong induction, but it still didn't make that much sense at all. Tomorrow will be filled with lots of questions and examples hopefully.
Well, I guess one question, why are recursive sequences always shown in sets? Is that just... how they are?
Interesting: I'm sure this will be much more interesting when I can understand what this is saying. Recursive sequences, however, are very interesting. Like the Fibonacci sequence and how it is EVERYWHERE in nature. That's pretty cool stuff!
No comments:
Post a Comment