Test Bank Questions. (a) Is there an integer n such that n has? (b) Does there exist such that if n is divided by 4 the remainder is 1 and if?

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

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

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

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014

Review Sheet for the Final Exam of MATH Fall 2009

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

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

DISCRETE MATH: FINAL REVIEW

Logic Review Solutions

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

Discrete Mathematics Exam File Spring Exam #1

Math Final Exam December 14, 2009 Page 1 of 5

Mat 243 Exam 1 Review

EDULABZ INTERNATIONAL NUMBER SYSTEM

Basic Logic and Proof Techniques

Overview. 1. Introduction to Propositional Logic. 2. Operations on Propositions. 3. Truth Tables. 4. Translating Sentences into Logical Expressions

1 Predicates and Quantifiers

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

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

Bachelor s Degree Programme Discrete Mathematics (Valid from 1st January, 2013 to 31st December, 2013.)

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

CSE 20 DISCRETE MATH. Fall

Chapter 3. The Logic of Quantified Statements

2 Conditional and Biconditional Propositions

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.

STRATEGIES OF PROBLEM SOLVING

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

COT 2104 Homework Assignment 1 (Answers)

Definition 2. Conjunction of p and q

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

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

Mathematical Reasoning (Part I) 1

UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS MATH 122: Logic and Foundations

MaanavaN.Com MA1256 DISCRETE MATHEMATICS. DEPARTMENT OF MATHEMATICS QUESTION BANK Subject & Code : MA1256 DISCRETE MATHEMATICS

RYERSON UNIVERSITY DEPARTMENT OF MATHEMATICS

SPEAKING MATHEMATICALLY. Prepared by Engr. John Paul Timola

MTH 299 In Class and Recitation Problems SUMMER 2016

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

Chapter 2: The Logic of Quantified Statements

STUDY PROBLEMS FOR EXAM I CMSC 203 DISCRETE STRUCTURES. n (n +1)(2n +1), 6. j 2 = 1(1+1)(2 1+1) 6. k (k +1)(2k +1) 6

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

Combinational Logic. By : Ali Mustafa

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

Logic and Proofs. (A brief summary)

Math 13, Spring 2013, Lecture B: Midterm

Section 1.2: Conditional Statements

DEPARTMENT OF MATHEMATICS. MA1301 Discrete Mathematics

1.1 Language and Logic

Solutions to Assignment 1

University of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura. February 9, :30 pm Duration: 1:50 hs. Closed book, no calculators

Lecture 5 : Proofs DRAFT

The Logic of Compound Statements cont.

1. Given the public RSA encryption key (e, n) = (5, 35), find the corresponding decryption key (d, n).

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

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

Homework assignment 1: Solutions

Intro to Logic and Proofs

Topics in Logic and Proofs

Foundations of Discrete Mathematics

b) Write the contrapositive of this given statement: If I finish ALEKS, then I get points.

1.1 Language and Logic

Proofs. Chapter 2 P P Q Q

B B3B037 Total Pages:3

Midterm Exam Solution

PSU MATH RELAYS LOGIC & SET THEORY 2017

CSE 1400 Applied Discrete Mathematics Proofs

8. Given a rational number r, prove that there exist coprime integers p and q, with q 0, so that r = p q. . For all n N, f n = an b n 2

Section 2.1: Introduction to the Logic of Quantified Statements

DISCRETE MATH: LECTURE 6

Recitation 4: Quantifiers and basic proofs

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

TEST BANK Questions for Chapter 1

Chapter 4, Logic using Propositional Calculus Handout

THE LOGIC OF QUANTIFIED STATEMENTS

Math 102 Section 08, Fall 2010 Solutions Practice for Formal Proofs of Arguments

Two hours. Note that the last two pages contain inference rules for natural deduction UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE

Quantifiers. P. Danziger

Chapter 1 Elementary Logic

Math Survey Curriculum Guide Scranton School District Scranton, PA

not to be republished NCERT REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results


MAT246H1S - Concepts In Abstract Mathematics. Solutions to Term Test 1 - February 1, 2018

Discrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland

Problem Points Score Total 100

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

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

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

Math 3336: Discrete Mathematics Practice Problems for Exam I

Midterm Preparation Problems

Group 5. Jeremy Gutierrez. Jesus Ochoa Perez. Alvaro Gonzalez. MATH 170: Discrete Mathematics. Dr. Lipika Deka. March 14, 2014.

LESSON OBJECTIVES NCTM MATH STANDARDS: GRADES 6 8 NCTM

CONTENTS. iii v viii FOREWORD PREFACE STUDENTS EVALUATION IN MATHEMATICS AT SECONDARY STAGE

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

MATH 2200 Final LC Review

NORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S. B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION

Section 2.3: Statements Containing Multiple Quantifiers

LECTURE 1. Logic and Proofs

THE LOGIC OF QUANTIFIED STATEMENTS

1.5 MATHEMATICAL LANGUAGE

586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

