Ch 3.2: Direct proofs

Similar documents
Lecture 2: Proof Techniques Lecturer: Lale Özkahya

Proof Terminology. Technique #1: Direct Proof. Learning objectives. Proof Techniques (Rosen, Sections ) Direct Proof:

Direct Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24

MATH 271 Summer 2016 Practice problem solutions Week 1

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction

a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0.

Mathematics 220 Midterm Practice problems from old exams Page 1 of 8

Sec$on Summary. Mathematical Proofs Forms of Theorems Trivial & Vacuous Proofs Direct Proofs Indirect Proofs

Properties of the Integers

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.

Some Review Problems for Exam 1: Solutions

MATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.

2-7 Solving Absolute-Value Inequalities

Direct Proofs. the product of two consecutive integers plus the larger of the two integers

Homework 3: Solutions

Contradiction MATH Contradiction. Benjamin V.C. Collins, James A. Swenson MATH 2730

Ch 4.2 Divisibility Properties

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is

Proof Techniques (Review of Math 271)

9/5/17. Fermat s last theorem. CS 220: Discrete Structures and their Applications. Proofs sections in zybooks. Proofs.

Normal Forms Note: all ppts about normal forms are skipped.

Lecture 4: Probability, Proof Techniques, Method of Induction Lecturer: Lale Özkahya

(3,1) Methods of Proof

Algebra 1. Standard 1: Operations With Real Numbers Students simplify and compare expressions. They use rational exponents and simplify square roots.

1. Introduction to commutative rings and fields

Introducing Proof 1. hsn.uk.net. Contents

1. Propositions: Contrapositives and Converses

Direct Proof and Proof by Contrapositive

3 The language of proof

DO NOT USE WITHOUT PERMISSION

CSE 20 DISCRETE MATH. Fall

PROBLEM SET 3: PROOF TECHNIQUES

CHAPTER 0. Introduction

2011 Olympiad Solutions

For all For every For each For any There exists at least one There exists There is Some

COT 2104 Homework Assignment 1 (Answers)

Homework #2 solutions Due: June 15, 2012

MCS-236: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, Methods of Proof

CSE 20 DISCRETE MATH. Winter

Sequences. 1. Number sequences. 2. Arithmetic sequences. Consider the illustrated pattern of circles:

2. Associative Law: A binary operator * on a set S is said to be associated whenever (A*B)*C = A*(B*C) for all A,B,C S.

Homework 5 Solutions

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference

1 Implication and induction

Basic Logic and Proof Techniques

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide

Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

not to be republished NCERT REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results

Discrete Mathematics. Spring 2017

2 Equivalence Relations

10.1 Radical Expressions and Functions Math 51 Professor Busken

Lecture 7 Feb 4, 14. Sections 1.7 and 1.8 Some problems from Sec 1.8

We extend our number system now to include negative numbers. It is useful to use a number line to illustrate this concept.

2.2 Some Consequences of the Completeness Axiom

MATH CSE20 Homework 5 Due Monday November 4

p, p or its negation is true, and the other false

Proof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have

Discrete Mathematics and Probability Theory Fall 2014 Anant Sahai Midterm 1

CHAPTER 8: EXPLORING R

Numbers, proof and all that jazz.

1. Introduction to commutative rings and fields

Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.

Geometry - Chapter 2 Corrective 1

MATH 13 SAMPLE FINAL EXAM SOLUTIONS

Math 3000 Section 003 Intro to Abstract Math Homework 6

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions

Chapter 1 Review of Equations and Inequalities

Chapter VI. Relations. Assumptions are the termites of relationships. Henry Winkler

MAS114: Solutions to Exercises

Math Homework # 4

University of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura. February 9, :30 pm Duration: 1:50 hs. Closed book, no calculators

Chapter III. Basic Proof Techniques. Proving the obvious has never been easy. Marty Rubin

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers

