CLASS NOTES. A mathematical proof is an argument which convinces other people that something is true.

Similar documents
MATH 225: Foundations of Higher Matheamatics. Dr. Morton. Chapter 2: Logic (This is where we begin setting the stage for proofs!)

MATHEMATICS ON THE CHESSBOARD

The Real Number System and Pythagorean Theorem Unit 9 Part B

SOLUTIONS TO PROBLEM SET 5. Section 9.1

CRACKING THE 15 PUZZLE - PART 4: TYING EVERYTHING TOGETHER BEGINNERS 02/21/2016

1.6 Congruence Modulo m

Dealing with some maths

CSE 20 DISCRETE MATH. Fall

DVA325 Formal Languages, Automata and Models of Computation (FABER)

Math 127: Equivalence Relations

MA10103: Foundation Mathematics I. Lecture Notes Week 3

Lesson 21: If-Then Moves with Integer Number Cards

Roots and Radicals Chapter Questions

Applications of Fermat s Little Theorem and Congruences

Numbers & Operations Chapter Problems

Rosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples

Odd king tours on even chessboards

Math 3560 HW Set 6. Kara. October 17, 2013

To be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we. The first (and most delicate) case concerns 2

Carmen s Core Concepts (Math 135)

Ideas beyond Number. Teacher s guide to Activity worksheets

12th Bay Area Mathematical Olympiad

Rational Points On Elliptic Curves - Solutions. (i) Throughout, we ve been looking at elliptic curves in the general form. y 2 = x 3 + Ax + B

I.M.O. Winter Training Camp 2008: Invariants and Monovariants

Sect Linear Equations in Two Variables

Discrete Mathematics. Spring 2017

ALGEBRA: Chapter I: QUESTION BANK

Order and Compare Rational and Irrational numbers and Locate on the number line

Practice Midterm 2 Solutions

Cardinality revisited

ECS 20 (Spring 2013) Phillip Rogaway Lecture 1

SOLUTIONS FOR PROBLEM SET 4

Modular Arithmetic. claserken. July 2016

17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.

Remember that represents the set of all permutations of {1, 2,... n}

Olympiad Combinatorics. Pranav A. Sriram

Permutation Groups. Every permutation can be written as a product of disjoint cycles. This factorization is unique up to the order of the factors.

Assignment 5 unit3-4-radicals. Due: Friday January 13 BEFORE HOMEROOM

Modular Arithmetic. Kieran Cooney - February 18, 2016

Grade 6 Math Circles Combinatorial Games - Solutions November 3/4, 2015

Solutions for the Practice Questions

Congruence. Solving linear congruences. A linear congruence is an expression in the form. ax b (modm)

CK-12 Algebra II with Trigonometry Concepts 1

Math 255 Spring 2017 Solving x 2 a (mod n)

An interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g.,

Warm-Up Up Exercises. 1. Find the value of x. ANSWER 32

Notes for Recitation 3

Western Australian Junior Mathematics Olympiad 2017

Sample test questions All questions

A REMARK ON A PAPER OF LUCA AND WALSH 1. Zhao-Jun Li Department of Mathematics, Anhui Normal University, Wuhu, China. Min Tang 2.

6.2 Modular Arithmetic

Public Key Encryption

5 Symmetric and alternating groups

Mt. Douglas Secondary

NON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday

CHAPTER 3 DECIMALS. EXERCISE 8 Page Convert 0.65 to a proper fraction may be written as: 100. i.e = =

Edge-disjoint tree representation of three tree degree sequences

Patterns, Functions & Algebra

Ivan Guo. Broken bridges There are thirteen bridges connecting the banks of River Pluvia and its six piers, as shown in the diagram below:

Math 1201 Unit 2 Powers and Exponents Final Review

#A3 INTEGERS 17 (2017) A NEW CONSTRAINT ON PERFECT CUBOIDS. Thomas A. Plick

NOT QUITE NUMBER THEORY

CONNECT: Divisibility

BRITISH COLUMBIA SECONDARY SCHOOL MATHEMATICS CONTEST, 2006 Senior Preliminary Round Problems & Solutions

More Great Ideas in Theoretical Computer Science. Lecture 1: Sorting Pancakes

