Dr. Halimah Alshehri haalshehri@ksu.edu.sa MATH 151 Dr. Halimah Alshehri haalshehri@ksu.edu.sa Dr. Halimah Alshehri.

Slides:



Advertisements
Similar presentations
Tutorial 2: First Order Logic and Methods of Proofs
Advertisements

Discrete Math Methods of proof 1.
Introduction to Proofs
PROOF BY CONTRADICTION
Review for CS1050. Review Questions Without using truth tables, prove that  (p  q)   q is a tautology. Prove that the sum of an even integer and an.
Chapter 3 Elementary Number Theory and Methods of Proof.
Mathematical induction Isaac Fung. Announcement ► Homework 1 released ► Due on 6 Oct 2008 (in class)
CSE115/ENGR160 Discrete Mathematics 02/01/11
So far we have learned about:
1 Inference Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
Copyright © Zeph Grunschlag,
1 Indirect Argument: Contradiction and Contraposition.
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.
Methods of Proof Leo Cheung. A Quick Review Direct proof Proof by contrapositive Proof by contradiction Proof by induction.
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.
Methods of Proof Lecture 4: Sep 16 (chapter 3 of the book)
Methods of Proof & Proof Strategies
Introduction to Proofs
Proofs 1/25/12.
Copyright © Cengage Learning. All rights reserved. CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF ELEMENTARY NUMBER THEORY AND METHODS OF PROOF.
Methods of Proof. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical theorems. Direct.
Methods of Proofs PREDICATE LOGIC The “Quantifiers” and are known as predicate quantifiers. " means for all and means there exists. Example 1: If we.
Discrete Mathematics Tutorial 11 Chin
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.
Logical Reasoning:Proof Prove the theorem using the basic axioms of algebra.
P. 270 #47-49.
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.
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,
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.
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.
2.3 Methods of Proof.
Introduction to Proofs
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.
5-5 Indirect Proof. Indirect Reasoning: all possibilities are considered and then all but one are proved false. The remaining possibility must be true.
1 Introduction to Abstract Mathematics Proof Methods , , ~, ,  Instructor: Hayk Melikya Purpose of Section:Most theorems in mathematics.
Introduction to Proofs. The use of Reasoning and Logic in proofs Inductive Reasoning- “reasoning from detailed facts to general principles” – Specific.
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)
1 Discrete Mathematical Mathematical Induction ( الاستقراء الرياضي )
Section 1.7. Section Summary Mathematical Proofs Forms of Theorems Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction.
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.
Lecture 2: Proofs and Recursion. Lecture 2-1: Proof Techniques Proof methods : –Inductive reasoning Lecture 2-2 –Deductive reasoning Using counterexample.
Introduction to Proofs Goals 1.Introduce notion of proof & basic proof methods. 2.Distinguish between correct & incorrect arguments 3.Understand & construct.
Chapter 1 Logic and Proof.
Indirect Argument: Contradiction and Contraposition
3.1 Indirect Proof and Parallel Postulate
Indirect Argument: Two Classical Theorems
Indirect Argument: Contradiction and Contraposition
Direct Proof by Contraposition Direct Proof by Contradiction
Indirect Argument: Contradiction and Contraposition
Discrete Math for CS CMPSC 360 LECTURE 4 Last time and recitations:
1.2 Propositional Equivalences
Indirect Proof by Contradiction Direct Proof by Cases
CS 220: Discrete Structures and their Applications
Copyright © 2014 Pearson Education, Inc.
Section 2.1 Proof Techniques Introduce proof techniques:   o        Exhaustive Proof: to prove all possible cases, Only if it is about a.
Indirect Argument: Contradiction and Contraposition
1.2 Propositional Equivalences
Geometry.
Copyright © Cengage Learning. All rights reserved.
5.6 Inequalities in Two Triangles and Indirect Proof
6-2: Indirect Proofs Proof Geometry.
Chapter 5 Parallel Lines and Related Figures
CSE 321 Discrete Structures
Introduction to Proofs
Presentation transcript:

Dr. Halimah Alshehri haalshehri@ksu.edu.sa MATH 151 Dr. Halimah Alshehri haalshehri@ksu.edu.sa Dr. Halimah Alshehri

Test dates First Midterm (Wednesday ) 15\6\1440 H (20 Feb.) Second Midterm (Wednesday) 5\8\1440 H (10 Apr.) Final (Sunday) 16\8\1440 H (21 Apr.) Dr. Halimah Alshehri

Methods of Proof Dr. Halimah Alshehri

Methods of Proof 3- Contrapositive Proof 4- By Induction 1- Direct 2- Indirect Proof (Contradiction) Dr. Halimah Alshehri

DEFINITION: 1. An integer number n is even if and only if there exists a number k such that n = 2k. 2. An integer number n is odd if and only if there exists a number k such that n = 2k + 1. Dr. Halimah Alshehri

Direct Proof: The simplest and easiest method of proof available to us. There are only two steps to a direct proof: 1. Assume that P is true. 2. Use P to show that Q must be true. Dr. Halimah Alshehri

Example1: Use direct proof to show that : If n is an odd integer then 𝑛 2 is also an odd integer. Dr. Halimah Alshehri

Dr. Halimah Alshehri

Example2: Use a direct proof to show that the sum of two even integers is even. Dr. Halimah Alshehri

Use a direct proof to show that the sum of two even integers is even. Suppose that m and n are two even integers , so ∃ 𝑘,𝑗 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 𝑚=2𝑘 𝑎𝑛𝑑 𝑛=2j. Then 𝑚+𝑛=(2𝑘)+(2𝑗) =2k+2j =2(𝑘+𝑗) =2𝑡 , 𝑤ℎ𝑒𝑟𝑒 𝑡=𝑘+𝑗. Thus, 𝑚+𝑛 is even. □ Dr. Halimah Alshehri

Example 3: Use a direct proof to show that every odd integer is the difference of two squares. Dr. Halimah Alshehri

Dr. Halimah Alshehri

Indirect proof (Proof by Contradiction) The proof by contradiction is grounded in the fact that any proposition must be either true or false, but not both true and false at the same time. 1. Assume that P is true. 2. Assume that ¬𝐐 is true. 3. Use P and ¬𝐐 to demonstrate a contradiction. Dr. Halimah Alshehri

Example 3: Use indirect proof to show that : If 𝑥 2 is an odd then so is 𝑥. Dr. Halimah Alshehri

Dr. Halimah Alshehri

Proof by Contrapositive Recall that first-order logic shows that the statement P ⇒ Q is equivalent to ¬Q ⇒ ¬P. 1. Assume ¬Q is true. 2. Show that ¬P must be true. 3. Observe that P ⇒ Q by contraposition. Dr . Halimah Alshehri

Example 4: Let x be an integer. Prove that : If x² is even, then x is even. (by Contrapositive proof) Dr. Halimah Alshehri

Dr. Halimah Alshehri

Prove that: For all integers m and n, if m and n are odd integers, then m + n is an even integer. (using direct proof) Show that by (Contradiction): For x is an integer. If 3x+2 is even, then x is even. Using (Proof by Contrapositive) to show that: For x is an integer. If 7x+9 is even, then x is odd. Dr, Halimah Alshehri