MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG

Similar documents
MATH 215 Discrete Mathematics Worksheets. Which of these are propositions? What are the truth values of those that are propositions?

Exercises DEFINITION 7 EXAMPLE 12 EXAMPLE 13. TABLE 9 Table for the Bit Operators OR, AND, and XOR.

Recitation Week 3. Taylor Spangler. January 23, 2012

DISCRETE MATHEMATICS BA202

Math 55 Homework 2 solutions

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.

Math 3336: Discrete Mathematics Practice Problems for Exam I

Mat 243 Exam 1 Review

CHAPTER 1 The Foundations: Logic and Proofs

Chapter 2: The Logic of Quantified Statements. January 22, 2010

Announcements CompSci 102 Discrete Math for Computer Science

Chapter 1, Part I: Propositional Logic. With Question/Answer Animations

Section 1.3. Let I be a set. When I is used in the following context,

Chapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.

Homework assignment 1: Solutions

Introduction to Sets and Logic (MATH 1190)

HW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall

Discrete Mathematics and Its Applications

1.1 Language and Logic

Midterm: Sample 3. ECS20 (Fall 2017) 1) Using truth tables, establish for each of the two propositions below if it is a tautology, a contradiction

Chapter 1: The Logic of Compound Statements. January 7, 2008

Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here.

STRATEGIES OF PROBLEM SOLVING

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

Definition 2. Conjunction of p and q

THE ISLAMIC UNIVERSITY OF GAZA ENGINEERING FACULTY DEPARTMENT OF COMPUTER ENGINEERING DISCRETE MATHMATICS DISCUSSION ECOM Eng. Huda M.

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic

Chapter 1 Elementary Logic

Propositional Logic Not Enough

1.1 Language and Logic

Recall that the expression x > 3 is not a proposition. Why?

Quiz 1. Directions: Show all of your work and justify all of your answers.

HOMEWORK 1: SOLUTIONS - MATH 215 INSTRUCTOR: George Voutsadakis

Homework 2: Solutions

MACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)

Proofs. Joe Patten August 10, 2018

AN INTRODUCTION TO MATHEMATICAL PROOFS NOTES FOR MATH Jimmy T. Arnold

Section Summary. Section 1.5 9/9/2014

Math.3336: Discrete Mathematics. Applications of Propositional Logic

Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page.

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

Test 1 Solutions(COT3100) (1) Prove that the following Absorption Law is correct. I.e, prove this is a tautology:

Prof. Girardi Exam 1 Math 300 MARK BOX

EECS 1028 M: Discrete Mathematics for Engineers

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

Chapter 1, Part I: Propositional Logic. With Question/Answer Animations

Indian Institute of Information Technology Design and Manufacturing, Kancheepuram Chennai , India. Assignment 1 - Propositional Logic

1) Let h = John is healthy, w = John is wealthy and s = John is wise Write the following statement is symbolic form

Connectives Name Symbol OR Disjunction And Conjunction If then Implication/ conditional If and only if Bi-implication / biconditional

III. Elementary Logic

Quantifiers Here is a (true) statement about real numbers: Every real number is either rational or irrational.

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations

Section Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier

CS 220: Discrete Structures and their Applications. Predicate Logic Section in zybooks

Today s Lecture. ICS 6B Boolean Algebra & Logic. Predicates. Chapter 1: Section 1.3. Propositions. For Example. Socrates is Mortal

At least one of us is a knave. What are A and B?

Discrete Mathematics. Sec

Lecture 3. Logic Predicates and Quantified Statements Statements with Multiple Quantifiers. Introduction to Proofs. Reading (Epp s textbook)

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

CSC Discrete Math I, Spring Propositional Logic

LOGIC CONNECTIVES. Students who have an ACT score of at least 30 OR a GPA of at least 3.5 can receive a college scholarship.

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives

Discrete Mathematics Recitation Course 張玟翔

Section 2.1: Introduction to the Logic of Quantified Statements

Some Review Problems for Exam 1: Solutions

Section Summary. Predicates Variables Quantifiers. Negating Quantifiers. Translating English to Logic Logic Programming (optional)

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

