COT 2104 Homework Assignment 1 (Answers)

Similar documents
Foundations of Discrete Mathematics

Exercise Set 1 Solutions Math 2020 Due: January 30, Find the truth tables of each of the following compound statements.

Homework 3: Solutions

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

CSC Discrete Math I, Spring Propositional Logic

More examples of mathematical. Lecture 4 ICOM 4075

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

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

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

MATH10040: Chapter 0 Mathematics, Logic and Reasoning

MATH10040: Numbers and Functions Homework 1: Solutions

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

Logic, Sets, and Proofs

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

1. Propositions: Contrapositives and Converses

MATH 2200 Final Review

Definitions Chapter 1 Proof Technique (Pg.1): Proof (Pg.2): Statement (Pg.2): Conditional Statement/Implication (Pg3.): Hypothesis(Pg.

HANDOUT AND SET THEORY. Ariyadi Wijaya

Basic Logic and Proof Techniques

1.1 Statements and Compound Statements

Class IX Chapter 1 Number Sustems Maths

Proofs. Joe Patten August 10, 2018

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

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Compound Propositions

MATH 13 SAMPLE FINAL EXAM SOLUTIONS

We want to show P (n) is true for all integers

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

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

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

2 Truth Tables, Equivalences and the Contrapositive

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

Logic Review Solutions

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

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

Mat 243 Exam 1 Review

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

Basic Proof Examples

Meaning of Proof Methods of Proof

Example 1: Identifying the Parts of a Conditional Statement

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

3.6. Disproving Quantified Statements Disproving Existential Statements

MATH CSE20 Homework 5 Due Monday November 4

2.2: Logical Equivalence: The Laws of Logic

Overview. I Review of natural deduction. I Soundness and completeness. I Semantics of propositional formulas. I Soundness proof. I Completeness proof.

Proof by Contradiction

Math Homework # 4

PROOFS IN MATHEMATICS

Review CHAPTER. 2.1 Definitions in Chapter Sample Exam Questions. 2.1 Set; Element; Member; Universal Set Partition. 2.

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

PROBLEM SET 3: PROOF TECHNIQUES

LECTURE 1. Logic and Proofs

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

Proofs. Chapter 2 P P Q Q

CSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!

MATH 135 Fall 2006 Proofs, Part IV

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.

1.1 Language and Logic

Mathematics 228(Q1), Assignment 2 Solutions

CSE 1400 Applied Discrete Mathematics Proofs

Carmen s Core Concepts (Math 135)

Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques

HOMEWORK 1: SOLUTIONS - MATH 215 INSTRUCTOR: George Voutsadakis

The Process of Mathematical Proof

ANALYSIS EXERCISE 1 SOLUTIONS

Mathematical Reasoning (Part I) 1

Complete Induction and the Well- Ordering Principle

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

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

Lecture 2: Proof Techniques Lecturer: Lale Özkahya

(3,1) Methods of Proof

HOMEWORK 4 SOLUTIONS TO SELECTED PROBLEMS

Solutions to Assignment 1

The statement calculus and logic

Propositional Logic. Fall () Propositional Logic Fall / 30

Section 1.2: Propositional Logic

MATH 2200 Final LC Review

Ch 3.2: Direct proofs

ANS: If you are in Kwangju then you are in South Korea but not in Seoul.

C241 Homework Assignment 7

Introducing Proof 1. hsn.uk.net. Contents

Foundation of proofs. Jim Hefferon.

Math Real Analysis

Chapter 2 Section 2.1: Proofs Proof Techniques. CS 130 Discrete Structures

Yes zero is a rational number as it can be represented in the

Topics in Logic and Proofs

Solutions to Homework Set 1

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

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

Propositional Logic. Spring Propositional Logic Spring / 32

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

Discrete Mathematical Structures: Theory and Applications

Proofs. Chapter 2 P P Q Q

Announcements. CS311H: Discrete Mathematics. Propositional Logic II. Inverse of an Implication. Converse of a Implication

Recitation 7: Existence Proofs and Mathematical Induction

Math Final Exam December 14, 2009 Page 1 of 5

In N we can do addition, but in order to do subtraction we need to extend N to the integers

In N we can do addition, but in order to do subtraction we need to extend N to the integers

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.

Inference and Proofs (1.6 & 1.7)

Transcription:

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) 4 = 2 + 2 7 < 50. True because both statements are true d) 4 2 + 2 7 < 50. False because one of the statements is false while the other is true. e) The area of a circle of radius r is 2πr or its circumference is πr 2. False the area of the circle with radius r is not 2πr and its circumference is not πr 2 f) 2 + 3 = 5 5 + 6 = 10. False the hypothesis is true, but the conclusion is false. 2) Write down the negation of each of the following statements in clear and concise English. Do not use the expression It is not the case that in your answers. a) x is a real number and x 2 + 1 = 0. x is not a real number or x 2 + 1 0 b) Every integer is divisible by a prime. There exists an integer which is not divisible by a prime. c) There exist a, b, and c such that (ab)c a(bc). (ab)c = a(bc) for a, b, c d) For every x > 0, x 2 + y 2 > 0 for all y. There exists x > 0 and some y such that x 2 + y 2 0 e) There exists an infinite set whose proper subsets are all finite. For any infinite set, some proper subset is not finite. 3) Write the converse and the contrapositive a) x 2 = 1 x = ± 1. Converse: x = ± 1 x 2 = 1 Contrapositive: x 1 and x -1 x 2 1 b) ab = 0 a = 0 or b = 0. Converse: a = 0 or b = 0 ab = 0 Contrapositive: a 0 and b 0 ab 0 c) If BAC is a right triangle, then a 2 = b 2 + c 2. Converse: if a 2 = b 2 + c 2 then BAC is a right triangle Contrapositive: if a 2 b 2 + c 2 then BAC is not a right triangle,

