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.

Similar documents
MTH 299 In Class and Recitation Problems SUMMER 2016

Mathematical Reasoning (Part I) 1

1.1 Language and Logic

Math 3336: Discrete Mathematics Practice Problems for Exam I

2-4: The Use of Quantifiers

1.1 Language and Logic

Intro to Logic and Proofs

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)

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

DISCRETE MATH: FINAL REVIEW

About This Document. MTH299 - Examples Weeks 1-6; updated on January 5, 2018

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

1 Predicates and Quantifiers

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

CSC Discrete Math I, Spring Propositional Logic

Department of Mathematics and Statistics Math B: Discrete Mathematics and Its Applications Test 1: October 19, 2006

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

Logic. Def. A Proposition is a statement that is either true or false.

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

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

~ p is always false. Based on the basic truth table for disjunction, if q is true then p ~

Chapter 3. The Logic of Quantified Statements

Foundation of proofs. Jim Hefferon.

Math.3336: Discrete Mathematics. Nested Quantifiers/Rules of Inference

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Proofs. Joe Patten August 10, 2018

STRATEGIES OF PROBLEM SOLVING

COT 2104 Homework Assignment 1 (Answers)

Discrete Mathematics and Its Applications

EECS 1028 M: Discrete Mathematics for Engineers

Some Review Problems for Exam 1: Solutions

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

Section L.1- Introduction to Logic

Prof. Girardi Exam 1 Math 300 MARK BOX

Logic and Propositional Calculus

Compound Propositions

Section 3.1: Direct Proof and Counterexample 1

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

Mat 243 Exam 1 Review

Math 10850, fall 2017, University of Notre Dame

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

Direct Proof and Proof by Contrapositive

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

Logic and Propositional Calculus

Chapter 1 Elementary Logic

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

Examples. Example (1) Example (2) Let x, y be two variables, and denote statements p : x = 0 and q : y = 1. Solve. x 2 + (y 1) 2 = 0.

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Chapter 2: The Logic of Quantified Statements

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.

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

Recitation 4: Quantifiers and basic proofs

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

CSCI Homework Set 1 Due: September 11, 2018 at the beginning of class

CSC 125 :: Final Exam May 3 & 5, 2010

Proofs. Chapter 2 P P Q Q

What is the decimal (base 10) representation of the binary number ? Show your work and place your final answer in the box.

HOMEWORK 1: SOLUTIONS - MATH 215 INSTRUCTOR: George Voutsadakis

CSE 240 Logic and Discrete Mathematics

Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques

Proofs. Chapter 2 P P Q Q

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

Math Assignment 2 Solutions - Spring Jaimos F Skriletz Provide definitions for the following:

RED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam

Circles & Interval & Set Notation.notebook. November 16, 2009 CIRCLES. OBJECTIVE Graph a Circle given the equation in standard form.

Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies

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

2/13/2012. Logic: Truth Tables. CS160 Rosen Chapter 1. Logic?

Write the negation of each of the following propositions without using any form of the word not :

ICS141: Discrete Mathematics for Computer Science I

Logic and Proof. Aiichiro Nakano

1. Prove that the number cannot be represented as a 2 +3b 2 for any integers a and b. (Hint: Consider the remainder mod 3).

Section 2.3: Statements Containing Multiple Quantifiers

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

Chapter 5: Section 5-1 Mathematical Logic

Note: The area of logic that deals with propositions is called the propositional calculus or propositional logic.

Discrete Mathematical Structures: Theory and Applications

Quantifiers. P. Danziger

Math.3336: Discrete Mathematics. Applications of Propositional Logic

Section 3.1. Statements and Logical Connectives. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

2.1 Start Thinking. 2.1 Warm Up. 2.1 Cumulative Review Warm Up

2.2: Logical Equivalence: The Laws of Logic

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

Logic and Proof. On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes!

MATH 13 SAMPLE FINAL EXAM SOLUTIONS

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

On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA

Midterm 2 Sample Introduction to Higher Math Fall 2018 Instructor: Linh Truong

Introduction to Sets and Logic (MATH 1190)

Math 13, Spring 2013, Lecture B: Midterm