Transcription:

Discrete Mathematics with Applications, 4th Edition by Susanna S. Epp Chapter 1 Test Bank Questions 1. Fill in the blanks to rewrite the following statement with variables: Is there an integer with a remainder of 1 when it is divided by 4 and a remainder of 3 when it is divided by 7? (a) Is there an integer n such that n has? (b) Does there exist such that if n is divided by 4 the remainder is 1 and if? 2. Fill in the blanks to rewrite the following statement with variables: Given any positive real number, there is a positive real number that is smaller. (a) Given any positive real number r, there is s such that s is. (b) For any, such that s < r. 3. Rewrite the following statement less formally, without using variables: There is an integer n such that 1/n is also an integer. 4. Fill in the blanks to rewrite the following statement: For all objects T, if T is a triangle then T has three sides. (a) All triangles. (b) Every triangle. (c) If an object is a triangle, then it. (d) If T, then T. (e) For all triangles T,. 5. Fill in the blanks to rewrite the following statement: Every real number has an additive inverse. (a) All real numbers. (b) For any real number x, there is for x. (c) For all real numbers x, there is real number y such that. 6. Fill in the blanks to rewrite the following statement: There is a positive integer that is less than or equal to every positive integer. (a) There is a positive integer m such that m is. (b) There is a such that every positive integer. (c) There is a positive integer m which satisfies the property that given any positive integer n, m is. 7. (a) Write in words how to read the following out loud {n Z n is a factor of 9}. (b) Use the set-roster notation to indicate the elements in the set.

8. (a) Is {5} {1, 3, 5}? (b) Is {5} {1, 3, 5}? (c) Is {5} {{1}, {3}, {5}}? (d) Is {5} {{1}, {3}, {5}}? 9. Let A = {a, b, c} and B = {u, v}. Write a. A B and b. B A. 10. Let A = {3, 5, 7} and B = {15, 16, 17, 18}, and define a relation R from A to B as follows: For all (x, y) A B, (x, y) R y x is an integer. (a) Is 3 R 15? Is 3 R 16? Is (7, 17) R? Is (3, 18) R? (b) Write R as a set of ordered pairs. (c) Write the domain and co-domain of R. (d) Draw an arrow diagram for R. (e) Is R a function from A to B? Explain. 11. Define a relation R from R to R as follows: For all (x, y) R R,(x, y) R if, and only if, x = y 2 + 1. (a) Is (2, 5) R? Is (5, 2) R? Is ( 3) R 10? Is 10 R ( 3)?] (b) Draw the graph of R in the Cartesian plane. (c) Is R a function from A to B? Explain. 12. Let A = {1, 2, 3, 4} and B = {a, b, c}. Define a function G: A B as follows: (a) Find G(2). (b) Draw an arrow diagram for G. G = {(1, b), (2, c), (3, b), (4, c)}. 13. Define functions F and G from R to R by the following formulas: Does F = G? Explain. F (x) = (x + 1)(x 3) and G(x) = (x 2) 2 7. Chapter 2 1. Which of the following is a negation for Jim is inside and Jan is at the pool. (a) Jim is inside or Jan is not at the pool. (b) Jim is inside or Jan is at the pool. (c) Jim is not inside or Jan is at the pool. (d) Jim is not inside and Jan is not at the pool. (e) Jim is not inside or Jan is not at the pool.

Chapter 2 3 2. Which of the following is a negation for Jim has grown or Joan has shrunk. (a) Jim has grown or Joan has shrunk. (b) Jim has grown or Joan has not shrunk. (c) Jim has not grown or Joan has not shrunk. (d) Jim has grown and Joan has shrunk. (e) Jim has not grown and Joan has not shrunk. (f) Jim has grown and Joan has not shrunk. 3. Write a negation for each of the following statements: (a) The variable S is undeclared and the data are out of order. (b) The variable S is undeclared or the data are out of order. (c) If Al was with Bob on the first, then Al is innocent. (d) 5 x < 2 (where x is a particular real number) 4. Are the following statement forms logically equivalent: p q p and p ( p q)? Include a truth table and a few words explaining how the truth table supports your answer. 5. State precisely (but concisely) what it means for two statement forms to be logically equivalent. 6. Write the following two statements in symbolic form and determine whether they are logically equivalent. Include a truth table and a few words explaining how the truth table supports your answer. If Sam bought it at Crown Books, then Sam didn t pay full price. Sam bought it at Crown Books or Sam paid full price. 7. Write the following two statements in symbolic form and determine whether they are logically equivalent. Include a truth table and a few words explaining how the truth table supports your answer. If Sam is out of Schlitz, then Sam is out of beer. Sam is not out of beer or Sam is not out of Schlitz. 8. Write the converse, inverse, and contrapositive of If Ann is Jan s mother, then Jose is Jan s cousin. 9. Write the converse, inverse, and contrapositive of If Ed is Sue s father, then Liu is Sue s cousin. 10. Write the converse, inverse, and contrapositive of If Al is Tom s cousin, then Jim is Tom s grandfather. 11. Rewrite the following statement in if-then form without using the word necessary : Getting an answer of 10 for problem 16 is a necessary condition for solving problem 16 correctly. 12. State precisely (but concisely) what it means for a form of argument to be valid.

