Classes

Class 1: What Makes it Go?

• What makes computers go?
• Introduction to Discrete Math (Kevin Bacon)
• Course Logistics
• Why discrete math?

Class 2: Truth and Soundness

• Defense of Analog Computing
• “Hard” Problems
• Propositions
• Booleans
• Operations on Booleans

Class 3: Inference

• Defining Boolean (Continued)
• Revisiting Propositions
• Implies (Logical operator)
• Axioms, Inference Rules, Predicates
• Soundness
• Contrapositive

Class 4: Proof

• Recap: Inference Rules and Soundness
• Contrapositive
• Introduction to Proof (Odd Square Theorem, Even Square Theorem)

Class 5: Proof by Contradiction

• Recap: Proof by Contrapositive
• Proof by Contradiction

Class 6: Continuing Contradictions

• Finishing the proof of the Odd-Not-Even Lemma
• Irrational Numbers
• Proof that the square root of 2 is irrational

Class 7: Contradicting Euclid

• Continuing Irrational Numbers
• Defining divides and prime
• Euclid’s Lemma

Class 8: Concluding Contradictions

• Preparing for Test 1
• Proof by Contradiction Practice
• Least Positive Rational