Week #6 – 30 September / 2/4 October 2002 Prof. Marie desJardins

Slides:



Advertisements
Similar presentations
Discrete Mathematics Math 6A
Advertisements

Discrete Mathematics University of Jazeera College of Information Technology & Design Khulood Ghazal Mathematical Reasoning Methods of Proof.
Introduction to Proofs
Announcements Grading policy No Quiz next week Midterm next week (Th. May 13). The correct answer to the quiz.
1 Section 1.5 Rules of Inference. 2 Definitions Theorem: a statement that can be shown to be true Proof: demonstration of truth of theorem –consists of.
February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 1 Addition of Integers Example: Add a = (1110) 2 and b = (1011) 2. a 0 + b.
Chapter 3. Mathematical Reasoning 3.1 Methods of proof A theorem is a statement that can be shown to be true. A proof is to demonstrate that a theorem.
Week #10 – 28/30 October and 1 November 2002 Prof. Marie desJardins
1 Mathematical Induction. 2 Mathematical Induction: Example  Show that any postage of ≥ 8¢ can be obtained using 3¢ and 5¢ stamps.  First check for.
Induction and recursion
CSE115/ENGR160 Discrete Mathematics 01/31/12 Ming-Hsuan Yang UC Merced 1.
CSE115/ENGR160 Discrete Mathematics 02/01/11
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.
Fall 2002CMSC Discrete Structures1 Let’s proceed to… Mathematical Reasoning.
Methods of Proof & Proof Strategies
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 03: PROOFS Section 1.5 Jarek Rossignac CS1050: Understanding.
Copyright © Peter Cappello Mathematical Induction Goals Explain & illustrate construction of proofs of a variety of theorems using mathematical induction.
Week #7 – 7/9/11 October 2002 Prof. Marie desJardins
CS 103 Discrete Structures Lecture 07b
March 3, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 1Arguments Just like a rule of inference, an argument consists of one or more.
Proofs1 Elementary Discrete Mathematics Jim Skon.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Proofs1 Advanced Discrete Mathematics Jim Skon. Proofs2  Definition: A theorem is a valid logical assertion which can be proved using other theorems.
Discrete Structures (DS)
Module #13: Inductive Proofs Rosen 5 th ed., § inference of a generalized conclusion from particular instances 2. mathematical demonstration of the.
Chap 3 –A theorem is a statement that can be shown to be true –A proof is a sequence of statements to show that a theorem is true –Axioms: statements which.
Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 1/18 Module.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
資訊科學數學 7 : Proof, Number and Orders 陳光琦助理教授 (Kuang-Chi Chen)
Module #1 - Logic Based on Rosen, Discrete Mathematics & Its Applications. Prepared by (c) , Michael P. Frank. Modified By Mingwu Chen 1 Module.
CS104:Discrete Structures Chapter 2: Proof Techniques.
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.
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.
September1999 CMSC 203 / 0201 Fall 2002 Exam #1 Review – 27 September 2002 Prof. Marie desJardins.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Mathematical Induction
Chapter 1, Part III: Proofs With Question/Answer Animations Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without.
Nature & Importance of Proofs In mathematics, a proof is: –a correct (well-reasoned, logically valid) and complete (clear, detailed) argument that rigorously.
Chapter 1 Logic and proofs
Chapter 5 1. Chapter Summary  Mathematical Induction  Strong Induction  Recursive Definitions  Structural Induction  Recursive Algorithms.
CSE15 Discrete Mathematics 02/01/17
Applied Discrete Mathematics Week 5: Mathematical Reasoning
Advanced Algorithms Analysis and Design
Induction and recursion
Proof Techniques.
Methods of Proof A mathematical theorem is usually of the form pq
Explorations in Artificial Intelligence
Discrete Mathematics and its Applications
Module #10: Proof Strategies
The Foundations: Logic and Proofs
Discrete Mathematics and its Applications
Mathematical Reasoning
Induction and recursion
Methods of Proof. Methods of Proof Definitions A theorem is a valid logical assertion which can be proved using Axioms: statements which are given.
CS 220: Discrete Structures and their Applications
Applied Discrete Mathematics Week 1: Logic
Xuan Guo Lab 4 Xuan Guo
Inference Rules: Tautologies
Information Technology Department SKN-SITS,Lonavala.
Module #10: Proof Strategies
Follow me for a walk through...
September 9, 2004 Prof. Marie desJardins (for Prof. Matt Gaston)
Foundations of Discrete Mathematics
Advanced Analysis of Algorithms
Mathematical Reasoning
Discrete Mathematics and its Applications
Introduction to Proofs
Follow me for a walk through...
Agenda Proofs (Konsep Pembuktian) Direct Proofs & Counterexamples
Rules of inference Section 1.5 Monday, December 02, 2019
Presentation transcript:

