CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.

Slides:



Advertisements
Similar presentations
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
Advertisements

With examples from Number Theory
Introduction to Proofs
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
PROOF BY CONTRADICTION
Prof. Shachar Lovett Clicker frequency: CA CSE 20 Discrete math Prof. Shachar Lovett
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Prof. Shachar Lovett Clicker frequency: CA CSE 20 Discrete math Prof. Shachar Lovett
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Solving Word Problems II
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Proof Points Key ideas when proving mathematical ideas.
Logic Puzzles Miran Kim Ben Seelbinder Matthew Sgambati.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
Propositional Logic Lecture 2: Sep 9. Conditional Statement If p then q p is called the hypothesis; q is called the conclusion “If your GPA is 4.0, then.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Logical Puzzles Truth and Lies. The Island of Rilas On the island of Rilas there are just two types of people: knights and knaves Knights always tell.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Propositional Logic.
Introduction to Proofs
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
CS 173, Lecture B September 1, 2015 Tandy Warnow.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
CS 173, Lecture B August 27, 2015 Tandy Warnow. Proofs You want to prove that some statement A is true. You can try to prove it directly, or you can prove.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
1 Section 1.1 A Proof Primer A proof is a demonstration that some statement is true. We normally demonstrate proofs by writing English sentences mixed.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Hilbert’s Progamme Early in C20, the mathematician Hilbert led a programme to formalise maths; to reduce it to a clear set of axioms and show that all.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
MATH 224 – Discrete Mathematics
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Week 4 - Monday.  What did we talk about last time?  Divisibility  Quotient-remainder theorem  Proof by cases.
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
Dr. Naveed Riaz Design and Analysis of Algorithms 1 1 Formal Methods in Software Engineering Lecture # 25.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Section 1.7. Definitions A theorem is a statement that can be shown to be true using: definitions other theorems axioms (statements which are given as.
5-5 Indirect Proof. Indirect Reasoning: all possibilities are considered and then all but one are proved false. The remaining possibility must be true.
Introduction to Proofs. The use of Reasoning and Logic in proofs Inductive Reasoning- “reasoning from detailed facts to general principles” – Specific.
CS 173, Lecture B August 27, 2015 Tandy Warnow. Proofs You want to prove that some statement A is true. You can try to prove it directly, or you can prove.
Section 1.7. Section Summary Mathematical Proofs Forms of Theorems Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
5.6 Indirect Proof and Inequalities in Two Triangles
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
Liar liar.
Week 13.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
6.5 Indirect proof inequalities in one triangle
Lesson 5 – 4 Indirect Proof
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
Indirect Proofs.
CS 220: Discrete Structures and their Applications
Propositional Logic.
Class Greeting.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
5.6 Inequalities in Two Triangles and Indirect Proof
Chapter 5 Parallel Lines and Related Figures
Given: the cost of two items is more than $50.
Presentation transcript:

CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA

Todays topics Knights and knaves

Knights and Knaves Knights and Knaves scenarios are somewhat fanciful ways of formulating logic problems Knight: everything a knight says is true Knave: everything a knave says is false 2+2=3 2+2=4

You approach two people, you know the one on the left is a knave, but you don’t know whether the one on the right is a knave or a knight. Left: “Everything she says is true.” Right: “Everything I say is true.” What is she (the one on the right)? A. Knight B. Knave C. Could be either/not enough information D. Cannot be either/situation is contradictory

You approach one person, but you don’t know whether he is a knave or a knight. Mystery person: “Everything I say is true.” What is he? A. Knight B. Knave C. Could be either/not enough information D. Cannot be either/situation is contradictory

You approach one person, but you don’t know whether she is a knave or a knight. Mystery person: “Everything I say is false.” What is she? A. Knight B. Knave C. Could be either/not enough information D. Cannot be either/situation is contradictory

