Methods of Proof in Discrete Math

If you've followed the propositional logic we've used over the past few episodes, you should be able to follow this lesson where we use logic to define three methods of proof: modus ponens, proof by contradiction, and proof by contrapositive. While these methods of proof may be confusing, the logic works out that they are sufficient to show that p implies q. Timestamps 00:00 | Intro 00:29 | Building blocks of a proof 02:01 | Format of a direct proof 03:52 | Assumptions to make before we do our proofs 05:54 | Direct proof of "if a is even int, then a^2 is even." 07:39 | Direct proof of "if a is odd int, then a^2 is odd." 09:08 | Direct proof of "if a & b are both odd, then a+b is even." 10:48 | Modus Ponens form of proof 12:59 | Modus Ponens fallacies 14:04 | Explaining "proof by contradiction" 18:00 | Example of proof by contradiction 20:34 | Explaining "proof by contrapositive" 21:34 | Example proof by contrapositive Hashtags #proof #contradiction #contrapositive