Prof. Girardi Exam 1 Math 300 MARK BOX

Similar documents
1.1 Language and Logic

CSC Discrete Math I, Spring Propositional Logic

Fall 2015 Exam 3 PIN: 17

Spring 2017 Exam 2 NAME: PIN:

Fall 2016 Exam 3 NAME: PIN:

Test #1 September 16, 2014

Introduction to Decision Sciences Lecture 2

Homework assignment 1: Solutions

Spring 2018 Exam 1 MARK BOX HAND IN PART NAME: PIN:

Fall 2017 Exam 1 MARK BOX HAND IN PART NAME: PIN:

Mat 243 Exam 1 Review

Spring 2016 Exam 1 without number 13.

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.

Homework 3: Solutions

Spring 2018 Exam 2 MARK BOX HAND IN PART NAME: PIN: INSTRUCTIONS

1.1 Language and Logic

Compound Propositions

Fall 2016 Exam 1 HAND IN PART NAME: PIN:

2-4: The Use of Quantifiers

Logic and Propositional Calculus

Section 1.2: Conditional Statements

Spring 2018 Exam 1 MARK BOX HAND IN PART PIN: 17

What is Logic? Introduction to Logic. Simple Statements. Which one is statement?

2.2: Logical Equivalence: The Laws of Logic

MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG

Logic and Propositional Calculus

Recitation Week 3. Taylor Spangler. January 23, 2012

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

Section 1.1: Propositions and Connectives

HAND IN PART. Prof. Girardi Math 142 Spring Exam 3 PIN:

Chapter 1 Elementary Logic

HOMEWORK 1: SOLUTIONS - MATH 215 INSTRUCTOR: George Voutsadakis

STRATEGIES OF PROBLEM SOLVING

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

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

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

Logic and Proof. Aiichiro Nakano

The Logic of Compound Statements cont.

We last time we began introducing equivalency laws.

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.

Introduction to Sets and Logic (MATH 1190)

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

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

Review. Propositional Logic. Propositions atomic and compound. Operators: negation, and, or, xor, implies, biconditional.

Proof by Contradiction

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

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

Proving Things. Why prove things? Proof by Substitution, within Logic. Rules of Inference: applying Logic. Using Assumptions.

CS 173: Discrete Mathematical Structures, Spring 2008 Homework 1 Solutions

Some Review Problems for Exam 1: Solutions

Announcement. Homework 1

Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9

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

PSU MATH RELAYS LOGIC & SET THEORY 2017

Math 10850, fall 2017, University of Notre Dame

Mathematical Reasoning (Part I) 1

Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.

Section 2.3: Statements Containing Multiple Quantifiers

HAND IN PART. Prof. Girardi Math 142 Spring Exam 1. NAME: key

Homework 1. 10(b) A useful denial of the statement We will win the first game or the second one is We will lose the first two games.

Math 3336: Discrete Mathematics Practice Problems for Exam I

Midterm Exam Solution

Propositional and Predicate Logic

MATH CSE20 Homework 5 Due Monday November 4

Propositional Equivalence

DeMorgan s Laws and the Biconditional. Philosophy and Logic Sections 2.3, 2.4 ( Some difficult combinations )

Math Final Exam December 14, 2009 Page 1 of 5

Section 1.1: Logical Form and Logical Equivalence

COT 2104 Homework Assignment 1 (Answers)

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

Solutions to Exercises (Sections )

Chapter 1, Section 1.1 Propositional Logic

Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Math 300 Introduction to Mathematical Reasoning Autumn 2017 Proof Templates 1

Discrete Math I Exam II (2/9/12) Page 1

(3,1) Methods of Proof

CISC-102 Winter 2016 Lecture 17

Propositional and Predicate Logic

DISCRETE MATH: FINAL REVIEW

CSC165 Mathematical Expression and Reasoning for Computer Science

Definition 2. Conjunction of p and q

Math.3336: Discrete Mathematics. Propositional Equivalences

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

EECS 1028 M: Discrete Mathematics for Engineers

CSE 20 DISCRETE MATH WINTER

Section 3.1 Statements, Negations, and Quantified Statements

ICS141: Discrete Mathematics for Computer Science I

MATH 2001 MIDTERM EXAM 1 SOLUTION

Full file at

(4) Using results you have studied, show that if x, y are real numbers,

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

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

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

Fall 2018 Exam 1 NAME:

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

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

Carmen s Core Concepts (Math 135)

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

Proof by contrapositive, contradiction

Transcription:

NAME: Prof. Girardi 09.27.11 Exam 1 Math 300 problem MARK BOX points 1 40 2 5 3 10 4 5 5 10 6 10 7 5 8 5 9 8 10 2 total 100 Problem Inspiration (1) Quiz 1 (2) Exam 1 all 10 Number 3 (3) Homework and Study Suggestion, 1.1, 2 abdef (4) Study Suggestion, 1.1, 11e (5) Study Suggestion, 1.1, 9c (6) Study Suggestion, 1.2, 12b and Exam 1 all 10, # 6 (7) Exam 1 all 10 # 7. (8) Study Suggestion, 1.2, 5c (9) Exam 1 all 10 # 11. INSRUCIONS: (1) he mark box indicates the problems along with their points. Check that your copy of the exam has all of the problems. (2) When applicable put your answer on/in the line/box provided. Show your work UNDER the provided line/box. If no such line/box is provided, then box your answer. Explain your answer when needed (if in doubt if needed, ask Prof. Girardi). (3) During this exam, do not leave your seat without permission. If you have a question, raise your hand. When you finish: turn your exam over, put your pencil down, raise your hand. (4) You may not use a calculator, books, personal notes. (5) his exam covers (from A ransition to Advanced Mathematics by Smith, Eggen, and St. Andre: 7 th ed.): Sections 1.1, 1.2. Numbers: real numbers = R natural numbers = N = {1, 2, 3, 4,...} integers = Z = {0, ±1, ±2, { ±3, ±4,...} } rational numbers = Q = p q R: p, q Z and q 0 hroughout this exam: (1) P, Q, and R are proposition forms. (2) P (x), Q(x), and R(x) are open sentences with variable x. 1

1. he Basics. Let P, Q, and R be propositional variables. heorem 1.1.1 in book 1. P is equivalent to. (double negation law) 2. P Q is equivalent to. (commutative law) 3. P Q is equivalent to. (commutative law) 4. P (Q R) is equivalent to. (associative law) 5. P (Q R) is equivalent to. (associative law) 6. [ P (Q R) ] is equivalent to. (distributive law) 7. [ P (Q R) ] is equivalent to. (distributive law) 8. [ (P Q) ] is equivalent to. (DeMorgan s law) 9. [ (P Q) ] is equivalent to. (DeMorgan s law) heorem 1.2.1 in book 10. P Q is equivalent to its contrapositive. 11. P Q is not equivalent to its converse. heorem 1.2.2 in book Hints: Answers to (12) and (14) should NO have. Answesr to (15) and (16) should have a. Also, your answers to (15) and (16) should be different from eachother. 12. [ P Q ] is equivalent to 13. [ P Q ] is equivalent to. (biconditional) 14. [ (P Q) ] is equivalent to. (denial of implies) 15. [ (P Q) ] is equivalent to. (denial of and) 16. [ (P Q) ] is equivalent to. (denial of and) 17. [ P (Q R) ] is equivalent to. 18. [ P (Q R) ] is equivalent to. 19. [ (P Q) R ] is equivalent to. 20. Circle true or false. true false P Q implies P Q true false P Q implies P Q 2

2. Restore parentheses to the abbreviated propositional form. P R = Q R P 3. Which of the following are propositions? Give the truth value of each proposition. Of course, justify your answer. 3a. What time is dinner? 3b. It is not the case that 5 + π is not a rational number. 3c. 2x + 3y is a real number. 3d. Either 3 + π is rational or 3 π is rational. 3e. Either 2 is rational and π is irrational, or 2π is rational. 4. A useful denial (NO beginning with it is not the case that) of the statement Roses are red and violets are blue. is : Your answer in the above box should be a complete sentence. 3

5. Consider the statement 5a. Make a truth table for the propositional form in (5). [P Q] [ P Q]. (5) P Q 5b. Is the propositonal form in (5) a tautology, a contradiction, or neither? Circle one below and then explain your answer in a sentence (or two). tautology contradiction neither 6. Show that (P Q) = R and (P R) = Q are equivalent by making a truth table and explaining (in words) how the truth table tells you what you want it to tell you. P Q R 4

7. ill in the blanks with P and Q as to provide translations of the biconditional P Q. or example, If P, then Q. implies. is necessary for. is sufficient for. if. only if. 8. Is the conditional sentence true or false. Of course, explain your answer. If 7 + 6 = 14 then 5 + 5 = 10. 9. Circle for rue and for alse here is a true conditional sentence for which the converse is true. here is a true conditional sentence for which the converse is false. here is a true conditional sentence for which the contrapositive is true. here is a true conditional sentence for which the contrapositive is false. here is a false conditional sentence for which the converse is true. here is a false conditional sentence for which the converse is false. here is a false conditional sentence for which the contrapositive is true. here is a false conditional sentence for which the contrapositive is false. You might want to (but do not have to) use the below chart to help you figure out the answers to number 9. P Q 10. What has been your favorite problem/example/idea/class in the course thus far? Please write your response on the back of this page. 5