Exercises. Exercise Sheet 1: Propositional Logic

Handout on Logic, Axiomatic Methods, and Proofs MATH Spring David C. Royster UNC Charlotte

Section Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier

MATH CSE20 Homework 5 Due Monday November 4

Propositional Logic 1

1.3 Predicates and Quantifiers

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

Sec$on Summary. Propositions Connectives. Truth Tables. Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional

Section A (not in the text) Which of the following are statements? Explain. 3. The President of the United States in 2089 will be a woman.

Chapter 2: The Logic of Quantified Statements

Mathematical Reasoning (Part I) 1

Solutions to Exercises (Sections )

MAT2345 Discrete Math

MATH 271 Summer 2016 Practice problem solutions Week 1

W3203 Discrete Mathema1cs. Logic and Proofs. Spring 2015 Instructor: Ilia Vovsha. hcp://

ECOM Discrete Mathematics

THE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements I CHAPTER 3 SECTION 3.

Tools for reasoning: Logic. Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications:

Intro to Logic and Proofs

1. 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

A Guide to Proof-Writing

MAT 101 Exam 2 Logic (Part I) Fall Circle the correct answer on the following multiple-choice questions.

Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques

MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG

2. Find all combinations of truth values for p, q and r for which the statement p (q (p r)) is true.

2. Prove that there are no positive perfect cubes less than 1000 that are the sum of the cubes of two positive integers.

(3,1) Methods of Proof

Predicate Calculus. Lila Kari. University of Waterloo. Predicate Calculus CS245, Logic and Computation 1 / 59

Logical equivalences 12/8/2015. S T: Two statements S and T involving predicates and quantifiers are logically equivalent

An Introduction to Logic 1.1 ~ 1.4 6/21/04 ~ 6/23/04

Logic Overview, I. and T T T T F F F T F F F F

DISCRETE MATH: FINAL REVIEW

TEST BANK Questions for Chapter 1

Transcription:

MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG Suggested Problems for Logic and Proof The following problems are from Discrete Mathematics and Its Applications by Kenneth H. Rosen. 1. Which of these are propositions? What are the truth values of those that are propositions? (a) Stop or I will shoot. (b) What time is it? (c) There are no black flies in Maine. (d) 4 + x = 5. (e) The moon is made of green cheese. (f) 2 n 100. 2. What is the negation of each of these propositions? (a) Jennifer and Teja are friends. (b) There are 13 items in a baker s dozen. (c) Abby sent more than 100 text messages every day. (d) 121 is a perfect square. 3. Let p and q be the propositions The election is decided and The votes have been counted, respectively. Express each of these compound propositions as an English sentence. (a) p (b) p q (c) p q (d) q p (e) q p (f) p q (g) p q 4. Let p, q, and r be the propositions p : Grizzly bears have been seen in the area. q : Hiking is safe on the trail. r : Berries are ripe along the trail. Write these propositions using p, q, and r and logical connectives (including negations). (a) Berries are ripe along the trail, but grizzly bears have not been seen in the area. (b) Grizzly bears have not been seen in the area and hiking on the trail is safe, but berries are ripe along the trail. (c) If berries are ripe along the trail, hiking is safe if and only if grizzly bears have not been seen in the area. (d) It is not safe to hike on the trail, but grizzly bears have not been seen in the area and the berries along the trail are ripe. 1