Welcome to MAT 137! Course website:

A statement is a sentence that is definitely either true or false but not both.

Practice Test III, Math 314, Spring 2016

Propositional Logic, Predicates, and Equivalence

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

With Question/Answer Animations. Chapter 2

Introduction to Decision Sciences Lecture 2

ECOM Discrete Mathematics

Department of Computer Science & Software Engineering Comp232 Mathematics for Computer Science

Section 1.2: Conditional Statements

Transcription:

Math 299 Homework Assignment, Chapter 2 Section 2.1 2.A (not in the text) Which of the following are statements? Explain. 1. Let x be a positive integer. Then x is rational. 2. Mathematics is fun. 3. The President of the United States in 2089 will be a woman. 4. The integer 105 is prime. 2.2 Consider the sets A, B, C, and D below. Which of the following statements are true? Give an explanation for each false statement. (a) 25 A (b) 33 D (c) 22 / A D (d) C B (e) B D (f) 53 / C A = {1, 4, 7, 10, 13, 16,... }, C = {x Z x is prime and x 2}, B = {x Z x is odd}, D = {1, 2, 3, 5, 8, 13, 21, 34, 55,... } 2.4 Consider the open sentence P (x) : x(x 1) = 6 over the domain R. (a) For what values of x is P (x) a true statement? (b) For what values of x is P (x) a false statement? Section 2.2 2.14 State the negation of each of the following statements. (a) At least two of my library books are overdue. (b) One of my two friends misplaced his homework assignment. (c) No one expected that to happen. (d) It s not often that my instructor teaches that course. (e) It s surprising that two students received the same exam score.

Section 2.3 2.16 (2.11 in 2nd edition) For the sets A = {1, 2,..., 10} and B = {2, 4, 6, 9, 12, 25} consider the following two statements: P : A B, Q : A B = 6. Determine which of the following statements are true. (a) P Q (b) P ( Q) (c) P Q (d) ( P ) Q (e) ( P ) ( Q) 2.18 (2.13 in 2nd edition) Let S = {1, 2,..., 6} and let P (A) : A {2, 4, 6} =, Q(A) : A be open sentences over the domain P(S). (a) Determine all A P(S) for which P (A) Q(A) is true. (b) Determine all A P(S) for which P (A) ( Q(A)) is true. (c) Determine all A P(S) for which ( P (A)) ( Q(A)) is true. Section 2.4 2.20 (2.15 in 2nd edition) For statement P and Q, construct a truth table for (P = Q) = ( P ). 2.24 Two sets A and B are nonempty disjoint subsets of a set S. If x S, then which of the following are true? (a) It s possible that x A B. (b) If x is an element of A, then x can t be an element of B. (c) If x is not an element of A, then x must be an element of B. (d) It s possible that x / A and x / B. (e) For each nonempty set C, either x A C or x B C. (f) For some nonempty set C, both x A C and x B C. 2.28 Consider the statement (implication): If Bill takes Sam to the concert, then Sam will take Bill to dinner. Which of the following implies that this statement is true?

(a) Sam takes Bill to dinner only if Bill takes Sam to the concert. (b) Either Bill doesn t take Sam to the concert or Sam takes Bill to dinner. (c) Bill takes Sam to the concert. (d) Bill takes Sam to the concert and Sam takes Bill to dinner. (e) Bill takes Sam to the concert and Sam doesn t take Bill to dinner. (f) The concert is canceled. (g) Sam doesn t attend the concert. Section 2.5 2.32 (2.20 in 2nd edition) In each of the following, two open sentences P (x) and Q(x) over a domain S are given. Determine all x S for which P (x) = Q(x) is a true statement. (a) P (x) : x 3 = 4; Q(x) : x 8; S = R. (b) P (x) : x 2 1; Q(x) : x 1; S = R. (c) P (x) : x 2 1; Q(x) : x 1; S = N. (d) P (x) : x [ 1, 2]; Q(x) : x 2; S = [ 1, 1]. 2.34 (a,b,e,f) Each of the following describes an implication. Write the implication in the form if..., then.... (a) Any point on the straight line with equation 2y + x 3 = 0 whose x-coordinate is an integer also has an integer for its y-coordinate. (b) The square of every odd integer is odd. (e) Let C be a circle of circumference 4π. Then the area of C is also 4π. (f) Let n Z. The integer n 3 is even only if n is even. Section 2.6 2.36 (2.25 in 2nd edition) Let P (x) : x is odd. and Q(x) : x 2 is odd. be open sentences over the domain Z. State P (x) Q(z) in two ways: (1) using if and only if and (2) using necessary and sufficient. 2.40 (2.27 in 2nd edition) In each of the following, two open sentences P (x, y) and Q(x, y) are given, where the domain of both x and y is Z. Determine the truth value of P (x) Q(x) for the given values of x and y. (a) P (x, y) : x 2 y 2 = 0 and Q(x, y) : x = y. (x, y) {(1, 1), (3, 4), (5, 5)}. (b) P (x, y) : x = y and Q(x, y) : x = y. (x, y) {(1, 2), (2, 2), (6, 6)}.

