– Alfred North Whitehead,

Slides:



Advertisements
Similar presentations
With examples from Number Theory
Advertisements

Discrete Math Methods of proof 1.
Introduction to Proofs
Chapter 3 Elementary Number Theory and Methods of Proof.
1 In this lecture  Number Theory ● Rational numbers ● Divisibility  Proofs ● Direct proofs (cont.) ● Common mistakes in proofs ● Disproof by counterexample.
Chapter 3 Elementary Number Theory and Methods of Proof.
(CSC 102) Lecture 12 Discrete Structures. Previous Lecture Summary Floor and Ceiling Functions Definition of Proof Methods of Proof Direct Proof Disproving.
3.3 Divisibility Definition If n and d are integers, then n is divisible by d if, and only if, n = dk for some integer k. d | n  There exists an integer.
Elementary Number Theory and Methods of Proof
CSE115/ENGR160 Discrete Mathematics 01/31/12 Ming-Hsuan Yang UC Merced 1.
CSE115/ENGR160 Discrete Mathematics 02/01/11
CMSC 250 Discrete Structures Number Theory. 20 June 2007Number Theory2 Exactly one car in the plant has color H( a ) := “ a has color”  x  Cars –H(
So far we have learned about:
Proof Must Have Statement of what is to be proven.
The essential quality of a proof is to compel belief.
Introduction to Proofs Goals 1.Introduce notion of proof & basic proof methods. 2.Distinguish between correct & incorrect arguments 3.Understand & construct.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
1 Number Theory and Methods of Proof Content: Properties of integer, rational and real numbers. Underlying theme: Methods of mathematical proofs.
Week 3 - Wednesday.  What did we talk about last time?  Basic number theory definitions  Even and odd  Prime and composite  Proving existential statements.
DISCRETE MATHEMATICS I LECTURES CHAPTER 4 Dr. Adam Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr. Sam.
Methods of Proof & Proof Strategies
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.
Introduction to Proofs
Copyright © Cengage Learning. All rights reserved. CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF.
1 Introduction to Abstract Mathematics Chapter 3: Elementary Number Theory and Methods of Proofs Instructor: Hayk Melikya Direct.
Chapter 5 Existence and Proof by contradiction
Properties and Numbers 1.4. Deductive Reasoning Using facts, properties or rules to reach a valid conclusion Conjecture: statement that could be true.
Geometry Honors Section 2. 2
1 Methods of Proof Proof techniques in this handout –Direct proof –Division into cases –Proof by contradiction In this handout, the proof techniques will.
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,
Chapter 2 Symbolic Logic. Section 2-1 Truth, Equivalence and Implication.
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.
Chapter 1: Variables, Function Patterns, and Graphs 1.1 Using Variables.
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.
Introduction to Proofs
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:"
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.
Section 2.2 More practice with Direct Proofs. Directions for Writing Proofs 1.Copy the statement of the theorem to be proved onto your paper. 2.Clearly.
Section 2.2 Direct Proofs. Test #1 update I have decided to drop one question from the exam. This means I will add six points to everyone’s score.
1 Discrete Mathematical Mathematical Induction ( الاستقراء الرياضي )
Chapter 5 1. Chapter Summary  Mathematical Induction  Strong Induction  Recursive Definitions  Structural Induction  Recursive Algorithms.
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
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.
Methods of Proof Proof techniques in this handout
Introduction to Deductive Proofs
Direct Proof and Counterexample III: Divisibility
Direct Proof and Counterexample I: Introduction
Induction and recursion
Chapter 1: The Foundations: Logic and Proofs
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
Copyright © Cengage Learning. All rights reserved.
The Foundations: Logic and Proofs
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CS 220: Discrete Structures and their Applications
Equations and Inequalities
Copyright © Cengage Learning. All rights reserved.
Algebra Stop Being Scared!!!.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Induction Chapter
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
Lecture 5 Number Theory & Proof Methods
Mathematical Induction
Introduction to Proofs
PROGRAMME: F.Y.B.Sc.I.T. (SEM-I) COURSE: DISCRETE MATHEMATICS
Presentation transcript:

– Alfred North Whitehead, 1861-1947 Discrete Structures Chapter 4: Elementary Number Theory and Methods of Proof 4.1 Direct Proof and Counter Example I: Introduction Mathematics, as a science, commenced when first someone, probably a Greek, proved propositions about “any” things or about “some” things without specification of definite particular things. – Alfred North Whitehead, 1861-1947 4.1 Direct Proof and Counter Example I: Introduction

4.1 Direct Proof and Counter Example I: Introduction Assumptions We assume that we know the laws of basic algebra (see Appendix A). we know the three properties of equality for objects A, B, and C: A = A If A = B then B = A If A = B,B = C, then A = C there is no integer between 0 and 1 and that the set of integers is closed under addition, subtraction, and multiplication. most quotients of integers are not integers. 4.1 Direct Proof and Counter Example I: Introduction

4.1 Direct Proof and Counter Example I: Introduction Definitions Even Integer An integer n is even iff n equals twice some integer. Symbolically, if n is an integer, then n is even   k  Z s.t. n = 2k. Odd Integer An integer n is odd iff n equals twice some integer plus 1. Symbolically, if n is an integer, then n is odd   k  Z s.t. n = 2k + 1. 4.1 Direct Proof and Counter Example I: Introduction

4.1 Direct Proof and Counter Example I: Introduction Definitions Prime Integer An integer n is prime iff n > 1 for all positive integers r and s, if n = rs, then either r or s equals n Symbolically, if n is an integer, then n is prime   r, s  Z+ , if n = rs then either r = 1 and s = n or s = 1 and r = n . Composite Integer An integer n is composite iff n > 1 and n = rs for all positive integers r and s with 1 < r < n and 1 < s < n. Symbolically, if n is an integer, then n is composite   r, s  Z+ s.t. n = rs and 1 < r < n and 1 < s < n. 4.1 Direct Proof and Counter Example I: Introduction

4.1 Direct Proof and Counter Example I: Introduction Example – pg. 161 # 3 Use the definitions of even, odd, prime, and composite to justify each of your answers. Assume that r and s are particular integers. Is 4rs even? Is 6r + 4s2 + 3 odd? If r and s are both positive, is r2 + 2rs + s2 composite? 4.1 Direct Proof and Counter Example I: Introduction

Disproof by Counterexample To disprove a statement of the form “ xD, if P(x) then Q(x),” find a value of x in D for which the hypothesis P(x) is true and the conclusion Q(x) is false. Such an x is called a counterexample. 4.1 Direct Proof and Counter Example I: Introduction

4.1 Direct Proof and Counter Example I: Introduction Example – pg. 161 # 13 Disprove the statements by giving a counterexample. For all integers m and n, if 2m + n is odd then m and n are both odd. 4.1 Direct Proof and Counter Example I: Introduction

4.1 Direct Proof and Counter Example I: Introduction Method of Direct Proof Express the statement to be proved in the form “ x  D, if P(x) then Q(x).” Start the proof by supposing x is a particular but arbitrarily chosen element of D for which the hypothesis P(x) is true. (Abbreviated: suppose x  D and P(x).) Show that the conclusion Q(x) is true by using definitions, previously established results, and the rules for logical inference. 4.1 Direct Proof and Counter Example I: Introduction

4.1 Direct Proof and Counter Example I: Introduction How to Write Proofs Copy the statement. Start your proof with: Proof: Define your variables. Write your proof in complete, grammatically correct sentences. Keep your reader informed. Given a reason for each assertion. Include words or phrases to make the logic clear. Display equations and inequalities. Conclude with . 4.1 Direct Proof and Counter Example I: Introduction

4.1 Direct Proof and Counter Example I: Introduction Prove the theorem: The sum of any even integer and any odd integer is odd. 4.1 Direct Proof and Counter Example I: Introduction

4.1 Direct Proof and Counter Example I: Introduction Example – pg 162 # 27 Determine whether the statement is true or false. Justify your answer with a proof or a counterexample as appropriate. Use only the definitions of terms and the assumptions on page 146. The sum of any two odd integers is even. 4.1 Direct Proof and Counter Example I: Introduction