(e) For hiking on the trail to be safe, it is necessary but not sufficient that berries not be ripe along the trail and for grizzly bears not to have been seen in the area. (f) Hiking is not safe on the trail whenever grizzly bears have been seen in the area and berries are ripe along the trail. 5. Determine whether each of these conditional statements is true or false. (a) If 1 + 1 = 2, then 2 + 2 = 5. (b) If 1 + 1 = 3, then 2 + 2 = 4. (c) If 1 + 1 = 3, then 2 + 2 = 5. (d) If monkeys can fly, then 1 + 1 = 3. 6. Write each of these statements in the form if p, then q in English. [Hint: Refer to the list of common ways to express conditional statements provided in this section.] (a) It is necessary to wash the boss s car to get promoted. (b) Winds from the south imply a spring thaw. (c) A sufficient condition for the warranty to be good is that you bought the computer less than a year ago. (d) Willy gets caught whenever he cheats. (e) You can access the website only if you pay a subscription fee. (f) Getting elected follows from knowing the right people. (g) Carol gets seasick whenever she is on a boat. 7. Construct a truth table for each of these compound propositions. (a) p p (b) p p (c) p q (d) p q (e) (p q) (p q) (f) (p q) (p q) 8. Construct a truth table for each of these compound propositions. (a) p ( q r) (b) p (q r) (c) p (q r) (d) (p q) ( p r) (e) (p r) ( q r) 9. When three professors are seated in a restaurant, the hostess asks them: Does everyone want coffee? The first professor says: I do not know. The second professor then says: I do not know. Finally, the third professor says: No, not everyonewants coffee. The hostess comes back and gives coffee to the professors who want it. How did she figure out who wanted coffee? 10. (Optional). On the island of knights and knaves created by Smullyan, knights always tell the truth and knaves always lie. You encounter two people, A and B. Determine, if possible, what A and B are if they address you in the ways described. If you cannot determine what these two people are, can you draw any conclusions? 2

(a) A says At least one of us is a knave and B says nothing. (b) A says The two of us are both knights and B says A is a knave. (c) A says I am a knave or B is a knight and B says nothing. (d) Both A and B say I am a knight. (e) A says We are both knaves and B says nothing. 11. (Optional). On an island there are three kinds of people: knights who always tell the truth, knaves who always lie, and spies who can either lie or tell the truth. You encounter three people, A, B, and C. You know one of these people is a knight, one is a knave, and one is a spy. Each of the three people knows the type of person each of other two is. For each of these situations, if possible, determine whether there is a unique solution and determine who the knave, knight, and spy are. When there is no unique solution, list all possible solutions or state that there are no solutions. (a) A says C is the knave, B says, A is the knight, and C says I am the spy. (b) A says I am the knight, B says I am the knave, and C says B is the knight. (c) A says I am the knave, B says I am the knave, and C says I am the knave. (d) A says I am the knight, B says A is telling the truth, and C says I am the spy. (e) A says I am the knight, B says, A is not the knave, and C says B is not the knave. (f) A says I am the knight, B says I am the knight, and C says I am the knight. (g) A says I am not the spy, B says I am not the spy, and C says A is the spy. (h) A says I am not the spy, B says I am not the spy, and C says I am not the spy. 12. Use a truth table to verify the following laws. (a) p (q r) (p q) (p r) (b) (p q) ( p) ( q) (c) (p q) ( p q) (d) (p q) ( q p) (e) (p q) (p q) (f) (p q) (p q) 13. Show that each of these conditional statements is a tautology by using truth tables. (a) [ p (p q)] q (b) [(p q) (q r)] (p r) 14. Show that (p q) r is NOT equivalent to p (q r). 15. Let P (x) be the statement the word x contains the letter a. What are these truth values? (a) P (orange) (b) P (lemon) (c) P (true) (d) P (false) 16. Let N(x) be the statement x has visited North Dakota, where the domain consists of the students in your school. Express each of these quantifications in English. 3

(a) x N(x) (b) x N(x) (c) x N(x) (d) x N(x) (e) x N(x) (f) x N(x) 17. Translate these statements into English, where R(x) is x is a rabbit and H(x) is x hops and the domain consists of all animals. (a) x (R(x) H(x)) (b) x (R(x) H(x)) (c) x (R(x) H(x)) (d) x (R(x) H(x)) 18. Let P (x) be the statement x = x 2. If the domain consists of the integers, what are these truth values? (a) P (0) (b) P (1) (c) P (2) (d) P ( 1) (e) x P (x) (f) x P (x) 19. Let Q(x) be the statement x+1 > 2x. If the domain consists of all integers, what are these truth values? (a) Q(0) (b) Q( 1) (c) Q(1) (d) x Q(x) (e) x Q(x) (f) x Q(x) (g) x Q(x) 20. Suppose that the domain of the propositional function P (x) consists of the integers 1, 2, 3, 4, and 5. Express these statements without using quantifiers, instead using only negations, disjunctions, and conjunctions. (a) x P (x) (b) x P (x) (c) x P (x) (d) x P (x) (e) x ((x 3) P (x)) x P (x) 4