Week #6 – 30 September / 2/4 October 2002 Prof. Marie desJardins CMSC 203 / 0201 Fall 2002 Week #6 – 30 September / 2/4 October 2002 Prof. Marie desJardins

TOPICS Proof methods Mathematical induction

MON 9/30 MIDTERM #1 Chapters 1-2

WED 10/2 PROOF METHODS (3.1)

CONCEPTS / VOCABULARY Theorems Rules of inference Axioms / postulates / premises Hypothesis / conclusion Lemma, corollary, conjecture Rules of inference Modus ponens (law of detachment) Modus tollens Syllogism (hypothetical, disjunctive) Universal instantiation, universal generalization, existential instantiation (skolemization or Everybody Loves Raymond), existential generalization

CONCEPTS / VOCABULARY II Fallacies Affirming the conclusion [abductive reasoning] Denying the hypothesis Begging the question (circular reasoning) Proof methods Direct proof Indirect proof, proof by contradiction Trivial proof Proof by cases Existence proofs (constructive, nonconstructive)

Examples Exercise 3.1.3: Construct an argument using rules of inference to show that the hypotheses “Randy works hard,” “If Randy works hard, then he is a dull boy,” and “If Randy is a dull boy, then he will not get the job” imply the conclusion “Randy will not get the job.”

Examples II Exercise 3.1.11: Determine whether each of the following arguments is valid. If an argument is correct, what rule of inference is being used? If it is not, what fallacy occurs? (a) If n is a real number s.t. n > 1, then n2 > 1. Suppose that n2 > 1. Then n > 1. (b) The number log23 is irrational if it is not the ratio of two integers. Therefore, since log23 cannot be written in the form a/b where a and b are integers, it is irrational. (c) If n is a real number with n > 3, then n2 > 9. Suppose that n2  9. Then n  3.

Examples III (Exercie 3.1.11 cont.) (d) A positive integer is either a perfect square or it has an even number of positive integer divisors. Suppose that n is a positive integer that has an odd number of positive integer divisors. Then n is a perfect square. (e) If n is a real number with n > 2, then n2 > 4. Suppose that n  2. Then n2  4.

Examples IV Exercise 3.1.17: Prove that if n is an integer and n3 + 5 is odd, then n is even using (a) an indirect proof. (b) a proof by contradiction.

FRI 10/4 MATHEMATICAL INDUCTION (3.2)

CONCEPTS/VOCABULARY Proof by mathematical induction Inductive hypothesis Basis step: P(1) is true (or sometimes P(0) is true). Inductive step: Show that P(n) P(n+1) is true for every integer n > 1 (or n > 0). Strong mathematical induction (“second principle of mathematical induction”) Inductive step: Show that [P(1)  …  P(n)]  P(n+1) is true for every positive integer n.

Examples Example 3.2.2 (p. 189): Use mathematical induction to prove that the sum of the first n odd positive integers is n2. Example 3.2.7 (p. 193): Use mathematical induction to show that the 2nth harmonic number, H2n = 1 + ½ + 1/3 + … + 1/(2n)  1 + n/2, whenever n is a nonnegative integer.

Examples II Exercise 3.2.31: (a) Determine which amounts of postage can be formed using just 5-cent and 6-cent stamps. (b) Prove your answer to (a) using the principle of mathematical induction. (c) Prove your answer to (a) using the second principle of mathematical induction.