CS 202, section 2 Final Exam 13 December Pledge: Signature:

Grade 6 Math Circles Combinatorial Games November 3/4, 2015

Grade 7/8 Math Circles February 21 st /22 nd, Sets

12. 6 jokes are minimal.

Solutions to Problem Set 6 - Fall 2008 Due Tuesday, Oct. 21 at 1:00

Launchpad Maths. Arithmetic II

Power = 36² mod 99 Power = 9 5 a 5 = 0 x = 81 Power = 9² mod 99 Power = 81 6 a 6 = 1 x = 81 x 81 mod 99 x = 27 7 a 7 = 1 x = 27 x 27 mod 99 x = 36

MODULAR ARITHMETIC II: CONGRUENCES AND DIVISION

Math Fundamentals for Statistics (Math 52) Unit 2:Number Line and Ordering. By Scott Fallstrom and Brent Pickett The How and Whys Guys.

Non-overlapping permutation patterns

Grade 7/8 Math Circles Game Theory October 27/28, 2015

Algebra/Geometry Session Problems Questions 1-20 multiple choice

The Chinese Remainder Theorem

SET THEORY AND VENN DIAGRAMS

Proofs of a Trigonometric Inequality

Countability. Jason Filippou UMCP. Jason Filippou UMCP) Countability / 12

Assignment 2. Due: Monday Oct. 15, :59pm

Constructions of Coverings of the Integers: Exploring an Erdős Problem

THE NUMBER OF PERMUTATIONS WHICH FORM ARITHMETIC PROGRESSIONS MODULO m

Monotone Sequences & Cauchy Sequences Philippe B. Laval

Lecture 2.3: Symmetric and alternating groups

Norman Do. The Art of Tiling with Rectangles. 1 Checkerboards and Dominoes

Determinants, Part 1

Estimating with Square Roots

Mathematical Olympiad for Girls

1111: Linear Algebra I

MidMichigan Olympiad Problems 5-6

Building Concepts: Visualizing Quadratic Expressions

Squares and Square roots

CH4-1 Inequalities and Their Graphs

Modular arithmetic Math 2320

The tenure game. The tenure game. Winning strategies for the tenure game. Winning condition for the tenure game

The Four Numbers Game

What I can do for this unit:

Rationality and Common Knowledge

Transcription:

Propositional Statements A mathematical proof is an argument which convinces other people that something is true. The implication If p then q written as p q means that if p is true, then q must also be true. Statement p is called the premise of the implication and q is called the conclusion. Examples: If it is raining, then you will bring an umbrella. If you are from Mars, then you are not a human. If the quadrilateral is a square, then it is also a rectangle. Direct Proof In a direct proof, we must assume that p is true, and use definitions, and previous results to deduce that q is also true. Def: Even and Odd An even number is an integer of the form n = 2k, where k is an integer. (ex. 2, 4, 60, -10, 0) An odd number is an integer of the form n = 2k + 1, where k is an integer. Any integer must be either odd or even. Def: Natural Number, Integer, Rational Number, Irrational Number, Real Number Natural Number N: 0, 1, 2, 3,... Integer Z:..., 4, 3, 2, 1, 0, 1, 2, 3, 4,... Rational Number Q: A rational number is a number that can be expressed as a fraction a b b 0. Irrational Number I: Numbers that are not rational are called irrational numbers. Real Numbers R: The real numbers is the set of all the rational numbers and the irrational numbers. Example 1. If x is odd, then x + 2 is odd, where x Z Know: x is odd so x = 2n + 1 for some n Z (n is an integer, whole number) Want: x + 2 = 2m + 1 for some m Z x + 2 = (2n + 1) + 2 = 2n + 2 + 1 = 2(n + 1) + 1 where a and b are integers and Now, n + 1 is also an integer, call it m, so we have written x + 2 as some form of 2 times another integer plus 1. So hence x + 2 is also, by definition of an odd number, odd. Example 2. If x is odd and y is even, then x y is even, where x, y Z. Know: x is odd so x = 2n + 1 for some n Z, and y is even so y = 2m for some m Z Want: x y = 2k for some k Z x y = (2n + 1)(2m) = (2n)(2m) + 1(2m) = 4nm + 2m = 2(2nm) + 2m = 2(2nm + m) 1

