We did proof by contradiction, doing two classical examples:
sqrt 2 is irrational
A graph with n nodes, each of degree at least (n-1)/2, must
be connected.
We then saw two examples of state diagrams: the
Jug Puzzle from Die Hard 3.
and constructing phone lattices.
And we talked briefly about loops in state diagrams.