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.

Slides:



Advertisements
Similar presentations
Completeness and Expressiveness
Advertisements

With examples from Number Theory
Mathematical Induction
Introduction to Proofs
Chapter 3 Direct Proof and Proof by Contrapositive
Inference and Reasoning. Basic Idea Given a set of statements, does a new statement logically follow from this. For example If an animal has wings and.
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
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
– Alfred North Whitehead,
Direct Proof and Counterexample II Lecture 12 Section 3.2 Thu, Feb 9, 2006.
Copyright © Cengage Learning. All rights reserved.
So far we have learned about:
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.
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.
Copyright © Cengage Learning. All rights reserved.
CS2420: Lecture 2 Vladimir Kulyukin Computer Science Department Utah State University.
1 Section 3.3 Mathematical Induction. 2 Technique used extensively to prove results about large variety of discrete objects Can only be used to prove.
CSE115/ENGR160 Discrete Mathematics 03/29/11 Ming-Hsuan Yang UC Merced 1.
5.6 Indirect Proof and Inequalities in Two triangles.
Methods of Proof & Proof Strategies
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.
Introduction to Proofs
1 Methods of Proof CS/APMA 202 Epp, chapter 3 Aaron Bloomfield.
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.
Copyright © Cengage Learning. All rights reserved. CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF.
Methods of Proofs PREDICATE LOGIC The “Quantifiers” and are known as predicate quantifiers. " means for all and means there exists. Example 1: If we.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Chapter 5 Existence and Proof by contradiction
Section 2.21 Indirect Proof: Uses Laws of Logic to Prove Conditional Statements True or False.
Ch 1.4: Basic Proof Methods I A theorem is a proposition, often of special interest. A proof is a logically valid deduction of a theorem, using axioms,
Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems and pg. 171.
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.
Theorem: Equal weight implies equal power but not the converse.
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.
Copyright © Cengage Learning. All rights reserved. CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF ELEMENTARY NUMBER THEORY AND METHODS OF PROOF.
CSE373: Data Structures and Algorithms Lecture 2: Proof by Induction Linda Shapiro Winter 2015.
CS104:Discrete Structures Chapter 2: Proof Techniques.
Proofs, Recursion and Analysis of Algorithms Mathematical Structures for Computer Science Chapter 2 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProofs,
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.
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.
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 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.
Critical Thinking Lesson 6 Learning Objectives: 1. To talk through the mock exam from last week and to look at the correct answers. 1. To be aware of what.
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
Direct Proof and Counterexample I: Introduction
Proof methods We will discuss ten proof methods: Direct proofs
Methods of Proof CS 202 Epp, chapter 3.
Direct Proof and Counterexample V: Floor and Ceiling
CSE373: Data Structures and Algorithms Lecture 2: Proof by Induction
CSE373: Data Structures and Algorithms Lecture 2: Proof by Induction
The sum of any two even integers is even.
Geometry.
Copyright © Cengage Learning. All rights reserved.
Induction Chapter
Copyright © Cengage Learning. All rights reserved.
Vocabulary Indirect Proof
Learning Targets I will identify the first step in an indirect proof.
Copyright © Cengage Learning. All rights reserved.
Proof: [We take the negation and suppose it to be true.]
Introduction to Proofs
Presentation transcript:

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.

Why does a computer scientist need to know how to do proofs?? When we study algorithms we need to know two things: Does it fulfill it’s requirements? –If it doesn’t it is worthless. –Worse case scenario, people die. How long does it take to run?

Directions for Writing Proofs 1.Copy the statement of the theorem to be proved onto your paper. 2.Clearly mark the beginning of your proof with the word PROOF.

Directions for Writing Proofs 3.Make your proof self contained –Explain the meaning and type of each variable (normally at the beginning). “Suppose m and n are even integers…” 4.Write your proof in complete, grammatically correct sentences. Then m+n = 2r + 2s = 2(r+s)

Directions for Writing Proofs 5.Keep your reader informed about the status of each statement in your proof. –Your reader should never be in doubt about whether something in your proof has been assumed, established, or is still to be deduced. If it is assumed use words like “Suppose” or “Assume” If it is still to be shown use “We must show that”

Directions for Writing Proofs 6.Give a reason for each assertion in your proof. –“By hypothesis” –“By definition of even, m=2r” 7.Include the “little words” that make the logic clear –Thus, then, so, therefore, consequently, etc..

Directions for Writing Proofs 8.Clearly display equations and inequalities. –The convention is to display equations and inequalities on separate lines to increase readability.

Example

Group Examples Prove: The negative of an even integer is even

Group Examples Prove: The sum of an even integer and an odd integer is odd.

Group Examples Prove: For all integers n, if n is odd then n 2 is odd.