2nm + m is also an integer, call it k, so we have written x y as some form of 2 times another integer. So hence x y is also, by definition of an even number, even. Do the following proofs on the chalkboard in small groups. the mechanics of the proofs down. Reference the examples that we have done together to get Exercise 3. If x is even, then x + 40 is even, where x Z. Exercise 4. If x is odd and y is odd, then x y is odd, where x, y Z. The things that we are proving now may seem straightforward, so why bother? Right now we are trying to be more comfortable with just knowing what a proof is. The exact same proof style is used to prove much more complex, nonstraightforward, non-trivial results in math! Example 5. If x is even, then x 4 is even, where x Z. Know: x is even so x = 2n for some n Z Want: x 4 = 2k for some k Z x 4 = (2n) 4 = (2n)(2n)(2n)(2n) = 16n 4 = 2(8n 4 ) we know 8n 4 Z, so set 8n 4 = k, and done! We have proved that x 4 is an even number! Example 6. If q, r Q (are rational), then q + r Q (is rational). Know: q, r are rational so q = a b and r = c for some a, b, c, d Z, where b, d 0 d Want: q + r = f for some f, g Z, where g 0 g q + r = a b + c d = ad bd + bc ad + bc = bd bd Now, ad + bc, bd Z, bd 0. So we have written q + r in the form of an integer divided by a nonzero integer, so by definition q + r is a rational number. Exercise 7. If x is odd, then x 3 + 5x + 1 is odd, where x Z. Exercise 8. If q, r Q, then q r Q. Exercise 9. If q Q, then q Q. 2

Proof by Contraposition Example 1. If 7x + 9 is even, then x is odd, where x Z We know how to do direct proofs. This problem smells like what we have just done with direct proofs. Lets attempt that here. Attempted Know: 7x + 9 is even so 7x + 9 = 2n for some n Z Want: x is odd so x = 2m + 1 for some m Z 7x + 9 = 2n 7x = 2n 9 x = 2n 9 7 Trouble: that horrible mess 2n 9 7 doesn t smell like something of the form 2m + 1... In a propositional statement, we have that the contrapositive of p q is q p, where q means not q, or q isn t true, and p means not p, or p isn t true. These two statements are equivalent. This means that if you can prove one of the statements, the other one must also be true. Proof by Contraposition: Suppose: x is not odd so it is even, meaning x = 2n for some n Z Want: 7x + 9 is not even so it is odd, meaning 7x + 9 = 2m + 1 for some m Z x = 2n 7x = 7(2n) = 14n 7x + 9 = 14n + 9 = 2(7n + 4) + 1 Def: <, >,, Students: What does an inequality mean in terms of a number line? Help me draw it! Example 2. If n 2 > 100, then n > 10, where n N (n is a natural number, which is a positive integer or 0) Proof by Contraposition: Suppose: n /> 10, so n is at most 9, Why? See number line. Want: n 2 /> 100, so n is at most 99, n 2 99 n 9 n 2 81 < 99 n 2 99 Note that n 2 can only be at most 81, but we have rounded up here to being at most 99. This is a legal move. Exercise 3. If 3x + 2 is odd, then x is odd, where x Z. Exercise 4. If x 2 6x + 5 is even, then x must be odd, where x Z. Exercise 5. If r is irrational, then r is also irrational ( r I). (recall that an irrational number is defined to be a 3

number that is NOT rational). Exercise 6. If n 3 > 64, then n > 4, where n N (n is a natural number, which is a positive integer or 0) Proof by Contradiction Given p q, suppose that q is not true and p is true to deduce that this is impossible. In other words, we want to show that it is impossible for our hypothesis to occur but the result to not occur. We always begin a proof by contradiction by supposing that q is not true ( q) and p is true. Example 1. If x 2 is odd, then x is odd, where x Z Proof by Contradiction: Suppose: x is not odd so x is even where x = 2n, and x 2 is odd. Want: a contradiction somewhere. x = 2n x 2 = (2n) 2 = 4n 2 = 2(2n 2 ) X But 2n 2 is an integer, so we have written x 2 as a form of 2 times an integer, and thus by definition x 2 must be even. This contradicts our assumption that x 2 was odd. Exercise 2. If x 3 is even, then x is even, where x Z. Exercise 3. If p is irrational and q is rational, then p + q is irrational. Example 4. If 7x + 9 is even, then x is odd, where x Z We can prove this using either a proof by contradiction or a proof by contradiction. This is not special coincidence! In general, any proof by contraposition can be written as a proof by contradiction. Help me! Help me! Proof by Contradiction: Proof by Contraposition: So in general, why can any proof by contraposition be written as a proof by contradiction? Example 5 (if time): Prove that 2 is irrational. Suppose 2 is rational, i.e. 2 = a b for some integers a and b with b 0. We will reduce the fraction a to its b simplest form. Squaring both sides of the equation 2 = a b and multiplying both sides by b2, we get a 2 = 2b 2. Thus a 2 is even 4