21. Express each of these statements using quantifiers. Then form the negation of the statement so that no negation is to the left of a quantifier. Next, express the negation in simple English. (Do not simply use the phrase It is not the case that. ) (a) All dogs have fleas. (b) There is a horse that can add. (c) Every koala can climb. (d) No monkey can speak French. (e) There exists a pig that can swim and catch fish. 22. Determine whether x (P (x) Q(x)) and ( x P (x)) ( x Q(x)) are logically equivalent. Justify your answer. 23. Determine whether x (P (x) Q(x)) and ( x P (x)) ( x Q(x)) are logically equivalent. Justify your answer. 24. Let P (x, y) be the statement Student x has taken class y, where the domain for x consists of all students in your class and the domain for y consists of all computer science courses at Metro State University. Express each of these quantifications in English. (a) x y P (x, y) (b) x y P (x, y) (c) x y P (x, y) (d) y x P (x, y) (e) y x P (x, y) (f) x y P (x, y) 25. Let Q(x, y) be the statement student x has been a contestant on quiz show y. Express each of these sentences in terms of Q(x, y), quantifiers, and logical connectives, where the domain for x consists of all students at Metro State University and the domain for y consists of all quiz shows on television. (a) There is a student at your school who has been a contestant on a television quiz show. (b) No student at your school has ever been a contestant on a television quiz show. (c) There is a student at your school who has been a contestant on Jeopardy and on Wheel of Fortune. (d) Every television quiz show has had a student from your school as a contestant. (e) At least two students from your school have been contestants on Jeopardy. 26. Translate each of these quantifications into English and determine its truth value. (a) x R (x 2 1) (b) x Z (x 2 = 2) (c) x Z (x 2 > 0) (d) x Z (x 2 = x) (e) x R (x 3 = 1) (f) x Z (x + 1 > x) (g) x Z (x 1 Z) 5

(h) x Z (x 2 Z) 27. Express each of these statements using predicates, quantifiers, logical connectives, and mathematical operators where the domain consists of all integers. (a) The product of two negative integers is positive. (b) The average of two positive integers is positive. (c) The difference of two negative integers is not necessarily negative. (d) The absolute value of the sum of two integers does not exceed the sum of the absolute values of these integers. 28. Let Q(x, y) be the statement x + y = x y. If the domain for both variables consists of all integers, what are the truth values? (a) Q(1, 1) (b) Q(2, 0) (c) y Q(1, y) (d) x Q(x, 2) (e) x y Q(x, y) (f) x y Q(x, y) (g) y x Q(x, y) (h) y x Q(x, y) (i) x y Q(x, y) 29. Determine the truth value of each of these statements if the domain for all variables consists of all integers. (a) n m (n 2 < m) (b) n m (n < m 2 ) (c) n m (n + m = 0) (d) n m (nm = m) (e) n m (n 2 + m 2 = 5) (f) n m (n 2 + m 2 = 6) (g) n m (n + m = 4 n m = 1) (h) n m (n + m = 4 n m = 2) (i) n m p (p = (m + n)/2) 30. Determine the truth value of each of these statements if the domain of each variable consists of all real numbers. (a) x y (x 2 = y) (b) x y (x = y 2 ) (c) x y (xy = 0) (d) x y (x + y y + x) (e) x(x 0 y (xy = 1)) (f) x y (y 0 xy = 1) 6

