Monday Oct 2

Basic proof technique: splitting into cases.
Sample theorem: For any integer n, n(n-1)/2 is an integer too.
Proofs by contradiction are "really" splits into the cases "what I want to be true is true vs. what I want to be true is false."
When a proof by contradiction is silly.
Why proofs by contradiction are dangerous.