MATH CSE20 Homework 5 Due Monday November 4
|
|
- Aron Maxwell
- 6 years ago
- Views:
Transcription
1 MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of x and y even and the other is odd. TRUE; Proof: Let x, y be natural numbers. Assume, without loss of generality, that x is even and y is odd. The argument is symmetric if x is odd and y is even. WTS: x + y is odd. x = 2k, for some k Z by the definition of even y = 2j + 1, for some j Z by the definition of odd x + y = 2k + 2j + 1 = 2(k + j) + 1 = 2l + 1 for some l = k + j and l Z because integers are closed under addition. Thus, by the definition of odd, x + y is odd and the statement is true. (b) For all natural numbers x and y, if x + y is odd then one of x and y even and the other is odd. TRUE; Proof: Let x, y be natural numbers. By contrapositive, we will prove that if it s not the case that one of x and y is even and the other is odd, then x + y is even. There are two cases to this proof: Case 1: Given: Assume x and y are odd. WTS: x + y is even. x = 2k + 1, for some k Z y = 2j + 1, for some j Z x + y = 2(k + j + 1) = 2l for some l = k + j + 1 and l Z because integers are closed under addition. Thus, by the definition of even, x + y is even. Case 2: Given: Assume x and y are even. WTS: x + y is even. x = 2k, for some k Z
2 2 y = 2j, for some j Z x + y = 2(k + j) = 2l for some l = k + j and l Z because integers are closed under addition. Thus, by the definition of even, x + y is even. Because both cases result in x + y being even, the statement is true. (2) Prove the statement if true, otherwise find a counterexample. (a) The difference of any two odd integers is odd. False: Counterexample: 5-3 = 2. (b) If the sum of two integers is even, one of them must be even. False: Counterexample: = 4. (3) Prove the statement if true, otherwise find a counterexample. (a) The product of two integers is even if and only if at least one of them is even. Negating both A and B in A if and only B gives an equivalent statement. (It s the contrapositive.) In this case, the result of this negation is The product of two integers is odd if and only if neither of them is even. Since neither of them is even is the same thing as both of them are odd, this is the closure property mentioned in Example 1. We can also formally show that this statement is true by proving the if part, then proving the only if. Proof (direct) of if : Given: Assume x and y Z and x = 2k is even, for some k Z. WTS: xy is even. xy = 2ky = 2(ky) = 2z for some integer z = ky and z Z because integers are closed under multiplication. By the definition of even, xy is even. Proof (contrapositive) of only if : If x and y are both odd, their product is odd. Given: Assume for x and y Z, x = 2k + 1 and y = 2j + 1 are odd, for some k, j Z. WTS: xy is odd. xy = (2k + 1)(2j + 1) = 2kj + 2k + 2j + 1 = 2(kj + k + j) + 1 = 2l + 1
3 3 for some integer l = kj + k + j and l Z because integers are closed under multiplication and addition. By the definition of even, xy is odd. Because we have proven both parts of the statement, it is true. (b) The product of two integers is odd if and only if at least one of them is odd. False: Counterexample: 3 x 2 = 6. (4) Prove the statement if true, otherwise find a counterexample. (a) For any integers m and n, m 3 n 3 is even if and only if m n is even. True. Once can write out various proofs, breaking things down into cases depending on whether m and n are even or odd. Alternatively, one can construct a table with four cases: m n m n m 3 n 3 m 3 n 3 even even even even even even even odd odd even odd odd odd even odd odd even odd odd odd even odd odd even By comparing the m n and m 3 n 3 columns, we see that the result is true. An alternative proof can be obtained by doing calculations modulo 2. We ll see more of this in the next week. This is because even corresponds to 0 (mod 2) and odd to 1 (mod 2). We have m 3 = m (mod 2) and n 3 = n (mod 2). Therefore m 3 n 3 = m n (mod 2). (b) For any integers m and n, m 3 n 3 is odd if and only if m n is odd. True. In fact, this is equivalent to (a) because A B is true if and only if A B is true. (5) Prove the statement if true, otherwise find a counterexample. (a) For all integers n > 2, n 3 8 is composite. False. Try n = 3. (What is the answer for n > 3?) (b) For all integers n, ( 1) n = 1 if and only if n is odd. We will prove this in the same way that we proved problem 3a. Proof (direct) of if : Given: Assume n Z and is odd. By the definition of odd, n = 2k + 1, for k Z. ( 1) n = ( 1) 2k+1 = ( 1) 2k = 1 Thus, for all integers n, ( 1) n = 1 if n is odd. Proof (by contrapositive) of only if : Given: Assume n Z is even. WTS: ( 1) n = 1
4 4 By the definition of even, n = 2k for k Z. ( 1) n = ( 1) 2k = (( 1) 2 ) k = 1 k = 1 Thus, for all integers n, ( 1) n = 1 if n is even. Because we have proven both parts of the statement, it is true. (6) Prove the statement if true, otherwise find a counterexample. We provide proof sketches for each of the true statements. (a) n Z, n 2 + n + 5 is odd. True: One of n and n + 1 is even. Therefore, n(n + 1) = n 2 + n is even and since 5 is odd, (n 2 + n) + 5 is odd. (b) n Z, (6(n 2 + n + 1) (5n 2 3) is a perfect square). True: With some algebra, we can conclude that 6(n 2 + n + 1) (5n 2 3) = (n + 3) 2. (c) M > 0, n > M, (n 2 n + 11 is prime). False: For every M > 0, let n = 11M > M. Note that n 2 n + 11 = 11(11M 2 M + 1), which is composite because 11M 2 M + 1 M(11M 1) > 1. (d) There is a unique prime p of the form n 2 + 2n 3. True: Factor n 2 + 2n 3 to get (n + 3)(n 1). For this to be a prime, we must choose n so that one factor is ±1 and the other is ±p, where p is a prime and both factors have the same sign. Thus either n + 3 = p and n 1 = 1 or n + 3 = 1 and n 1 = p. The first pair of equations give n = 2 and p = 5, which is a prime. The second pair of equations give n = 4 and p = 5, which is the same prime. You may ask about the choices n + 3 = 1 and n 1 = p or n + 3 = 1 and n 1 = p. They lead to negative values for p and primes must be positive by definition. (7) Prove the statement if true, otherwise find a counterexample. (a) For all integers n > 0, either n is a perfect square or, n = x + y where x and y are perfect squares or, n = x + y + z where x, y, and z perfect squares. False: 7 is a counterexample since the only possible perfect square values for x, y and z are 0, 1, and 4. (b) The product of four consecutive positive integers is never a perfect square. True: We can write such a product as N(k) = k(k + 1)(k + 2)(k + 3). Let s look at some values: N(1) = 24 = 5 2 1, N(2) = 120 = , N(3) = 360 = It looks like N is always one less than a square. Since squares are not very close together this would mean that N is not a square. We have a plan. Let s write a
5 5 proof. Since k(k + 3) and (k + 1)(k + 2) are close together, we rewrite the product as N = (k(k + 3))((k + 1)(k + 2)) = (k(k + 3))(k(k + 3) + 2) = n(n + 2) > n 2, where n = k(k + 3). Now n(n + 2) = (n + 1) 2 = 1 one less than a square as we conjectured. Thus N < (n + 1) 2. We ve shown that N lies between two consecutive squares; that is, n 2 < N < (n + 1) 2. Hence N cannot be a square. (8) Prove the statement if true, otherwise find a counterexample. (a) For all distinct positive integers m and n, either m 1/2 +n 1/2 and m 1/2 n 1/2 are both rational or both irrational. Hint: Consider (m 1/2 + n 1/2 )(m 1/2 n 1/2 ). True: Let x = m 1/2 + n 1/2 and y = m 1/2 n 1/2. Then xy = m n is a nonzero integer. Hence x and y are either both rational or both irrational. (See discussion in Example 3). (b) For all distinct positive integers, if either m 1/2 + n 1/2 or m 1/2 n 1/2 are rational then both m and n are perfect squares. True: Define x and y as in (a). Since at least one is rational, they are both rational by (a). Thus (x + y)/2 = m 1/2 is rational and so m is a perfect square by Theorem 3. Likewise, (x y)/2 = n 1/2 shows that n is also a perfect square. (c) For all distinct positive integers m and n, both m and n are perfect squares if and only if m + 2m 1/2 n 1/2 + n is a perfect square. True: Note that m + 2m 1/2 n 1/2 + n = (m 1/2 + n 1/2 ) 2. This is a perfect square if m and n are perfect squares. Conversely, suppose this is a perfect square. Then m 1/2 + n 1/2 is rational and so m and n are perfect squares by (b). (d) Which of (a), (b), and (c) are true if m n is changed to m = n? (a) and (b) are false whenever m = n is not a perfect square. If m = n, m + 2m 1/2 n 1/2 +n = 4m and hence is a perfect square if and only if m is a perfect square. Thus (c) is true.
Proof by Contradiction
Proof by Contradiction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Proof by Contradiction Fall 2014 1 / 12 Outline 1 Proving Statements with Contradiction 2 Proving
More informationMATH 271 Summer 2016 Practice problem solutions Week 1
Part I MATH 271 Summer 2016 Practice problem solutions Week 1 For each of the following statements, determine whether the statement is true or false. Prove the true statements. For the false statement,
More information(3,1) Methods of Proof
King Saud University College of Sciences Department of Mathematics 151 Math Exercises (3,1) Methods of Proof 1-Direct Proof 2- Proof by Contraposition 3- Proof by Contradiction 4- Proof by Cases By: Malek
More information9/5/17. Fermat s last theorem. CS 220: Discrete Structures and their Applications. Proofs sections in zybooks. Proofs.
Fermat s last theorem CS 220: Discrete Structures and their Applications Theorem: For every integer n > 2 there is no solution to the equation a n + b n = c n where a,b, and c are positive integers Proofs
More informationCOMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called
More informationIntro to Algebra Today. We will learn names for the properties of real numbers. Homework Next Week. Due Tuesday 45-47/ 15-20, 32-35, 40-41, *28,29,38
Intro to Algebra Today We will learn names for the properties of real numbers. Homework Next Week Due Tuesday 45-47/ 15-20, 32-35, 40-41, *28,29,38 Due Thursday Pages 51-53/ 19-24, 29-36, *48-50, 60-65
More information(4) Using results you have studied, show that if x, y are real numbers,
Solutions to Homework 4, Math 310 (1) Give a direct proof to show that if a, b are integers which are squares of integers, then ab is the square of an integer. Proof. We show that if a, b are integers
More informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More informationBasic Proof Examples
Basic Proof Examples Lisa Oberbroeckling Loyola University Maryland Fall 2015 Note. In this document, we use the symbol as the negation symbol. Thus p means not p. There are four basic proof techniques
More informationFoundations of Discrete Mathematics
Foundations of Discrete Mathematics Chapter 0 By Dr. Dalia M. Gil, Ph.D. Statement Statement is an ordinary English statement of fact. It has a subject, a verb, and a predicate. It can be assigned a true
More informationMathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B.
1. (4.46) Let A and B be sets. Prove that A B = A B if and only if A = B. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B. Proof of (1): Suppose
More informationProof Terminology. Technique #1: Direct Proof. Learning objectives. Proof Techniques (Rosen, Sections ) Direct Proof:
Proof Terminology Proof Techniques (Rosen, Sections 1.7 1.8) TOPICS Direct Proofs Proof by Contrapositive Proof by Contradiction Proof by Cases Theorem: statement that can be shown to be true Proof: a
More informationSolutions to Assignment 1
Solutions to Assignment 1 Question 1. [Exercises 1.1, # 6] Use the division algorithm to prove that every odd integer is either of the form 4k + 1 or of the form 4k + 3 for some integer k. For each positive
More informationPROBLEM SET 3: PROOF TECHNIQUES
PROBLEM SET 3: PROOF TECHNIQUES CS 198-087: INTRODUCTION TO MATHEMATICAL THINKING UC BERKELEY EECS FALL 2018 This homework is due on Monday, September 24th, at 6:30PM, on Gradescope. As usual, this homework
More informationLecture 2: Proof Techniques Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 2: Proof Techniques Lecturer: Lale Özkahya Resources: Kenneth Rosen, Discrete Mathematics and App. cs.colostate.edu/
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationContradiction MATH Contradiction. Benjamin V.C. Collins, James A. Swenson MATH 2730
MATH 2730 Contradiction Benjamin V.C. Collins James A. Swenson Contrapositive The contrapositive of the statement If A, then B is the statement If not B, then not A. A statement and its contrapositive
More informationMath Homework # 4
Math 446 - Homework # 4 1. Are the following statements true or false? (a) 3 5(mod 2) Solution: 3 5 = 2 = 2 ( 1) is divisible by 2. Hence 2 5(mod 2). (b) 11 5(mod 5) Solution: 11 ( 5) = 16 is NOT divisible
More informationMidterm Preparation Problems
Midterm Preparation Problems The following are practice problems for the Math 1200 Midterm Exam. Some of these may appear on the exam version for your section. To use them well, solve the problems, then
More informationSome Review Problems for Exam 1: Solutions
Math 3355 Fall 2018 Some Review Problems for Exam 1: Solutions Here is my quick review of proof techniques. I will focus exclusively on propositions of the form p q, or more properly, x P (x) Q(x) or x
More informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationCSE 20 DISCRETE MATH SPRING
CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationUNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS MATH 122: Logic and Foundations
UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS 2013 MATH 122: Logic and Foundations Instructor and section (check one): K. Mynhardt [A01] CRN 12132 G. MacGillivray [A02] CRN 12133 NAME: V00#: Duration: 3
More informationCarmen s Core Concepts (Math 135)
Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 3 1 Translating From Mathematics to English 2 Contrapositive 3 Example of Contrapositive 4 Types of Implications 5 Contradiction
More information5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.
Statements Compounds and Truth Tables. Statements, Negations, Compounds, Conjunctions, Disjunctions, Truth Tables, Logical Equivalence, De Morgan s Law, Tautology, Contradictions, Proofs with Logical Equivalent
More informationComputer Science Section 1.6
Computer Science 180 Solutions for Recommended Exercises Section 1.6. Let m and n be any two even integers (possibly the same). Then, there exist integers k and l such that m = k and n = l. Consequently,
More informationIn Exercises 1 12, list the all of the elements of the given set. 2. The set of all positive integers whose square roots are less than or equal to 3
APPENDIX A EXERCISES In Exercises 1 12, list the all of the elements of the given set. 1. The set of all prime numbers less than 20 2. The set of all positive integers whose square roots are less than
More informationRecitation 7: Existence Proofs and Mathematical Induction
Math 299 Recitation 7: Existence Proofs and Mathematical Induction Existence proofs: To prove a statement of the form x S, P (x), we give either a constructive or a non-contructive proof. In a constructive
More informationMidterm Exam Solution
Midterm Exam Solution Name PID Honor Code Pledge: I certify that I am aware of the Honor Code in effect in this course and observed the Honor Code in the completion of this exam. Signature Notes: 1. This
More informationCSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 10: Proofs by Contradiction and Contraposition 1. Prove the following statement
More informationMATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions
MATH 11/CSCI 11, Discrete Structures I Winter 007 Toby Kenney Homework Sheet 5 Hints & Model Solutions Sheet 4 5 Define the repeat of a positive integer as the number obtained by writing it twice in a
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs
More information1 Direct Proofs Technique Outlines Example Implication Proofs Technique Outlines Examples...
CSE 311: Foundations of Computing I Proof Techniques What Is This? Each of the following is as close as we can get to giving you a template (and a completely worked out example) for every proof technique
More informationChapter 2. Mathematical Reasoning. 2.1 Mathematical Models
Contents Mathematical Reasoning 3.1 Mathematical Models........................... 3. Mathematical Proof............................ 4..1 Structure of Proofs........................ 4.. Direct Method..........................
More informationMATH 2200 Final LC Review
MATH 2200 Final LC Review Thomas Goller April 25, 2013 1 Final LC Format The final learning celebration will consist of 12-15 claims to be proven or disproven. It will take place on Wednesday, May 1, from
More informationShow Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page.
Formal Methods Midterm 1, Spring, 2007 Name Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page. 1. Use truth
More informationProof Techniques 1. Math Camp n = (1 = n) + (2 + (n 1)) ( n 1. = (n + 1) + (n + 1) (n + 1) + n + 1.
Math Camp 1 Prove the following by direct proof. Proof Techniques 1 Math Camp 01 Take any n N, then n is either even or odd. Suppose n is even n m for some m n(n + 1) m(n + 1) n(n + 1) is even. Suppose
More information3.6. Disproving Quantified Statements Disproving Existential Statements
36 Dproving Quantified Statements 361 Dproving Extential Statements A statement of the form x D, P( if P ( false for all x D false if and only To dprove th kind of statement, we need to show the for all
More informationDiscrete Math I Exam II (2/9/12) Page 1
Discrete Math I Exam II (/9/1) Page 1 Name: Instructions: Provide all steps necessary to solve the problem. Simplify your answer as much as possible. Additionally, clearly indicate the value or expression
More informationMATH 135 Fall 2006 Proofs, Part IV
MATH 135 Fall 006 s, Part IV We ve spent a couple of days looking at one particular technique of proof: induction. Let s look at a few more. Direct Here we start with what we re given and proceed in a
More informationWUCT121. Discrete Mathematics. Logic. Tutorial Exercises
WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the
More informationASSIGNMENT 1 SOLUTIONS
MATH 271 ASSIGNMENT 1 SOLUTIONS 1. (a) Let S be the statement For all integers n, if n is even then 3n 11 is odd. Is S true? Give a proof or counterexample. (b) Write out the contrapositive of statement
More informationWriting proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction
Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction written by Sarah Peluse, revised by Evangelie Zachos and Lisa Sauermann September 27, 2016 1 Introduction
More informationDISCRETE MATH: FINAL REVIEW
DISCRETE MATH: FINAL REVIEW DR. DANIEL FREEMAN 1) a. Does 3 = {3}? b. Is 3 {3}? c. Is 3 {3}? c. Is {3} {3}? c. Is {3} {3}? d. Does {3} = {3, 3, 3, 3}? e. Is {x Z x > 0} {x R x > 0}? 1. Chapter 1 review
More informationSolutions to Homework Set 1
Solutions to Homework Set 1 1. Prove that not-q not-p implies P Q. In class we proved that A B implies not-b not-a Replacing the statement A by the statement not-q and the statement B by the statement
More informationMath 109 HW 9 Solutions
Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs
More informationMATH 310: Homework 7
1 MATH 310: Homework 7 Due Thursday, 12/1 in class Reading: Davenport III.1, III.2, III.3, III.4, III.5 1. Show that x is a root of unity modulo m if and only if (x, m 1. (Hint: Use Euler s theorem and
More informationMidterm 2 Sample Introduction to Higher Math Fall 2018 Instructor: Linh Truong
Midterm Sample Introduction to Higher Math Fall 018 Instructor: Linh Truong Name: Instructions: Print your name in the space above. Show your reasoning. Write complete proofs. You have 75 minutes. No notes,
More informationSOLUTIONS Math 345 Homework 6 10/11/2017. Exercise 23. (a) Solve the following congruences: (i) x (mod 12) Answer. We have
Exercise 23. (a) Solve the following congruences: (i) x 101 7 (mod 12) Answer. We have φ(12) = #{1, 5, 7, 11}. Since gcd(7, 12) = 1, we must have gcd(x, 12) = 1. So 1 12 x φ(12) = x 4. Therefore 7 12 x
More informationSolutions to Practice Final
s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (
More informationMathematics 220 Midterm Practice problems from old exams Page 1 of 8
Mathematics 220 Midterm Practice problems from old exams Page 1 of 8 1. (a) Write the converse, contrapositive and negation of the following statement: For every integer n, if n is divisible by 3 then
More informationInference and Proofs (1.6 & 1.7)
EECS 203 Spring 2016 Lecture 4 Page 1 of 9 Introductory problem: Inference and Proofs (1.6 & 1.7) As is commonly the case in mathematics, it is often best to start with some definitions. An argument for
More informationCHMC: Finite Fields 9/23/17
CHMC: Finite Fields 9/23/17 1 Introduction This worksheet is an introduction to the fascinating subject of finite fields. Finite fields have many important applications in coding theory and cryptography,
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
More informationYale University Department of Mathematics Math 350 Introduction to Abstract Algebra Fall Midterm Exam Review Solutions
Yale University Department of Mathematics Math 350 Introduction to Abstract Algebra Fall 2015 Midterm Exam Review Solutions Practice exam questions: 1. Let V 1 R 2 be the subset of all vectors whose slope
More informationWORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:
WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their
More informationYour quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due by 11:59 p.m., Tuesday.
Friday, February 15 Today we will begin Course Notes 3.2: Methods of Proof. Your quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due
More informationMath.3336: Discrete Mathematics. Proof Methods and Strategy
Math.3336: Discrete Mathematics Proof Methods and Strategy Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationProof by contrapositive, contradiction
Proof by contrapositive, contradiction Margaret M. Fleck 9 September 2009 This lecture covers proof by contradiction and proof by contrapositive (section 1.6 of Rosen). 1 Announcements The first quiz will
More informationProblem Set 5 Solutions
Problem Set 5 Solutions Section 4.. Use mathematical induction to prove each of the following: a) For each natural number n with n, n > + n. Let P n) be the statement n > + n. The base case, P ), is true
More informationExample ( x.(p(x) Q(x))) ( x.p(x) x.q(x)) premise. 2. ( x.(p(x) Q(x))) -elim, 1 3. ( x.p(x) x.q(x)) -elim, x. P(x) x.
Announcements CS311H: Discrete Mathematics More Logic Intro to Proof Techniques Homework due next lecture Instructor: Işıl Dillig Instructor: Işıl Dillig, CS311H: Discrete Mathematics More Logic Intro
More informationMATH 2200 Final Review
MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. (a) Circle the prime
More informationAll numbered readings are from Beck and Geoghegan s The art of proof.
MATH 301. Assigned readings and homework All numbered readings are from Beck and Geoghegan s The art of proof. Reading Jan 30, Feb 1: Chapters 1.1 1.2 Feb 6, 8: Chapters 1.3 2.1 Feb 13, 15: Chapters 2.2
More informationBasic Proof Techniques
Basic Proof Techniques Joshua Wilde, revised by Isabel Tecu, Takeshi Suzuki and María José Boccardi August 13, 2013 1 Basic Notation The following is standard notation for proofs: A B. A implies B. A B.
More informationHomework 3 Solutions, Math 55
Homework 3 Solutions, Math 55 1.8.4. There are three cases: that a is minimal, that b is minimal, and that c is minimal. If a is minimal, then a b and a c, so a min{b, c}, so then Also a b, so min{a, b}
More informationa + 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.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More information. As the binomial coefficients are integers we have that. 2 n(n 1).
Math 580 Homework. 1. Divisibility. Definition 1. Let a, b be integers with a 0. Then b divides b iff there is an integer k such that b = ka. In the case we write a b. In this case we also say a is a factor
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationCool Results on Primes
Cool Results on Primes LA Math Circle (Advanced) January 24, 2016 Recall that last week we learned an algorithm that seemed to magically spit out greatest common divisors, but we weren t quite sure why
More informationHomework 3: Solutions
Homework 3: Solutions ECS 20 (Fall 2014) Patrice Koehl koehl@cs.ucdavis.edu October 16, 2014 Exercise 1 Show that this implication is a tautology, by using a table of truth: [(p q) (p r) (q r)] r. p q
More informationEECS 1028 M: Discrete Mathematics for Engineers
EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 32 Proofs Proofs
More informationCSE 1400 Applied Discrete Mathematics Proofs
CSE 1400 Applied Discrete Mathematics Proofs Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Axioms 1 Logical Axioms 2 Models 2 Number Theory 3 Graph Theory 4 Set Theory 4
More informationProof techniques (section 2.1)
CHAPTER 1 Proof techniques (section 2.1) What we have seen so far: 1.1. Theorems and Informal proofs Argument: P 1 P n Q Syntax: how it's written Semantic: meaning in a given interpretation Valid argument:
More information9.4. Mathematical Induction. Introduction. What you should learn. Why you should learn it
333202_090.qxd 2/5/05 :35 AM Page 73 Section 9. Mathematical Induction 73 9. Mathematical Induction What you should learn Use mathematical induction to prove statements involving a positive integer n.
More informationCOT 2104 Homework Assignment 1 (Answers)
1) Classify true or false COT 2104 Homework Assignment 1 (Answers) a) 4 2 + 2 and 7 < 50. False because one of the two statements is false. b) 4 = 2 + 2 7 < 50. True because both statements are true. c)
More informationProofs. Joe Patten August 10, 2018
Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital
More informationDirect Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24
Direct Proof MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Direct Proof Fall 2014 1 / 24 Outline 1 Overview of Proof 2 Theorems 3 Definitions 4 Direct Proof 5 Using
More informationMATH Fundamental Concepts of Algebra
MATH 4001 Fundamental Concepts of Algebra Instructor: Darci L. Kracht Kent State University April, 015 0 Introduction We will begin our study of mathematics this semester with the familiar notion of even
More informationChapter 2 Section 2.1: Proofs Proof Techniques. CS 130 Discrete Structures
Chapter 2 Section 2.1: Proofs Proof Techniques CS 130 Discrete Structures Some Terminologies Axioms: Statements that are always true. Example: Given two distinct points, there is exactly one line that
More informationSTRATEGIES OF PROBLEM SOLVING
STRATEGIES OF PROBLEM SOLVING Second Edition Maria Nogin Department of Mathematics College of Science and Mathematics California State University, Fresno 2014 2 Chapter 1 Introduction Solving mathematical
More informationAny Wizard of Oz fans? Discrete Math Basics. Outline. Sets. Set Operations. Sets. Dorothy: How does one get to the Emerald City?
Any Wizard of Oz fans? Discrete Math Basics Dorothy: How does one get to the Emerald City? Glynda: It is always best to start at the beginning Outline Sets Relations Proofs Sets A set is a collection of
More informationModular Arithmetic Instructor: Marizza Bailey Name:
Modular Arithmetic Instructor: Marizza Bailey Name: 1. Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find
More informationCHAPTER 1 REAL NUMBERS KEY POINTS
CHAPTER 1 REAL NUMBERS 1. Euclid s division lemma : KEY POINTS For given positive integers a and b there exist unique whole numbers q and r satisfying the relation a = bq + r, 0 r < b. 2. Euclid s division
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.6 Indirect Argument: Contradiction and Contraposition Copyright Cengage Learning. All
More informationCSE 105 Homework 1 Due: Monday October 9, Instructions. should be on each page of the submission.
CSE 5 Homework Due: Monday October 9, 7 Instructions Upload a single file to Gradescope for each group. should be on each page of the submission. All group members names and PIDs Your assignments in this
More information1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points
Introduction to Discrete Mathematics 3450:208 Test 1 1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : The inverse of E : The
More informationCS 340: Discrete Structures for Engineers
CS 340: Discrete Structures for Engineers Instructor: Prof. Harry Porter Office: FAB 115-06 harry@cs.pdx.edu Hours: Mon 3-4, Wed 3-4, or by appointment Website: web.cecs.pdx.edu/~harry/discrete Class Mailing
More informationSection 1.2: Conditional Statements
Section 1.2: Conditional Statements In this section, we study one of the most important tools in logic - conditional statements. Loosely speaking, conditional statements are statements of the form if p
More informationMI 4 Mathematical Induction Name. Mathematical Induction
Mathematical Induction It turns out that the most efficient solution to the Towers of Hanoi problem with n disks takes n 1 moves. If this isn t the formula you determined, make sure to check your data
More informationWriting proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases
Writing proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases September 22, 2018 Recall from last week that the purpose of a proof
More informationNormal Forms Note: all ppts about normal forms are skipped.
Normal Forms Note: all ppts about normal forms are skipped. Well formed formula (wff) also called formula, is a string consists of propositional variables, connectives, and parenthesis used in the proper
More informationFirst In-Class Exam Solutions Math 410, Professor David Levermore Monday, 1 October 2018
First In-Class Exam Solutions Math 40, Professor David Levermore Monday, October 208. [0] Let {b k } k N be a sequence in R and let A be a subset of R. Write the negations of the following assertions.
More informationREVIEW PROBLEMS FOR SECOND 3200 MIDTERM
REVIEW PROBLEMS FOR SECOND 3200 MIDTERM PETE L. CLARK 1)a) State Euclid s Lemma (the one involving prime numbers and divisibility). b) Use Euclid s Lemma to show that 3 1/5 and 5 1/3 are both irrational.
More informationAppendix G: Mathematical Induction
Appendix G: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More information