CSCE 222 Discrete Structures for Computing. Proofs. Dr. Hyunyoung Lee. !!!!! Based on slides by Andreas Klappenecker

Introduction to Basic Proof Techniques Mathew A. Johnson

Carmen s Core Concepts (Math 135)

Recitation 7: Existence Proofs and Mathematical Induction

Notes on arithmetic. 1. Representation in base B

SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Note 2

JANE LONG ACADEMY HIGH SCHOOL MATH SUMMER PREVIEW PACKET SCHOOL YEAR. Geometry

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

MATH 225: Foundations of Higher Matheamatics. Dr. Morton. 3.4: Proof by Cases

Exercises for Unit VI (Infinite constructions in set theory)

CHAPTER 3. Number Theory

Mathematical Induction. EECS 203: Discrete Mathematics Lecture 11 Spring

Number Theory and Graph Theory. Prime numbers and congruences.

2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.

Math From Scratch Lesson 28: Rational Exponents

Writing Assignment 2 Student Sample Questions

Math Real Analysis

5. Partitions and Relations Ch.22 of PJE.

PRINCIPLE OF MATHEMATICAL INDUCTION

INTEGERS. In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes.

PYTHAGOREAN TRIPLES KEITH CONRAD

CSE 20 DISCRETE MATH. Winter

More examples of mathematical. Lecture 4 ICOM 4075

1. Mathematical Proofs

Transcription:

Math 299 Lectures 8 and 9: Chapter 3 0. Ch3.1 A trivial proof and a vacuous proof (Reading assignment) 1. Ch3.2 Direct proofs 2. Ch3.3 Proof by contrapositive 3. Ch3.4 Proof by cases 4. Ch3.5 Proof evaluations (Reading assignment) Ch 3.2: Direct proofs A direct proof is a way of showing that a given statement is true or false by using existing lemmas and theorems without making any further assumptions. To prove statements of the form if P, then Q, Assume that the statement P is true and directly derive the conclusion that the statement Q is true. We can use the following properties of integers without justification. - The sum (difference, product) of every two integers is an integer. - The product of two negative integer is positive. - Every integer is of the form 2m or 2m+1, where m Z.. Definition: An integer x is called even (respectively odd) if there is an integer k for which x = 2k (respectively 2k+1). Example. If n is an even integer, then 7n + 4 is also an even integer. Write a hypothesis and a conclusion first and fill out the body of the proof which is a bridge of logical deductions from the hypothesis to the conclusion. Proof.

Exercises 1. Let n Z. Prove that if 1 n 2 > 0, then 3n 2 is an even integer. 2. Let S = {0, 1, 2} and let n S. Prove that if (n + 1) 2 (n + 2) 2 /4 is even, then (n + 2) 2 (n + 3) 2 /4 is even. Proofs Involving Inequalities A1 For all real numbers a, b, c, if a b and b c then a c. A2 For all real numbers a, b, c, if a b then a + c b + c. A3 For all real numbers a, b, c, if a b and 0 c then ac bc. Prove the statements below using A1-A3, together with any basic facts about equality =. (1) For all real numbers a, b, if 0 a and a b then a 2 b 2. (2) For all real numbers a, if a 0 then 0 a. (3) For all real numbers a, b, if b a and a 0, then a 2 b 2. (4) For all real numbers b, 0 b 2. (5) For all real numbers a, b, ab 1 2 (a2 + b 2 ). Hint: Consider (a b) 2. (6) For all real numbers a, b, δ, if δ 0 then ab 1 2 (δ2 a 2 + δ 2 b 2 ). (7) For all real numbers a, b, ab = 1 2 (a2 + b 2 ) if and only if a = b.