(g) x y (x + y = 1) (h) x y (x + 2y = 2 2x + 4y = 5) (i) x y (x + y = 2 2x y = 1) (j) x y z (z = (x + y)/2) 31. Determine the truth value of the statement x y (x y 2 ) if the domain for the variables consists of (a) the positive real numbers. (b) the integers. (c) the nonzero real numbers. 32. Use direct proof and show the following. (a) The square of an even number is an even number. (b) The additive inverse, or negative, of an even number is an even number. (c) If m + n and n + p are even integers, where m, n, and p are integers, then m + p is even. (d) The product of two odd numbers is odd. (e) The product of two rational numbers is rational. (f) If x is rational and x 0, then 1/x is rational. (g) Assume n is an integer. If n is an odd number, then so is n 2. (h) Assume n is an integer. If n is an even number, then so is n 2. 33. Prove the following using proof by contrapositive. (a) If x is irrational, then 1/x is irrational. (b) Assume n is an integer. If n 2 is an even number, then so is n. (c) Assume n is an integer. If n 2 is an odd number, then so is n. 34. Prove the following using proof by contradiction. (a) If x is irrational, then 1/x is irrational. (b) Assume n is an integer. If n 2 + 8 is an odd number, then so is n. (c) Assume n is an integer. If 5n + 2 is an even number, then so is n. 35. Prove or disprove. (a) The product of two irrational numbers is irrational. (b) Assume m and n are integers. If mn is even, then m is even or n is even. (c) Assume m and n are real numbers. If mn is irrational, then m is irrational or n is irrational. (d) The sum of an irrational number and a rational number is irrational. 7

Solutions to Selected Problems 32. (c) Proof. Assume m + n = 2k and n + p = 2h, k, h Z. Then m = 2k n, p = 2h n, so m + p = (2k n) + (2h n) = 2k + 2h 2n = 2(k + h n), with k + h n Z. Therefore m + p is an even number. 33. (a) The contrapositive of the proposition states that if 1/x is rational then x is rational. Proof. Note that 1 x is always nonzero. Assume 1 x is rational, then 1 x = m n for m, n Z and n 0. Furthermore, m 0 because 1 0, so x 1 x = m n, x = n, where m, n Z and m 0. m So x is rational. (b) The contrapositive of the proposition states that if n is odd then n 2 is odd. Proof. Assume n is odd: n = 2k + 1 for some k Z. Then n 2 = (2k + 1) 2 = 4k 2 + 4k + 1 = 2(2k 2 + 2k) + 1, where 2k 2 + 2k Z. So n 2 is odd. (c) The contrapositive of the proposition states that if n is even then n 2 is even. Proof. Assume n is even: n = 2k for some k Z. Then n 2 = (2k) 2 = 4k 2 = 2(2k 2 ), where 2k 2 Z. So n 2 is even. 34. (a) Proof. Assume x is irrational and 1/x is rational. Note that 1/x is always nonzero. Since 1/x is rational, 1 x = m n for m, n Z and n 0. Furthermore, m 0 because 1/x 0, so 1 x = m n, x = n, where m, n Z and m 0. m So x is rational, which contradicts our initial assumption that it is irrational. (b) Proof. Assume n 2 + 8 is odd and n is even. Since n is even, n = 2k for some k Z. It follows that n 2 + 8 = (2k) 2 + 8 = 4k 2 + 8 = 2(2k 2 + 4), where 2k 2 + 4 Z. So n 2 + 8 is an even number, which contradicts our initial assumption that it is odd. 8

35. (a) This proposition is false. Consider the counterexample: 2 and 2 2 are both irrational, but their product 2 2 2 = 4 is rational. (b) This proposition is true. Prove by contradiction as follows. Assume that mn is even, and that m and n are both odd. Since m and n are both odd, m = 2k + 1 and n = 2h + 1 for some k, h Z. Then mn = (2k + 1)(2h + 1) = 4kh + 2k + 2h + 1 = 2(2kh + k + h) + 1, where 2kj + k + h Z. So mn is odd,which contradicts the initial assumption that mn is even. Remark. You can also prove this by contrapositive. (c) This proposition is true. Prove by contrapositive as follows. The contrapositive of the proposition states that if m and n are both rational then mn is rational. Assume m and n are rational, then m = h k and n = p q for some h, k, p, q Z and k, q 0. Then mn = h k p q = hp, where hp, kq Z, kq 0. kq Therefore mn is rational. (d) This proposition is true. 9