CISC 2315 Discrete Structures

Slides:



Advertisements
Similar presentations
Geometry Chapter 2 Terms.
Advertisements

Methods of Proof. Methods of Proof The Vicky Pollard Proof Technique Prove that when n is even n2 is even. Assume n is 0, then n2 is 0, and that is.
With examples from Number Theory
Discrete Math Methods of proof 1.
Introduction to Proofs
PROOF BY CONTRADICTION
Chapter 3 Direct Proof and Proof by Contrapositive
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
13.4 Mathematical Induction. Mathematical Induction is a common method of proving that each statement of an infinite sequence of mathematical statements.
Notes on Logic Continued
1 Indirect Argument: Contradiction and Contraposition.
Adapted from Discrete Math
Week 3 - Wednesday.  What did we talk about last time?  Basic number theory definitions  Even and odd  Prime and composite  Proving existential statements.
Methods of Proof & Proof Strategies
CISC 2315 Discrete Structures Professor William G. Tanner, Jr. Fall 2010 Slides created by James L. Hein, author of Discrete Structures, Logic, and Computability,
Introduction to Proofs
1 Methods of Proof CS/APMA 202 Epp, chapter 3 Aaron Bloomfield.
Copyright © Cengage Learning. All rights reserved. CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF ELEMENTARY NUMBER THEORY AND METHODS OF PROOF.
Conditional Statements CS 2312, Discrete Structures II Poorvi L. Vora, GW.
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.
10/17/2015 Prepared by Dr.Saad Alabbad1 CS100 : Discrete Structures Proof Techniques(1) Dr.Saad Alabbad Department of Computer Science
Mathematical Preliminaries (Hein 1.1 and 1.2) Sets are collections in which order of elements and duplication of elements do not matter. – {1,a,1,1} =
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Slides for CISC 2315: Discrete Structures Chapters CISC 2315 Discrete Structures Professor William G. Tanner, Jr. SPRING 2010 Slides created by James.
CISC 2315 Discrete Structures Professor William G. Tanner, Jr. Spring 2011 Slides created by James L. Hein, author of Discrete Structures, Logic, and Computability,
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Introduction to Proofs.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
Methods of Proof Dr. Yasir Ali. Proof A (logical) proof of a statement is a finite sequence of statements (called the steps of the proof) leading from.
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
Week 4 - Monday.  What did we talk about last time?  Divisibility  Quotient-remainder theorem  Proof by cases.
Inverse, Contrapositive & indirect proofs Sections 6.2/6.3.
CS104:Discrete Structures Chapter 2: Proof Techniques.
1 CMSC 250 Chapter 3, Number Theory. 2 CMSC 250 Introductory number theory l A good proof should have: –a statement of what is to be proven –"Proof:"
Week 4 - Wednesday.  What did we talk about last time?  Divisibility  Proof by cases.
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.
Notions & Notations - 1ICOM 4075 (Fall 2010) UPRM Department of Electrical and Computer Engineering University of Puerto Rico at Mayagüez Fall 2010 ICOM.
Section 1.7. Section Summary Mathematical Proofs Forms of Theorems Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction.
Slides for CISC 2315: Discrete Structures Chapters CISC 2315 Discrete Structures Professor William G. Tanner, Jr. Fall 2007 Slides created by James.
Chapter 1 Logic and proofs
Chapter 1 Logic and Proof.
Chapter 1 Logic and Proof.
Conditional Statements
Indirect Argument: Contradiction and Contraposition
Conditional Statements
Objectives Students will…
Objectives Identify, write, and analyze the truth value of conditional statements. Write the inverse, converse, and contrapositive of a conditional statement.
2. The Logic of Compound Statements Summary
FUNDAMENTAL Trigonometric IDENTITIES.
Conditional Statements
Conditional Statements
Methods of Proof CS 202 Epp, chapter 3.
Objectives Identify, write, and analyze the truth value of conditional statements. Write the inverse, converse, and contrapositive of a conditional statement.
Conditional Statements
Conditional Statements
Conditional Statements
Conditional Statements
Conditional Statements
Copyright © Cengage Learning. All rights reserved.
(1.4) An Introduction to Logic
Conditional Statements
Conditional Statements
Conditional Statements
Conditional Statements
MAT 3100 Introduction to Proof
Geometry.
Conditional Statements
Copyright © Cengage Learning. All rights reserved.
Conditional Statements
Chapter 5 Parallel Lines and Related Figures
Conditional Statements
Presentation transcript:

CISC 2315 Discrete Structures Chapter 1 Section 1.1 CISC 2315 Discrete Structures William G. Tanner, Jr. Spring 2008 Slides created by James L. Hein, author of Discrete Structures, Logic, and Computability, 2002, 2nd Edition, Jones & Bartlett Computer Science, ISBN 0-7637-1843-2.

