Direct Proof and Counterexample I

Slides:



Advertisements
Similar presentations
Lecture 3 – February 17, 2003.
Advertisements

Discrete Math Methods of proof 1.
1 In this lecture  Number Theory ● Rational numbers ● Divisibility  Proofs ● Direct proofs (cont.) ● Common mistakes in proofs ● Disproof by counterexample.
(CSC 102) Lecture 12 Discrete Structures. Previous Lecture Summary Floor and Ceiling Functions Definition of Proof Methods of Proof Direct Proof Disproving.
Elementary Number Theory and Methods of Proof
– Alfred North Whitehead,
Direct Proof and Counterexample II Lecture 12 Section 3.2 Thu, Feb 9, 2006.
Induction and recursion
22C:19 Discrete Structures Logic and Proof Spring 2014 Sukumar Ghosh.
What is the best way to start? 1.Plug in n = 1. 2.Factor 6n 2 + 5n Let n be an integer. 4.Let n be an odd integer. 5.Let 6n 2 + 5n + 4 be an odd.
Copyright © Cengage Learning. All rights reserved.
CS 2210 (22C:019) Discrete Structures Logic and Proof Spring 2015 Sukumar Ghosh.
Methods of Proof & Proof Strategies
Introduction to Proofs
1 Methods of Proof CS/APMA 202 Epp, chapter 3 Aaron Bloomfield.
CSE 311: Foundations of Computing Fall 2013 Lecture 8: More Proofs.
Section 1.8. Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Nonexistence Proofs Uniqueness Proofs.
Chapter 5 Existence and Proof by contradiction
P. 270 #47-49.
Chapter 2 The Logic of Quantified Statements. Section 2.1 Intro to Predicates & Quantified Statements.
CompSci 102 Discrete Math for Computer Science March 1, 2012 Prof. Rodger Slides modified from Rosen.
Theorem The square of any odd integer has the form 8m + 1 for some integer m.
Method of proofs.  Consider the statements: “Humans have two eyes”  It implies the “universal quantification”  If a is a Human then a has two eyes.
Direct Proof and Counterexample III
22C:19 Discrete Structures Logic and Proof Fall 2014 Sukumar Ghosh.
Direct Proof and Counterexample I Lecture 12 Section 3.1 Tue, Feb 6, 2007.
2.3 Methods of Proof.
Mathematical Induction
CS104:Discrete Structures Chapter 2: Proof Techniques.
Week 3 - Monday.  What did we talk about last time?  Predicate logic  Multiple quantifiers  Negating multiple quantifiers  Arguments with quantified.
Statements Containing Multiple Quantifiers Lecture 11 Section 2.3 Mon, Feb 5, 2007.
Introduction to Proofs
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
Direct Proof and Counterexample I Lecture 11 Section 3.1 Fri, Jan 28, 2005.
CSE 311 Foundations of Computing I Lecture 8 Proofs Autumn 2012 CSE
Section 1.8. Proof by Cases Example: Let b = max{a, b} = a if a ≥ b, otherwise b = max{a, b} = b. Show that for all real numbers a, b, c
EXAMPLE 3 Write an indirect proof Write an indirect proof that an odd number is not divisible by 4. GIVEN : x is an odd number. PROVE : x is not divisible.
1 Discrete Mathematical Mathematical Induction ( الاستقراء الرياضي )
Mathematical Induction EECS 203: Discrete Mathematics Lecture 11 Spring
Mathematical Induction I Lecture 19 Section 4.2 Mon, Feb 14, 2005.
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
Lecture 2: Proofs and Recursion. Lecture 2-1: Proof Techniques Proof methods : –Inductive reasoning Lecture 2-2 –Deductive reasoning Using counterexample.
CS151: Mathematical Foundations of Computing Mathematical Induction.
11.7 – Proof by Mathematical Induction
The Foundations: Logic and Proofs
CS 2210:0001 Discrete Structures Logic and Proof
CSE15 Discrete Mathematics 02/08/17
Direct Proof and Counterexample II
Direct Proof and Counterexample I: Introduction
Methods of Proof CS 202 Epp, chapter 3.
Chapter 1: The Foundations: Logic and Proofs
CSE 311: Foundations of Computing
Direct Proof and Counterexample I
Direct Proof and Counterexample I
The Foundations: Logic and Proofs
Direct Proof and Counterexample IV
CS201: Data Structures and Discrete Mathematics I
Induction and recursion
Indirect Proof by Contradiction Direct Proof by Cases
Direct Proof and Counterexample II
Statements Containing Multiple Quantifiers
CS 220: Discrete Structures and their Applications
Direct Proof and Counterexample III
Section 2.1 Proof Techniques Introduce proof techniques:   o        Exhaustive Proof: to prove all possible cases, Only if it is about a.
Mathematical Induction I
Lecture 43 Section 10.1 Wed, Apr 6, 2005
Direct Proof and Counterexample IV
Mathematical Induction
Mathematical Induction II
Introduction to Proofs
Presentation transcript:

