Discrete Math - 1.7.3 Proof by Contradiction

Exploring a method of proof known as contradiction where we assume p and not q, then work to show either if p then q or if not q then not p. Video Chapters: Introduction 0:00 What is Proof by Contradiction? 0:07 Proof by Contradiction with One Proposition 1:32 Contradiction Using an Implication 6:00 Up Next 9:29 Textbook: Rosen, Discrete Mathematics and Its Applications, 7e Playlist:    • Discrete Math I (Entire Course)