4) Using for all and there exists as appropriate. a) For real x, 2 x is never negative. 2 x 0 for all real member x b) There are infinitely many primes. For every set of primes p 1, p 2,, p n, there exist a prime not in this set c) All positive real numbers have real square roots. For every real number x > 0, there exists a real number a such that a 2 = x 5) What is the hypothesis and what is the conclusion? a) The square of the length of the hypotenuse of a right-angled triangle is the sum of the squares of the lengths of the other two sides. Hypothesis: T is a right angled triangle with hypotenuse of length c and the other sides of lengths a and b. Conclusion: a 2 + b 2 = c 2 b) All primes are even. Hypothesis: p is a prime. Conclusion: p is even. 6) Determine whether or not the following implication is true. x is an even integer x + 2 is an even integer. Let A be the statement x is an even integer Let B be the statement x + 2 is an even integer x = 2k for some other integer k, then x + 2 = 2k + 2 = 2(k + 1) is also twice an integer, so x + 2 is even. A is true B is true A B is true B A is true 7) Let n be integer greater than 1 and consider the statement "A: 2 n -1 prime is necessary for n to be prime." In this case you have two prepositions: p: n is prime q: 2 n 1 prime a) Write A as an implication. N prime 2 n 1 prime

b) Write A in the form p is sufficient for q. n prime is sufficient for 2 n 1 to be prime. c) Write the converse of A as an implication. 2 n 1 prime n prime. d) Determine whether the converse of A is true or false. Hint: (2 a ) b 1 = (2 a 1)[(2 a ) b 1 + (2 a ) b 2 + 2 a + 1] The converse of A is true. To show this, we establish the contrapositive. Thus, we assume n is not prime. Then there exists a pair of integers a and b such that a > 1, b > 1, and n = ab. Using the hint, we can factor 2 n 1 as 2 n 1 = (2 a ) b 1 = (2 a 1)[(2a) b 1 + (2 a ) b 2 + 2 a + 1] Since a > 1 and b > 1, we have 2 a 1 > 1 and (2 a ) b 1 + (2 a ) b 2 + + 2 a + 1 > 1, so 2 n 1 is the product of two integers of which exceed one. Hence, 2 n 1 is not prime. 8) For a 2 b 2 to be odd, it is necessary and sufficient for one of a or b to be even while the other is odd. I) a, b even. In this case, a = 2n and b = 2m for some integers m and n, so a 2 b 2 = 4n 2 4m 2 = 4(n 2 m 2 ) is even. II) III) IV) a, b odd In this case, a = 2n + 1 and b = 2m + 1 for some integers m and n, so a 2 b 2 = (4n 2 + 4n +1) (4m 2 + 4m + 1) = 4(n 2 + n m 2 m) is even. a even, b odd In this case, a = 2n and b = 2m + 1 for some integers m and n, so a 2 b 2 = 4n 2 (4m 2 + 4m + 1) = 4(n 2 + n m 2 m) 1 is odd. a odd, b even In this case, a = 2n + 1 and b = 2mfor some integers m and n, so a 2 b 2 = (4n 2 + 4n + 1) 4m 2 = 4(n 2 + n m 2 ) 1 is odd. 9) We assert that x + 1/x 2 if and only if x > 0 ( ) We offer a proof by contradiction. Suppose x + 1/x 2 but x > 0 is not true; thus x 0. If x = 0, 1 /x is not defined, so x < 0. In this case, however, x + 1/x < 0, a contradiction.