Working Backwards Theorem ( Inequality between arithmetic and geometric mean. ) If a, b R, then a + b 2 ab Scratch work: 1. Start with the inequality you are asked to prove. 2. Simplify it as much as possible until you arrive at a statement that is obviously true. Formal Proof: 3. In order to write formal proof, now start from the obviously true statement. 4. Use your previous work to guide you on how to arrive at the desired inequality. Proof: Common mistakes. 1. What is wrong with this proof? (1) Assume a = b. (2) Multiplying both sides by b, ab = b 2. (3) Subtracting a 2 from both sides, ab a 2 = b 2 a 2. (4) Factoring a(b a) = (b + a)(b a). (5) Dividing by b a, a = b + a. (6) Using (1), a = 2a. (7) Dividing by a, 1 = 2.

2. Circular argument Prove if n 3 is even then n is even. Proof : Assume n 3 is even. Then k Z such that n 3 = 8k 3. It follows that n = ( 8k 3) 1/3 = 2k. Therefore n is even. All statements in the proof are true but is the proof correct? Ch 3.3: Proof by contrapositive It is a direct proof but we start with the contrapositive because P = Q is equivalent to (Q) = (P ). Why do we prove the contrapositive of the implication instead of the original implication? Example. Prove: If n 3 is even then n is even.

Definition: Two integers are said to have the same parity if they are both odd or both even. Theorem: If x and y are two integers for which x+y is even, then x and y have the same parity. Proof. Exercises 1. Prove that if x is an odd integer, then 5x 11 is an even integer. 2. Prove that if 7x + 4 is even, then 3x 11 is odd. 3. Let {A, B} be a partition of the set of S = {1, 2,, 7}, where A = {1, 4, 5}. Let n S. Find a set B and prove that if (n 2 + 3n 4)/2 is even, then n A.

Ch 3.2: Proof by cases Let a problem of the form (P 1 or P 2 or or P n ) = Q be given, where P 1, P 2,, P n are cases. Show that it is equivalent to the following : (P 1 = Q) and (P 2 = Q) and and (P n = Q). Thus, we need to prove all the clauses are true. Example: Prove that if n Z, then n 3 n is even.

Example: Prove n 2 n for any integer n. Proof: 1. How many cases do we need to consider? 2. Explicitly state what we want to prove. 3. If we can prove that all cases are true, we can conclude that n 2 n for all integers n. 4. Write the final polished form of your proof.

Exercises 1. For n Z, prove that 9n 2 + 3n 2 is even. 2. For any integer n, n 3 + n is an even integer. 3. For x, y R, xy = x y. 4. Prove that for all x R, 5 x + 2 x 3 5. 5. Prove that if x is a real number such that x2 1 x + 2 > 0, then x > 1 or 2 < x < 1.

More exercise problems for Chapter 3 Section 3.2 3.2.A Let n N. Prove that 1 2 + 2 2 + + n 2 is even if n is an integer of the form n = 4k for some integer k. 3.2.B Show that if n is an even integer then either n = 4k or n = 4k + 2 for some integer k. (Hint: For n to be even means that n = 2m for some integer m. Consider two possibilities for m.) 3.2.C Let n N. Prove that 1 2 + 2 2 + + n 2 is odd if n is an even integer and n 4k for any integer k. Section 3.3 3.3.A Prove the following statements by stating and proving the contrapositive (a) If n 2 is an odd integer, then n is an odd integer. (b) If n 2 is divisible by 4, then n is even. (c) Let a and b be nonnegative real numbers. If a 2 < b 2, then a < b. (Hint: Use the following property of the real numbers: if a < b and c > 0, then ac < bc.) (d) Let a and b be nonnegative real numbers and let n N. If a n < b n, then a < b. Section 3.4 3.4.A Use a proof by cases to prove that every integer is of the form 4k, 4k + 1, 4k + 2, or 4k + 3 for some integer k. (Hint: this is similar to 3.2.B above.) 3.4.B Use a proof by cases to prove that if n = m 2 for some integer m, then n = 4k or n = 4k + 1 for some integer k. Bonus problem A: I lied only 3 times in my life. B: Do not believe him! This is the fourth time he lies. Question: Is the statement the second person made true?