Copyright © Cengage Learning. All rights reserved.

Slides:



Advertisements
Similar presentations
Chapter 3 Elementary Number Theory and Methods of Proof.
Advertisements

Chapter 3 Elementary Number Theory and Methods of Proof.
Chapter 3 Elementary Number Theory and Methods of Proof.
Copyright © Cengage Learning. All rights reserved.
Elementary Number Theory and Methods of Proof
– Alfred North Whitehead,
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
1 Set Theory. Notation S={a, b, c} refers to the set whose elements are a, b and c. a  S means “a is an element of set S”. d  S means “d is not an element.
1 Number Theory and Methods of Proof Content: Properties of integer, rational and real numbers. Underlying theme: Methods of mathematical proofs.
2.5 Reasoning in Algebra and Geometry
Copyright © Cengage Learning. All rights reserved. CHAPTER 1 SPEAKING MATHEMATICALLY SPEAKING MATHEMATICALLY.
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
Chapter 4: Elementary Number Theory and Methods of Proof 4.2 Direct Proof and Counter Example II: Rational Numbers 1 Such, then, is the whole art of convincing.
Chapter 3 Elementary Number Theory and Methods of Proof.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
Arguments with Quantified Statements M Universal Instantiation If some property is true for everything in a domain, then it is true of any particular.
2-5 Algebraic proofs. SAT Problem of the day The volume and surface area of a cube are equal. What is the length of an edge of this cube? A) 1 B) 2 C)4.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
Copyright © 2010 Pearson Education, Inc. All rights reserved. 1.7 – Slide 1.
Copyright © Cengage Learning. All rights reserved.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
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,
Warm Up. Warm Up Answers Theorem and Proof A theorem is a statement or conjecture that has been shown to be true. A theorem is a statement or conjecture.
Copyright © Cengage Learning. All rights reserved. CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF ELEMENTARY NUMBER THEORY AND METHODS OF PROOF.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
Week 3 - Monday.  What did we talk about last time?  Predicate logic  Multiple quantifiers  Negating multiple quantifiers  Arguments with quantified.
1 Set Theory Second Part. 2 Disjoint Set let A and B be a set. the two sets are called disjoint if their intersection is an empty set. Intersection of.
Holt McDougal Geometry 2-5 Algebraic Proof Review properties of equality and use them to write algebraic proofs. Identify properties of equality and congruence.
Chapter 1 Logic and Proof.
Arguments with Quantified Statements
Copyright © Cengage Learning. All rights reserved.
3. The Logic of Quantified Statements Summary
Direct Proof and Counterexample III: Divisibility
Direct Proof and Counterexample I: Introduction
Formal Logic CSC 333.
Reflexivity, Symmetry, and Transitivity
Advanced Algorithms Analysis and Design
CSE 311: Foundations of Computing
Proof Techniques.
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
Copyright © Cengage Learning. All rights reserved.
Direct Proof and Counterexample V: Floor and Ceiling
Methods for Evaluating Validity
2.5 Reasoning in Algebra and Geometry
Copyright © Cengage Learning. All rights reserved.
2. Definition of congruent segments AB = CD 2.
Sets and Logic…. Chapter 3
8.5 Equivalence Relations
The sum of any two even integers is even.
Copyright © Cengage Learning. All rights reserved.
8.5 Equivalence Relations and 8.6 Partial Ordering
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
2-5 Algebraic Proof Are You? Ready Lesson Presentation Lesson Quiz
Copyright © Cengage Learning. All rights reserved.
2-5 Algebraic Proof Warm Up Lesson Presentation Lesson Quiz
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
9.5 Equivalence Relations
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Advanced Analysis of Algorithms
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Copyright © 2013 Elsevier Inc. All rights reserved.
Presentation transcript:

Copyright © Cengage Learning. All rights reserved. CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS Copyright © Cengage Learning. All rights reserved.

Use of Universal Modus Ponens in a Proof

Use of Universal Modus Ponens in a Proof Here is a proof that the sum of any two even integers is even. It makes use of the definition of even integer, namely, that an integer is even if, and only if, it equals twice some integer. (Or, more formally: integers x, x is even if, and only if, ∃ an integer k such that x = 2k.) Suppose m and n are particular but arbitrarily chosen even integers. Then m = 2r for some integer r,(1) and n = 2s for some integer s.(2)

Use of Universal Modus Ponens in a Proof Hence Now r + s is an integer,(4) and so 2(r + s) is even.(5) Thus m + n is even.

Use of Universal Modus Ponens in a Proof The following expansion of the proof shows how each of the numbered steps is justified by arguments that are valid by universal modus ponens. (1) If an integer is even, then it equals twice some integer. m is a particular even integer. • m equals twice some integer r. (2) If an integer is even, then it equals twice some integer. n is a particular even integer. • n equals twice some integer s.

Use of Universal Modus Ponens in a Proof (3) If a quantity is an integer, then it is a real number. r and s are particular integers. • r and s are real numbers. For all a, b, and c, if a, b, and c are real numbers, then ab + ac = a (b + c). 2, r, and s are particular real numbers. • 2r + 2s = 2(r + s). (4) For all u and v, if u and v are integers, then u + v is an integer. r and s are two particular integers. • r + s is an integer.

Use of Universal Modus Ponens in a Proof (5) If a number equals twice some integer, then that number is even. 2(r + s) equals twice the integer r + s. • 2(r + s) is even.