Section 1.1 Proof Primer A Proof Primer A proof is a demonstration that some statement is true. We normally demonstrate proofs by writing English sentences mixed with symbols. We’ll consider statements that are either true or false. If A and B be are statements, then “not A,” “A and B,” and “A or B,” are called negation, conjunction, and disjunction, respectively. “not A” is opposite in truth value from A. “A and B” is true exactly when both A and B are true “A or B” is true except when both A and B are false. A B if A then B if not B then not A T T T T T F F F F T T T F F T T Conditionals: “if A then B” (or “A implies B”) is a conditional statement with hypothesis A and conclusion B. It’s contrapositive is “if not B then not A” and it’s converse is “if B then A”. Statements with the same truth table are said to be equivalent. The table shows that a conditional and it’s contrapositive are equivalent. A conditional is vacuously true if its hypothesis is false. A conditional is trivially true if its conclusion is true. Proof Techniques: We’ll give sample proofs about numbers. Here are some definitions. • integers: …, -2, -1, 0, 1, 2, … • odd integers: …, -3, -1, 1, 3, … (have the form 2k + 1 for some integer k). • even integers:…, -4, -2, 0, 2, 4, … (have the form 2k for some integer k). • m | n (read m divides n) if m ≠ 0 and n = km for some integer k. • p is prime if p > 1 and its only divisors are 1 and p.

Section 1.1 Proof Primer (cont) Exhaustive Checking Some statements can be proven by exhaustively checking a finite number of cases. Example 1. There is a prime number between 200 and 220. Proof: Check exhaustively and find that 211 is prime. QED. (quod erat demonstrandum) Example 2. Each of the numbers 288, 198, and 387 is divisible by 9. Proof: Check that 9 divides each of the numbers. QED. Conditional Proof Most statements we prove are conditionals. We start by assuming the hypothesis is true. Then we try to find a statement that follows from the hypothesis and/or known facts. We continue in this manner until we reach the conclusion. Example 3. If x is odd and y is even then x – y is odd. Proof: Assume x is odd and y is even. Then x = 2k + 1 and y = 2m for some integers k and m. So we have x – y = 2k + 1 – 2m = 2(k – m) + 1, which is an odd integer since k – m is an integer. QED. Example 4. If x is odd then x2 is odd. Proof: Assume x is odd. Then x = 2k + 1 for some integer k. So we have x2 = (2k + 1) 2 = 4k2 + 4k + 1 = 2(2k2 + 2k) + 1, which is an odd integer since 2k2 + 2k is an integer. QED.

Section 1.1 Proof Primer (cont) Example 5 If x is even then x2 is even. Proof: Class do as one minute quiz. Example 6 If x2 is odd then x is odd. Proof: The contrapositive of this statement is “if x is even, then x2 is even,” which is true by Example 5. QED. Example 7 If x2 is even then x is even. Proof: This is the contrapositive of Example 4, which has been shown to be true. QED. If And Only If (Iff) Proofs A statement of the form “A if and only if B” means “A implies B” and “B implies A.” So there are actually two proofs to give. Sometimes the proofs can be written as a single proof of the form “A iff C iff D iff … iff B,” where each iff statement is clear from previous information. Example 8 x is even if and only if x2 – 2x + 1 is odd. Proof: x is even iff x = 2k for some integer k (definition) iff x – 1 = 2k – 1 for some integer k (algebra) iff x – 1 = 2(k – 1) + 1 for some integer k – 1 (algebra) iff x – 1 is odd (definition) iff (x – 1) 2 is odd (Examples 4 and 6) iff x2 – 2x + 1 is odd (algebra). QED.

Section 1.1 Proof Primer (cont) Proof By Contradiction A false statement is called a contradiction. For example, “S and not S” is a contradiction for any statement S. A truth table will show us that “if A then B,” is equivalent to “A and not B implies false.” So to prove “if A then B,” it suffices to assume A and also to assume not B, and then argue toward a false statement. This technique is called proof by contradiction. Example 9. If x2 is odd then x is odd. Proof: Assume, BWOC, that x2 is odd and x is even. Then x = 2k for some integer k. So we have x2 = (2k) 2 = 4k2 = 2(2k2), which is even since 2k2 is an integer. So we have x2 is odd and x2 is even, a contradiction. So the statement is true. QED. Example 10. If 2 | 5n then n is even. Proof: Assume, BWOC, that 2 | 5n and n is odd. Since 2 | 5n, we have 5n = 2d for some integer d. Since n is odd, we have n = 2k + 1 for some integer k. Then we have 2d = 5n = 5(2k + 1) = 10k + 5. So 2d = 10k + 5. When we solve for 5 to get 5 = 2d –10k = 2(d – 5k). But this says that 5 is an even number, a contradiction. So the statement is true. QED.