4 Supplementary Exercises and Exam Questions 13. Consider the argument form: p q q p p q Use the truth table below to determine whether this form of argument is valid or invalid. Include a truth table and a few words explaining how the truth table supports your answer. 14. Consider the argument form: p q p q p q q p p q T T F F F F T T F F T T T T F T T F T T T F F T T T T F p q r p q q p Therefore r. Use the truth table below to determine whether this argument form is valid or invalid. Annotate the table (as appropriate) and include a few words explaining how the truth table supports your answer. p q r q p q p q r p q q p r T T T F F T T T T T T F F F T T T F T F T T T T T T T T F F T T F T T F F T T F F T T F T F T F F F T T F F F F T T F T F T T F F F T F T F T F 15. Determine whether the following argument is valid or invalid. Include a truth table and a few words explaining why the truth table shows validity or invalidity. If Hugo is a physics major or if Hugo is a math major, then he needs to take calculus. Hugo needs to take calculus or Hugo is a math major. Therefore, Hugo is a physics major or Hugo is a math major. 16. Determine whether the following argument is valid or invalid. Include a truth table and a few words explaining why the truth table shows validity or invalidity. If 12 divides 709,438 then 3 divides 709,438. If the sum of the digits of 709,438 is divisible by 9 then 3 divides 709,438. The sum of the digits of 709,438 is not divisible by 9. Therefore, 12 does not divide 709,438. 17. Write the form of the following argument. Is the argument valid or invalid? Justify your answer. Therefore, If 54,587 is a prime number, then 17 is not a divisor of 54,587. 17 is a divisor of 54,587. 54,587 is not a prime number.

Chapter 2 5 18. Write the form of the following argument. Is the argument valid or invalid? Justify your answer. If Ann has the flu, then Ann has a fever. Ann has a fever. Therefore, Ann has the flu. 19. On the island of knights and knaves, you meet three natives, A, B, and C, who address you as follows: A: At least one of us is a knave. B: At most two of us are knaves. What are A, B, and C? 20. Consider the following circuit. AND NOT AND OR (a) Find the output of the circuit corresponding to the input P = 1, Q = 0, and R = 1. (b) Write the Boolean expression corresponding to the circuit. 21. Write 110101 2 in decimal form. 22. Write 75 in binary notation. 23. Draw the circuit that corresponds to the following Boolean expression: (P Q) ( P Q).(Note for students who have studied some circuit design: Do not simplify the circuit; just draw the one that exactly corresponds to the expression.) 24. Find a circuit with the following input/output table. P Q R S 1 1 1 0 1 1 0 0 1 0 1 1 1 0 0 0 0 1 1 1 0 1 0 0 0 0 1 0 0 0 0 0 25. Find 10111 2 + 1011 2. 26. Write 100110 2 in decimal form. 27. Write the 8-bit two s complement for 49.

6 Supplementary Exercises and Exam Questions Chapter 3 1. Rewrite the following statement in the form x, if then (where each of the second two blanks are sentences involving the variable x) Every valid argument with true premises has a true conclusion. 2. Consider the statement The square of any odd integer is odd. (a) Rewrite the statement in the form n,. (Do not use the words if or then. ) (b) Rewrite the statement in the form n, if then. (Make sure you use the variable n when you fill in each of the second two blanks.) (c) Write a negation for the statement. 3. Rewrite the following statement formally. Use variables and include both quantifiers and in your answer. Every rational number can be written as a ratio of some two integers. 4. Rewrite the following statement formally. Use variables and include both quantifiers and in your answer. Every even integer greater than 2 can be written as a sum of two prime numbers. 5. Which of the following is a negation for Given any real numbers a and b, if a and b are rational then a/b is rational. (a) There exist real numbers a and b such that a and b are not rational and a/b is not rational. (b) Given any real numbers a and b, if a and b are not rational then a/b is not rational. (c) There exist real numbers a and b such that a and b are not rational and a/b is rational. (d) Given any real numbers a and b, if a and b are rational then a/b is not rational. (e) There exist real numbers a and b such that a and b are rational and a/b is not rational. (f) Given any real numbers a and b, if a and b are not rational then a/b is rational. 6. Which of the following is a negation for For all real numbers r, there exists a number s such that rs > 10. (a) There exists a real number r such that for all real numbers s, rs 10. (b) For all real numbers r, there does not exist a number s such that rs > 10. (c) There exists real numbers r and s such that rs 10. (d) For all real numbers r and s, rs 10. (e) There exists a real number r and there does not exist a real number s such that rs 10. (f) For all real numbers r, there exists a number s such that rs 10. (g) There exists a real number r such that there does not exist a real number s with rs 1.