PROOF BY CONTRADICTION

Slides:



Advertisements
Similar presentations
Is it rational or irrational?
Advertisements

PROOF BY CONTRADICTION
To prove by induction that 2 n ≥ n 2 for n ≥ 4, n  N Next (c) Project Maths Development Team 2011.
Chapter 3 Elementary Number Theory and Methods of Proof.
1 Mathematical Induction. 2 Mathematical Induction: Example  Show that any postage of ≥ 8¢ can be obtained using 3¢ and 5¢ stamps.  First check for.
Anna Chang T2. Angle-Side Relationships in Triangles The side that is opposite to the smallest angle will be always the shortest side and the side that.
Courtesy Costas Busch - RPI1 More Applications of the Pumping Lemma.
CS5371 Theory of Computation
CSE115/ENGR160 Discrete Mathematics 02/01/11
1 Inference Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
Copyright © Zeph Grunschlag,
1 More Applications of the Pumping Lemma. 2 The Pumping Lemma: Given a infinite regular language there exists an integer for any string with length we.
Methods of Proof Leo Cheung. A Quick Review Direct proof Proof by contrapositive Proof by contradiction Proof by induction.
Strong Induction, WOP and Invariant Method Leo Cheung.
Introduction to Proofs ch. 1.6, pg. 87,93 Muhammad Arief download dari
Introduction to Proofs Goals 1.Introduce notion of proof & basic proof methods. 2.Distinguish between correct & incorrect arguments 3.Understand & construct.
Chapter 10 Sequences, Induction, and Probability Copyright © 2014, 2010, 2007 Pearson Education, Inc Mathematical Induction.
Prof. Busch - LSU1 More Applications of the Pumping Lemma.
Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.
ICS 253 Presents Mathematical Induction Sultan Almuhammadi muhamadi
Making an Argument The goal of communication is to achieve the desired affect on the target audience. Often we want to convince the audience of something.
Mathematical Induction. F(1) = 1; F(n+1) = F(n) + (2n+1) for n≥ F(n) n F(n) =n 2 for all n ≥ 1 Prove it!
1 Methods of Proof CS/APMA 202 Epp, chapter 3 Aaron Bloomfield.
Ch 1.5: Basic Proof Methods II Proof by Contraposition of P => Q Suppose ~Q …proof details here…. Therefore, ~P (via a direct proof) Thus, ~Q => ~P. Therefore,
Conditional Statements CS 2312, Discrete Structures II Poorvi L. Vora, GW.
Chapter 5 Existence and Proof by contradiction
Methods of Proof Lecture 3: Sep 9. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical.
9.4 Mathematical Induction
Logical Reasoning:Proof Prove the theorem using the basic axioms of algebra.
P. 270 #47-49.
Mathematical Induction Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Mathematical induction is a legitimate method.
Section 3.3: Mathematical Induction Mathematical induction is a proof technique that can be used to prove theorems of the form:  n  Z +,P(n) We have.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Introduction to Proofs.
4.1 Proofs and Counterexamples. Even Odd Numbers Find a property that describes each of the following sets E={…, -4, -2, 0, 2, 4, 6, …} O={…, -3, -1,
Do you agree with the following proofs? 1.Prove that  2 is irrational. Proof: Suppose that  2 is not irrational, then  2 = p/q for some natural numbers.
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.
Types of Proof Lecture 4 Sections 0.4 Wed, Aug 29, 2007.
CS104:Discrete Structures Chapter 2: Proof Techniques.
Introduction to Proofs
1 Review for Quiz 1. 2 Summations 3 Binomial expansion.
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.
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.
Methods of Proof Lecture 4: Sep 20 (chapter 3 of the book, except 3.5 and 3.8)
Mathematical Induction. The Principle of Mathematical Induction Let S n be a statement involving the positive integer n. If 1.S 1 is true, and 2.the truth.
1 Proofs by Counterexample & Contradiction There are several ways to prove a theorem:  Counterexample: By providing an example of in which the theorem.
Introduction to Proofs Goals 1.Introduce notion of proof & basic proof methods. 2.Distinguish between correct & incorrect arguments 3.Understand & construct.
5.6 Comparing Measures of a Triangle
CSE322 PUMPING LEMMA FOR REGULAR SETS AND ITS APPLICATIONS
6.5 Inequalities in Triangles and Indirect Proofs
You will learn to use indirect reasoning to write proofs
Direct Proof by Contraposition Direct Proof by Contradiction
Chapter 3 The Real Numbers.
Methods of Proof CS 202 Epp, chapter 3.
Check It Out! Example 1 Write an indirect proof that a triangle cannot have two right angles. Step 1 Identify the conjecture to be proven. Given: A triangle’s.
An indirect proof uses a temporary assumption that
Section 2.1 Proof Techniques Introduce proof techniques:   o        Exhaustive Proof: to prove all possible cases, Only if it is about a.
Mathematical Induction
More Applications of the Pumping Lemma
Geometry.
Dr. Halimah Alshehri MATH 151 Dr. Halimah Alshehri Dr. Halimah Alshehri.
To prove by induction that n! > 2n for n > 3, n  N
Proof by Induction L.O. All pupils understand proof by induction
Mathematical Induction
Mathematical Induction
Examples of Mathematical Proof
5.6 Inequalities in Two Triangles and Indirect Proof
Given: the cost of two items is more than $50.
Proof: [We take the negation and suppose it to be true.]
Introduction to Proofs
Presentation transcript:

PROOF BY CONTRADICTION

Proof by Contradiction To prove that r is true, prove that the assumption that r is false implies a contradiction. In particular, to prove that p→q is true, prove that the assumption that p is true and q is false implies a contradiction.

proof by contradiction EXAMPLE: Prove that the sum of an even integer and a non-even integer is non-even. (Note: a non-even integer is an integer that is not even.)

proof by contradiction We have to prove that for every even integer a and every non-even integer b, a+b is non-even. This is the same as proving that For all integers a,b, if [a is even and b is non-even] then [a+b is non-even].

proof by contradiction We prove that by contradiction. Assume that [a is even and b is non-even], and that [a+b is even]. So for some integers m,n, a=2m and a+b=2n. Since b=(a+b)-a, b=2n-2m=2(n-m). We conclude that b is even. This leads to a contradiction, since we assumed that b is non-even.