( ) Conversely, assume that x > 0. Note that (x 1) 2 0 implies x 2 2x + 1 0 Which in turn implies x 2 + 1 2x. Division by the positive number x gives x + 1/x 2 as required. 10) There exists an integer k such that n = 4k + 1 or n = 4k + 3 Case 1: n = 4k + 1 If k is even, there exits an integer m such that k = 2m, so n = 4(2m) + 1 = 8m + 1, and the desired conclusion is true. If k is odd, there exists an integer m such that k = 2m + 1, so n = 4(2m + 1) + 1= 8m + 5, and the desired conclusion is true. Case 2: n = 4k + 3 If k is even, there exits an integer m such that k = 2m, so n = 4(2m) + 3 = 8m + 3, and the desired conclusion is true. If k is odd, there exists an integer m such that k = 2m + 1, so n = 4(2m + 1) + 3= 8m + 7, and the desired conclusion is true. In all cases, the desired conclusion is true. 11) a) (p q) (( p) q) p q p p q ( p) q) (p q) (( p) q) T T F T T T T F F F T T F T T F T T F F T F F F b) (p (q p)) p p q p q p ( q p) ( p ( q p) ) ( p ( q p) ) p T T T T F F T F T T F F F T T F T F F F F F T F 12) p q is false, determine the truth value of (p ( q)) (( p) q) If p q is false, then p is true and q is false. We work with one row p q q (p ( q) p ( p) q (p ( q)) (( p) q) T F T T F T T

13) Determine the truth value for [p (q ( r))] [r (( s) q )] where p, q, r, and s are all false. p q r s r q ( r) p (q ( r)) r ( s) q F F F F T F T T T r (( s) q ) p (q ( r))] [r (( s) q ) F T 14) Show that q (p q) is a tautology p q p q q (p q) T T T T T F F T F T T T F F T T This implication is a tautology (the result is true) 15) Determine whether or not the following argument is valid a. p q r q -------- r p p q r p q r q r p T T T T T T T F T F F T F T T T T F F F T T F F T T F T T T T F F F T T F T F T T T F F F T T T We analyze with a truth table. In row three, the premises are true the conclusion is not. The argument is not valid. b. p q (q ( r)) (p s) -------------------------- s (r q)

This can be solved using a truth table with 16 rows. Alternatively, we can proceed as follow. Assume that the argument is not valid. This means that we can find truth values for p, q, r, and s such that the premises are true but the conclusion is false. Since s (r q) is false, we must have s true and r q false. But this means both r and q are false. Since p q is true and q is false, p must be false. But then q ( r) is true and p s is false, contradicting the truth of (q ( r)) (p s). Hence we have a contradiction, so the argument is valid. NOTE: Some exercises could have different variants of correct answers