(c) P (x, y) : x 2 + y 2 = 1 and Q(x, y) : x + y = 1. (x, y) {(1, 1), ( 3, 4), (0, 1), (1, 0)}. 2.44 (2.29 in 2nd edition) Let S = {1, 2, 3, 4}. Consider the following open sentences over the domain S: n(n 1) P (n) : is even. 2 Q(n) : 2 n 2 ( 2) n 2 is even. R(n) : 5 n+1 + 2 n is prime. Determine four distinct elements a, b, c, d in S such that all of the following are satisfied. (i) P (a) Q(a) is false; (ii) Q(b) P (b) is true; (iii) P (c) R(c) is true; (iv) Q(d) R(d) is false. Section 2.7 2.46 (2.30 in 2nd edition) For statements P and Q, show that P (P Q) is a tautology. Section 2.8 2.52 (2.35 in 2nd edition) Let P and Q be statements. (a) Is (P Q) logically equivalent to ( P ) ( Q)? Explain. (b) What can you say about the biconditional (P Q) (( P ) ( Q))? 2.54 (2.37 in 2nd edition) For statements P and Q, show that ( Q) = (P ( P )) and Q are logically equivalent. Section 2.9 2.58 (2.39 in 2nd edition) Verify the following laws stated in Theorem 2.18: (a) Let P, Q, and R be statements. Then P (Q R) and (P Q) (P R) are logically equivalent. (b) Let P and Q be statements. Then (P Q) and ( P ) ( Q) are logically equivalent. 2.60 (2.41 in 2nd edition) Consider the implication: If x and y are even, then xy is even. (a) State the implication using if and only if. (b) State the converse of the implication.

(c) State the implication as a disjunction (see Theorem 2.17). (d) State the negation of the implication as a conjunction (see Theorem 2.21(a)). 2.62 Let P and Q be statements. Show that [(P Q) (P Q)] (P Q). Section 2.10 2.68 (2.46 in 2nd edition; additional instructions given in boldface) State the negations of the following quantified statements and re-state the original statement using symbols: (a) For every rational number r, the number 1/r is rational. (b) There exists a rational number r such that r 2 = 2. 2.70 (c,e,f) (2.48 in 2nd edition) Determine the true value of each of the following statements. (c) x R, x 2 = x (e) x R, y R, x + y + 3 = 8 (f) x, y R, x + y + 3 = 8 2.74 (2.50 in 2nd edition) Consider the open sentence P (x, y, z) : (x 1) 2 + (y 2) 2 + (z 2) 2 > 0 where the domain of each of the variables x, y, and z is R. (a) Express the quantified statement x R, y R, z R, P (x, y, z) in words. (b) Is the quantified statement in (a) true or false? Explain. (c) Express the negation of the quantified statement in (a) in symbols. (d) Express the negation of the quantified statement in (b) in words. (e) Is the negation of the quantified statement in (a) true or false? Explain. 2.78 Consider the open sentence P (a, b) : a/b < 1 where the domain of a is A = {3, 5, 8} and the domain of b is B = {3, 6, 10}. (a) State the quantified statement a A, b B, P (a, b) in words. (b) Show the quantified statement in (a) is true.