You meet 3 people: A: “At least one of us is a knave.” B: “At most two of us are knaves.” [C doesn't say anything] This is a really tricky one, but take a moment to see if you can determine which of the following is a possible solution: A. A: Knave, B: Knave, C: Knave B. A: Knight, B: Knight, C: Knight C. A: Knight, B: Knight, C: Knave (Suggestion: eliminate wrong choices rather than trying to solve the puzzle directly. In your groups: please discuss logic for eliminating choices.)

Proof by Contradiction Steps What are they? A. 1. Assume what you are proving, 2. plug in definitions, 3. do some work, 4. show the opposite of what you are proving (a contradiction). B. 1. Assume the opposite of what you are proving, 2. plug in definitions, 3. do some work, 4. show the opposite of your assumption (a contradiction). C. 1. Assume the opposite of what you are proving, 2. plug in definitions, 3. do some work, 4. show the opposite of some fact you already showed (a contradiction). D. Other/none/more than one.

You meet 3 people: A: “At least one of us is a knave.” B: “At most two of us are knaves.” [C doesn't say anything] A: Knight, B: Knight, C: Knave Zeroing in on just one of the three parts of the solution, we will prove by contradiction that A is a knight.

A: “At least one of us is a knave.” B: “At most two of us are knaves.” [C doesn't say anything] Thm. A is a knight. Proof (by contradiction): Assume not, that is, assume A is a knave. Try it yourself first!

A: “At least one of us is a knave.” B: “At most two of us are knaves.” [C doesn't say anything] Thm. A is a knight. Proof (by contradiction): Assume not, that is, assume A is a knave. Then what A says is false. Then it is false that at least one is a knave, meaning zero are knaves. So A is not a knave, but we assumed A was a knave, a contradiction. So the assumption is false and the theorem is true. QED.

You meet 3 people: A: “At least one of us is a knave.” B: “At most two of us are knaves.” [C doesn't say anything] A: Knight, B: Knight, C: Knave Zeroing in on the second of the three parts of the solution, we will prove by contradiction that B is a knight.

A: “At least one of us is a knave.” B: “At most two of us are knaves.” [C doesn't say anything] Thm. B is a knight. Proof (by contradiction): Assume not, that is, assume B is a knave. Try it yourself first!

A: “At least one of us is a knave.” B: “At most two of us are knaves.” [C doesn't say anything] Thm. B is a knight. Proof (by contradiction): Assume not, that is, assume B is a knave. Then what B says is false, so it is false that at most two are knaves. So it must be that all three are knaves. Then A is a knave. So what A says is false, and so there are zero knaves. So B must be a knight, but we assumed B was a knave, a contradiction. So the assumption is false and the theorem is true. QED.

A: “At least one of us is a knave.” B: “At most two of us are knaves.” [C doesn't say anything] Thm. B is a knight. Proof (by contradiction): Assume not, that is, assume B is a knave. Then what B says is false, so it is false that at most two are knaves. So it must be that all three are knaves. Then A is a knave. So what A says is false, and so there are zero knaves. But all three are knaves and zero are knaves is a contradiction. So B must be a knight, but we assumed B was a knave, a contradiction. So the assumption is false and the theorem is true. QED. We didn’t need this step because we had already reached a contradiction.

You meet 3 people: A: “At least one of us is a knave.” B: “At most two of us are knaves.” [C doesn't say anything] A: Knight, B: Knight, C: Knave Zeroing in on the second of the three parts of the solution, we will prove by contradiction that C is a Knave.

A: “At least one of us is a knave.” B: “At most two of us are knaves.” [C doesn't say anything] Thm. C is a knave. Proof (by contradiction): Assume not, that is, assume C is a knight. Try it yourself first!

A: “At least one of us is a knave.” B: “At most two of us are knaves.” [C doesn't say anything] Thm. C is a knave. Proof (by contradiction): Assume not, that is, assume C is a knight. We already proved that A and B must be knights, hence telling the truth. So, if all three are knights, then A is lying, which is a contradiction. So, C must be a knave.

Next class Infinite set sizes, and diagonalization