Let's skip the python stuff that we covered in class today, I will find them in the powerpoints later.
One interesting technique that we learned was induction. For example, once the initial domino falls, all of dominos fall. (all of i in D, di falls) So this implication that we use is apparently not the most simple nor the fastest. Here's proof by induction. It uses a base case and a simple inductive step.
Anyway, sLog, it's been a good run, time to study for finals.

No comments:
Post a Comment