by definition, and a is even (why?). Thus a = 2k for some integer k, so a 2 = 4k 2, and hence b 2 = 2k 2. Thus b 2 is also even by definition, so b is even. Since a and b are both even, a/2 and b/2 are integers. and 2 = a/2 a/2, because b/2 b/2 = a. But we said b before a b is in its simplest form and cannot be reduced. We just reduced a by a factor of 2, so this is a contradiction. X b Therefore 2 cannot be rational. Conclusion All 3 basic proof strategies can be used for the same problem. However, it may be better (or only possible) to use one proof type over the others for certain problems! If and Only If Statements Previously, we have just proved that If x 2 is odd, then x is odd. Is it also true that If x is odd, then x 2 is odd? YES! But convince me! When this happens where p q and q p, we have an if and only if statement. Example 1. x 2 is odd if and only if x is odd, where x Z (x 2 odd x is odd) In words: ( )x 2 is odd if x is odd, and ( )x 2 is odd ONLY if x is odd This is a bidirectional statement (notice the 2 way arrow!) To prove this, we simply need to prove the two implications ( ) and ( ), namely we need to prove that ( ) If x 2 is odd, then x is odd. This part is Done! We already proved this with a proof by contradiction. ( ) If x is odd, then x 2 is odd. Help me! What type of proof should we use? Note: For an if and only if statement, always write out both directions/implications that you want to prove. An if and only if proof is nothing more than just 2 proofs in one. Exercise 2. x is odd x 3 is odd, where x Z. Exercise 3. x is even 7x + 4 is even, where x Z. 5

Proof by Cases A Proof by cases is best explained by an example. It is basically multiple proofs in one that uses direct proofs, proofs by contrapostion, and/or proofs by contradiction. Example 1. For every integer x, the integer x(x + 1) is even. Given x, we have 2 options in life because x must be either odd or even. Case I: x is odd, so x = 2n + 1 for some n Z. We want x(x + 1) = 2m for some m Z x(x + 1) = (2n + 1)(2n + 1 + 1) = (2n + 1)(2n + 2) = 4n 2 + 6n + 2 = 2(2n 2 + 3n + 1) Case II: x is even, so x = 2n for some n Z. We want x(x + 1) = 2m for some m Z x(x + 1) = (2n)(2n + 1) = 4n 2 + 2n = 2(2n 2 + n) Therefore, we have checked that given ANY x integer value, x(x + 1) is even. Note that this worked because we know that any integer x MUST either be odd or even. So we have 2 options in life, and we checked both options to see that the conclusion x(x + 1) = 2m will hold. Example 2. For every integer x, x + 204 has the same parity as x. Def: Parity a and b are said to have the same parity if both are even or both are odd. Given x, we have 2 options in life and x must be either odd or even. Case I: x is odd, so x = 2n + 1 for some n Z. We want x + 204 = 2m + 1 for some m Z x + 204 = 2n + 1 + 204 = 2n + 205 = 2(n + 102) + 1 Case II: Help me! x is even, so x = 2n for some n Z. We want x + 204 = 2m for some m Z Exercise 3. For every integer x, x 2 has the same parity as x x + 204 = 2n + 204 = 2(n + 102) Example 4 (if time): Prove that a 3 a is divisible by 3 for all a Z. 6