Direct Proof and Counterexample I Lecture 13 Section 3.1 Wed, Feb 7, 2007

Proving Universal Statements A universal statement is generally of the form x  D, P(x)  Q(x) Use the method of generalizing from the generic particular. Select an arbitrary x  D (generic particular). Assume that P(x) is true (hypothesis). Argue that Q(x) is true (conclusion).

Example: Direct Proof Theorem: If n is an odd integer, then n3 – n is a multiple of 12. Proof: Let n be an odd integer. Then n = 2k + 1 for some integer k. Then n3 – n = (2k + 1)3 – (2k + 1) = 8k3 + 12k2 +4k = 4k(2k2 + 1) + 12k2.

Example: Direct Proof Now divide into cases: k is a multiple of 3: Then we are done. If k is not a multiple of 3, Then k = 3m  1 for some integer m. And 2k2 + 1 = 2(3m  1)2 + 1 = 18m2  12m +3 = 3(6m2  4m + 1). Therefore, n3 – n is a multiple of 12.

An Alternate Proof Proof: n3 – n = (n – 1)(n)(n + 1), which is the product of 3 consecutive integers. One of them must be a multiple of 3. Since n is odd, n – 1 and n + 1 must be even, i.e., multiples of 2. Therefore, n3 – n must be a multiple of 12.

Example: Direct Proof Theorem: If x, y  R, then x2 + y2  2xy. Proof: Let x, y  R. x2 – 2xy + y2  0. (x – y)2  0, which is known to be true.

Example: Direct Proof Theorem: If x, y  R, then x2 + y2  2xy. Proof: Let x, y  R. x2 – 2xy + y2  0. (x – y)2  0, which is known to be true. What is wrong with this “proof?”

Example: Direct Proof Correct proof: Let x, y  R. (x – y)2  0. x2 – 2xy + y2  0. x2 + y2  2xy.

Example: Disproving an Existential Statement Theorem: There is no solution in real numbers to the equation 2x = x.

Example: Disproving an Existential Statement Theorem: There is no solution in integers to the equation x2 – y2 = 101010 + 2. However, there is a solution in integers to the equation x2 – y2 = 101010 + 1.

Example: Proving an Existential Statement The standard 8 x 8 checkerboard, with two adjacent corners removed, can be covered with 1 x 2 and 2 x 1 rectangles.

Example: Proving an Existential Statement The standard 8 x 8 checkerboard, with two adjacent corners removed, can be covered with 1 x 2 and 2 x 1 rectangles. Yes!

Example: Disproving an Existential Statement The standard 8 x 8 checkerboard, with two opposite corners removed, cannot be covered with 1 x 2 and 2 x 1 rectangles.

Example: Disproving an Existential Statement The standard 8 x 8 checkerboard, with two opposite corners removed, cannot be covered with 1 x 2 and 2 x 1 rectangles. Oops!

Prove or Disprove Prove or disprove: The standard 8 x 8 checkerboard, with any two squares of different colors removed, can be covered with 1 x 2 and 2 x 1 rectangles.

Prove or Disprove Prove or disprove: For every positive integer n, a 2n x 2n checkerboard, with any two squares of different colors removed, can be covered with 1 x 2 and 2 x 1 rectangles.