Test #1 September 16, 2014

Size: px
Start display at page:

Download "Test #1 September 16, 2014"

Transcription

1 CPSC 2070 Name: Test #1 September 16, questions, 100 points, 75 minutes. The weight of each question is in parentheses. Please use a pencil. Write neatly and legibly. If you don t have a pencil, ask Dr. Woodard for one. You may keep it for future tests. The last page is blank and may be detached and used as scratch paper. Put your name on it and turn it in with your test. There are multiple versions of this test. Please do your own work. 1. (10) Let q be the proposition I will do every exercise in this book and p be the proposition I will get an A in this course. Express each of these as a combination of p and q. (a) I will get an A in this course only if I do every exercise in this book. (b) I will get an A in this course and I will do every exercise in this book. (c) Either I will not get an A in this course or I will not do every exercise in this book. (d) For me to get an A in this course it is necessary and sufficient that I do every exercise in this book. p q p q Both p q and p q accepted p q 2. (10) Prove or disprove: (512) 1/2 = (the square root of 512) is irrational. Answer: (512) 1/2 = (2 9 ) 1/2 = (2 8 * 2) 1/2 = 2 4 (2) 1/2 = 16 (2) 1/2 16 is rational. (2) 1/2 is irrational. The product of a rational number and an irrational number is irrational. (How would you prove this?) Therefore, (512) 1/2 is irrational. 3. (15) What is the disjunctive normal form for: ( (x y) z ) Show how you arrived at your answer. x y z (x y) (x y) z ((x y) z) DNF T T T F T F T T F F F T <- (x y z) T F T T T F T F F T T F F T T T T F F T F T T F F F T F T F F F F F F T <- ( x y z)

2 4. (10) Use a Direct Proof to prove that: The sum of two rational numbers is a rational number. Let m and n be two rational numbers. Hence, m = a/b and n = c/d where a, b, c, d Z and b, d 0. Let p = m + n = a/b + c/d = (ad + bc)/bd Since a, b, c, d Z, (ad + bc) Z and bd Z Moreover, bd 0 Therefore, p = m + n is a rational number. 5. (15) Use a truth table to prove that ((p q) p) q is a tautology. p q p q p ((p q) p) ((p q) p) q T T T F F T T F T F F T F T T T F T F F F T F T 6. (10) Without using a truth table prove or disprove that: (p q) r (p r) (q r). (p q) r r (p q) Commutative property of (r p) (r p) Distributive property of over (p r) (q r) Commutative property of applied twice 7. (10) Let P(m,n) be the statement m + n = 12, where the universe of discourse for both variables is Z. State whether each of the following propositions is true or false. F P ( 4, 8) T n P(12 n,n) F m n P(m,n) T m n P(m,n) T n P(1,n) T P(15, 3) P(10,120) F_ m n P(m,n) T P (2,10) 8. (10) Determine whether each of these statements is True or False: T {x} {{x}} T φ {x} F φ {x} F {x} {x} T {x} {x} F {x} {x} T x {x} 9. (10) Determine which of the following statements is True or False: F is an irrational number T is a rational number F (5) 1/2 = (the square root of 5) is not a real number T is a rational number F The product of two irrational numbers is irrational. 2 * 2 = 2

3 CPSC 2070 Name: Test #1 September 16, questions, 100 points, 75 minutes. The weight of each question is in parentheses. Please use a pencil. Write neatly and legibly. If you don t have a pencil, ask Dr. Woodard for one. You may keep it for future tests. The last page is blank and may be detached and used as scratch paper. Put your name on it and turn it in with your test. There are multiple versions of this test. Please do your own work. 1. (10) Let q be the proposition I will do every exercise in this book and p be the proposition I will get an A in this course. Express each of these as a combination of p and q. (a) Either I will not get an A in this course or I will not do every exercise in this book. (b) For me to get an A in this course it is necessary and sufficient that I do every exercise in this book. (c) I will get an A in this course only if I do every exercise in this book. (d) I will get an A in this course and I will do every exercise in this book. Both p q and p q accepted p q p q.p q 2. (10) Prove or disprove: (1024) 1/2 = (the square root of 1024) is irrational. Answer: (1024) 1/2 = (2 10 ) 1/2 = 2 5 = 32 which is rational. Therefore, (1024) 1/2 is not irrational. 3. (15) What is the disjunctive normal form for: ( (a b) c ) Show how you arrived at your answer. a b c (a b) c (a b) c DNF T T T F F F T T F F T T <- (a b c) T F T T F T <- (a b c) T F F T T T <- (a b c) F T T T F T <- ( a b c) F T F T T T <- ( a b c) F F T F F F F F F F T T <- ( a b c)

4 4. (10) Prove or disprove that: The quotient of two rational numbers is a rational number. Identify the method of proof that you used. Let m and n be two rational numbers. Hence, m = a/b and n = c/d where a, b, c, d Z and b, d 0. Assume p = m/n = (a/b)/(c/d) = (ad/bc). Since a, b, c, d Z, then both ad and bc Z. However, although by definition b 0, c may be 0. Hence, bc may be 0. Which means that p = (ad/bc) is not guaranteed to be rational. Proof by contradiction. 5. (15) Use a truth table to prove that ((a b) a) b is a tautology. a b (a b) a (a b) a) ((a b) a) b T T T F F T T F T F F T F T T T T T F F F T F T 6. (10) Without using a truth table prove or disprove that: (a b) c (a c) (b c). (a b) c c (a b) Commutative property of (c a) (c b) Distributive property of over (a c) (b c) Commutative property of applied twice 7. (10) Let P(m,n) be the statement m + n = 12, where the universe of discourse for both variables is Z. State whether each of the following propositions is true or false. T n P(1,n) T P(15, 3) P(10,120) F m n P(m,n) T P (2,10) T m n P(m,n) F P ( 4, 8) T n P(12 n,n) F m n P(m,n) 8. (10) Determine whether each of these statements is True or False: F {x} {x} T {x} {x} F {x} {x} T x {x} T φ {x} F φ {x} T {x} {{x}} 9. (10) Determine which of the following statements is True or False: F (7) 1/3 = (the cube root of 7) is not a real number F is an irrational number T is a rational number F is an irrational number F The product of two irrational numbers is irrational. 2 * 2 = 2

5 CPSC 2070 Name: Test #1 September 16, questions, 100 points, 75 minutes. The weight of each question is in parentheses. Please use a pencil. Write neatly and legibly. If you don t have a pencil, ask Dr. Woodard for one. You may keep it for future tests. The last page is blank and may be detached and used as a scratch sheet. Put your name on it and turn it in with your test. There are multiple versions of this test. Please do your own work. 1. (10) Let p be the proposition I will do every exercise in this book and q be the proposition I will get an A in this course. Express each of these as a combination of p and q. (a) I will get an A in this course only if I do every exercise in this book. (b) I will get an A in this course and I will do every exercise in this book. (c) Either I will not get an A in this course or I will not do every exercise in this book. (d) For me to get an A in this course it is necessary and sufficient that I do every exercise in this book. p q p q Both p q and p q accepted p q 2. (10) Prove or disprove: (2048) 1/2 = (the square root of 2048) is irrational. Answer: (2048) 1/2 = (2 11 ) 1/2 = (2 10 * 2) 1/2 = 2 5 (2) 1/2 = 32 (2) 1/2 32 is rational. (2) 1/2 is irrational. The product of a rational number and an irrational number is irrational. (How would you prove this?) Therefore, (512) 1/2 is irrational. 3. (15) What is the disjunctive normal form for: ( (p q) r ) Show how you arrived at your answer. p q r (p q) (p q) r ((p q) r) DNF T T T F T F T T F F F T <- (p q r) T F T T T F T F F T T F F T T T T F F T F T T F F F T F T F F F F F F T <- ( p q r)

6 4. (10) Use a Direct Proof to prove that: The difference between two rational numbers is a rational number. Let m and n be two rational numbers. Hence, m = a/b and n = c/d where a, b, c, d Z and b, d 0. Let p = m n = a/b c/d = (ad bc)/bd Since a, b, c, d Z, (ad bc) Z and bd Z Moreover, bd 0 Therefore, p = m n is a rational number. 5. (15) Use a truth table to prove that ((p q) p) q is a tautology. p q p q p ((p q) p) ((p q) p) q T T T F F T T F T F F T F T T T F T F F F T F T 6. (10) Without using a truth table prove or disprove that: (p q) r (p r) (q r). p q) r r (p q) Commutative property of (r p) (r p) Distributive property of over (p r) (q r) Commutative property of applied twice 7. (10) Let P(m,n) be the statement m + n = 12, where the universe of discourse for both variables is Z. State whether each of the following propositions is true or false. F_ P ( 4, 8) T P (2,10) F m n P(m,n) F_ m n P(m,n) T P(15, 3) P(10,120) T_ m n P(m,n) T n P(12 n,n) T n P(1,n) 8. (10) Determine whether each of these statements is True or False: T x {x} T {x} {x} F {x} {x} T {x} {{x}} T φ {x} F φ {x} F {x} {x} 9. (10) Determine which of the following statements is True or False: T is a rational number F is an irrational number T is a rational number F (5) 1/2 = (the square root of 5) is not a real number F The product of two irrational numbers is irrational. 2 * 2 = 2

Midterm Exam Solution

Midterm Exam Solution Midterm Exam Solution Name PID Honor Code Pledge: I certify that I am aware of the Honor Code in effect in this course and observed the Honor Code in the completion of this exam. Signature Notes: 1. This

More information

Prof. Girardi Exam 1 Math 300 MARK BOX

Prof. Girardi Exam 1 Math 300 MARK BOX 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

More information

Math 10850, fall 2017, University of Notre Dame

Math 10850, fall 2017, University of Notre Dame Math 10850, fall 2017, University of Notre Dame Notes on first exam September 22, 2017 The key facts The first midterm will be on Thursday, September 28, 6.15pm-7.45pm in Hayes-Healy 127. What you need

More information

Homework 3: Solutions

Homework 3: Solutions Homework 3: Solutions ECS 20 (Fall 2014) Patrice Koehl koehl@cs.ucdavis.edu October 16, 2014 Exercise 1 Show that this implication is a tautology, by using a table of truth: [(p q) (p r) (q r)] r. p q

More information

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

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false. Section 1.2 Propositional Equivalences A tautology is a proposition which is always true. Classic Example: P P A contradiction is a proposition which is always false. Classic Example: P P A contingency

More information

Mat 243 Exam 1 Review

Mat 243 Exam 1 Review OBJECTIVES (Review problems: on next page) 1.1 Distinguish between propositions and non-propositions. Know the truth tables (i.e., the definitions) of the logical operators,,,, and Write truth tables for

More information

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

MCS-236: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, Methods of Proof MCS-36: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, 010 Methods of Proof Consider a set of mathematical objects having a certain number of operations and relations

More information

CSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University. Name: ID#: Section #: Score: / 4

CSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University. Name: ID#: Section #: Score: / 4 CSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 10: Proofs by Contradiction and Contraposition 1. Prove the following statement

More information

Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques

Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques Colin Stirling Informatics Some slides based on ones by Myrto Arapinis Colin Stirling (Informatics) Discrete Mathematics

More information

Introduction to Sets and Logic (MATH 1190)

Introduction to Sets and Logic (MATH 1190) Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition

More information

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

Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page. Formal Methods Midterm 1, Spring, 2007 Name Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page. 1. Use truth

More information

Class 8: Numbers Exercise 3B

Class 8: Numbers Exercise 3B Class : Numbers Exercise B 1. Compare the following pairs of rational numbers: 1 1 i First take the LCM of. LCM = 96 Therefore: 1 = 96 Hence we see that < 6 96 96 1 1 1 1 = 6 96 1 or we can say that

More information

Class VIII Chapter 1 Rational Numbers Maths. Exercise 1.1

Class VIII Chapter 1 Rational Numbers Maths. Exercise 1.1 Question 1: Using appropriate properties find: Exercise 1.1 (By commutativity) Page 1 of 11 Question 2: Write the additive inverse of each of the following: (iii) (iv) (v) Additive inverse = Additive inverse

More information

Do not start until you are given the green signal

Do not start until you are given the green signal SOLUTIONS CSE 311 Winter 2011: Midterm Exam (closed book, closed notes except for 1-page summary) Total: 100 points, 5 questions. Time: 50 minutes Instructions: 1. Write your name and student ID on the

More information

Proofs. Joe Patten August 10, 2018

Proofs. Joe Patten August 10, 2018 Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital

More information

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

Discrete Math I Exam II (2/9/12) Page 1 Discrete Math I Exam II (/9/1) Page 1 Name: Instructions: Provide all steps necessary to solve the problem. Simplify your answer as much as possible. Additionally, clearly indicate the value or expression

More information

Compound Propositions

Compound Propositions Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth

More information

Tautologies, Contradictions, and Contingencies

Tautologies, Contradictions, and Contingencies Section 1.3 Tautologies, Contradictions, and Contingencies A tautology is a proposition which is always true. Example: p p A contradiction is a proposition which is always false. Example: p p A contingency

More information

Chapter 1: Review of Real Numbers

Chapter 1: Review of Real Numbers Chapter : Review of Real Numbers PREP TEST. a..; C....... 7 + + + 9 8 7 8. 9.. + 7. 9. 8.7 7. 9 b. 7.7; D. c..7; A. d. 89.89; B. GO FIGURE If the areas of the known rectangles are,, and, the corresponding

More information

Proofs. 29th January 2014

Proofs. 29th January 2014 Proofs 29th January 2014 Housekeeping Your solutions to Problem Sheet 2 are due today at the start of class. Please make sure you have your name on them and that you put them in the correct pile! Don t

More information

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

Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies Valentin Stockholm University September 2016 Propositions Proposition:

More information

2 Truth Tables, Equivalences and the Contrapositive

2 Truth Tables, Equivalences and the Contrapositive 2 Truth Tables, Equivalences and the Contrapositive 12 2 Truth Tables, Equivalences and the Contrapositive 2.1 Truth Tables In a mathematical system, true and false statements are the statements of the

More information

CSE 20: Discrete Mathematics

CSE 20: Discrete Mathematics Spring 2018 Summary Last time: Today: Logical connectives: not, and, or, implies Using Turth Tables to define logical connectives Logical equivalences, tautologies Some applications Proofs in propositional

More information

MATH10040: Numbers and Functions Homework 1: Solutions

MATH10040: Numbers and Functions Homework 1: Solutions MATH10040: Numbers and Functions Homework 1: Solutions 1. Prove that a Z and if 3 divides into a then 3 divides a. Solution: The statement to be proved is equivalent to the statement: For any a N, if 3

More information

CSC Discrete Math I, Spring Propositional Logic

CSC Discrete Math I, Spring Propositional Logic CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)

More information

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

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)

More information

ALLEN PARK HIGH SCHOOL S u m m er A s s e s s m e n t

ALLEN PARK HIGH SCHOOL S u m m er A s s e s s m e n t ALLEN PARK HIGH SCHOOL S u m m er A s s e s s m e n t F o r S t u d e n t s E n t e r i n g A l g e b r a Allen Park High School Summer Assignment Algebra Show all work for all problems on a separate sheet

More information

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

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Discrete Mathematics Solution Guide Marcel B. Finan c All Rights Reserved 2015 Edition Contents

More information

2.2: Logical Equivalence: The Laws of Logic

2.2: Logical Equivalence: The Laws of Logic Example (2.7) For primitive statement p and q, construct a truth table for each of the following compound statements. a) p q b) p q Here we see that the corresponding truth tables for two statement p q

More information

Inference and Proofs (1.6 & 1.7)

Inference and Proofs (1.6 & 1.7) EECS 203 Spring 2016 Lecture 4 Page 1 of 9 Introductory problem: Inference and Proofs (1.6 & 1.7) As is commonly the case in mathematics, it is often best to start with some definitions. An argument for

More information

Chapter 4: Classical Propositional Semantics

Chapter 4: Classical Propositional Semantics Chapter 4: Classical Propositional Semantics Language : L {,,, }. Classical Semantics assumptions: TWO VALUES: there are only two logical values: truth (T) and false (F), and EXTENSIONALITY: the logical

More information

Proofs. Chapter 2 P P Q Q

Proofs. Chapter 2 P P Q Q Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,

More information

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

CSCI Homework Set 1 Due: September 11, 2018 at the beginning of class CSCI 3310 - Homework Set 1 Due: September 11, 2018 at the beginning of class ANSWERS Please write your name and student ID number clearly at the top of your homework. If you have multiple pages, please

More information

Proofs. Chapter 2 P P Q Q

Proofs. Chapter 2 P P Q Q Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,

More information

Equations, Inequalities, and Problem Solving

Equations, Inequalities, and Problem Solving CHAPTER Equations, Inequalities, and Problem Solving. Linear Equations in One Variable. An Introduction to Problem Solving. Formulas and Problem Solving.4 Linear Inequalities and Problem Solving Integrated

More information

Section 1.1: Propositions and Connectives

Section 1.1: Propositions and Connectives Section 1.1: Propositions and Connectives Definition : Proposition: A statement that has exactly one truth value, i.e., either true (T) or false (F). Axiom (or Postulate): A statement about the primitive

More information

Properties of Rational and Irrational Numbers

Properties of Rational and Irrational Numbers Properties of Rational and Irrational Numbers September 8, 2016 Definition: The natural numbers are the set of numbers N = {1, 2, 3,...}, and the integers are the set of numbers Z = {..., 2, 1, 0, 1, 2,...}.

More information

Math 300 Introduction to Mathematical Reasoning Autumn 2017 Axioms for the Real Numbers

Math 300 Introduction to Mathematical Reasoning Autumn 2017 Axioms for the Real Numbers Math 300 Introduction to Mathematical Reasoning Autumn 2017 Axioms for the Real Numbers PRIMITIVE TERMS To avoid circularity, we cannot give every term a rigorous mathematical definition; we have to accept

More information

Section 1.2: Propositional Logic

Section 1.2: Propositional Logic Section 1.2: Propositional Logic January 17, 2017 Abstract Now we re going to use the tools of formal logic to reach logical conclusions ( prove theorems ) based on wffs formed by some given statements.

More information

Solutions to Homework I (1.1)

Solutions to Homework I (1.1) Solutions to Homework I (1.1) Problem 1 Determine whether each of these compound propositions is satisable. a) (p q) ( p q) ( p q) b) (p q) (p q) ( p q) ( p q) c) (p q) ( p q) (a) p q p q p q p q p q (p

More information

We last time we began introducing equivalency laws.

We last time we began introducing equivalency laws. Monday, January 14 MAD2104 Discrete Math 1 Course website: www/mathfsuedu/~wooland/mad2104 Today we will continue in Course Notes Chapter 22 We last time we began introducing equivalency laws Today we

More information

Solutions to Chapter Review Questions, Chapter 0

Solutions to Chapter Review Questions, Chapter 0 Instructor s Solutions Manual, Chapter 0 Review Question 1 Solutions to Chapter Review Questions, Chapter 0 1. Explain how the points on the real line correspond to the set of real numbers. solution Start

More information

Proofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction

Proofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction Introduction I Proofs Computer Science & Engineering 235 Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu A proof is a proof. What kind of a proof? It s a proof. A proof is a proof. And when

More information

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical

More information

Sec$on Summary. Tautologies, Contradictions, and Contingencies. Logical Equivalence. Normal Forms (optional, covered in exercises in text)

Sec$on Summary. Tautologies, Contradictions, and Contingencies. Logical Equivalence. Normal Forms (optional, covered in exercises in text) Section 1.3 1 Sec$on Summary Tautologies, Contradictions, and Contingencies. Logical Equivalence Important Logical Equivalences Showing Logical Equivalence Normal Forms (optional, covered in exercises

More information

CSE 20 DISCRETE MATH WINTER

CSE 20 DISCRETE MATH WINTER CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Reminders Exam 1 in one week One note sheet ok Review sessions Saturday / Sunday Assigned seats: seat map on Piazza shortly

More information

Recitation 7: Existence Proofs and Mathematical Induction

Recitation 7: Existence Proofs and Mathematical Induction Math 299 Recitation 7: Existence Proofs and Mathematical Induction Existence proofs: To prove a statement of the form x S, P (x), we give either a constructive or a non-contructive proof. In a constructive

More information

M17 MAT25-21 HOMEWORK 6

M17 MAT25-21 HOMEWORK 6 M17 MAT25-21 HOMEWORK 6 DUE 10:00AM WEDNESDAY SEPTEMBER 13TH 1. To Hand In Double Series. The exercises in this section will guide you to complete the proof of the following theorem: Theorem 1: Absolute

More information

Disjunction/Conjunction Normal Form

Disjunction/Conjunction Normal Form Normal Forms Well formed formula (wff) also called formula, is a string consists of propositional variables, connectives, and parenthesis used in the proper manner. E.g. ((p q) ( p r)) pq r is a disjunction

More information

means is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S.

means is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S. 1 Notation For those unfamiliar, we have := means equal by definition, N := {0, 1,... } or {1, 2,... } depending on context. (i.e. N is the set or collection of counting numbers.) In addition, means for

More information

Discrete Mathematics and Its Applications

Discrete Mathematics and Its Applications Discrete Mathematics and Its Applications Lecture 1: Proposition logic MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 12, 2017 Outline 1 Propositions 2 Connectives

More information

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

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus

More information

Question 1: Is zero a rational number? Can you write it in the form p, where p and q are integers and q 0?

Question 1: Is zero a rational number? Can you write it in the form p, where p and q are integers and q 0? Class IX - NCERT Maths Exercise (.) Question : Is zero a rational number? Can you write it in the form p, where p and q are integers and q 0? q Solution : Consider the definition of a rational number.

More information

Practice Midterm Exam Solutions

Practice Midterm Exam Solutions CSE 311: Foundations of Computing I Practice Midterm Exam Solutions Name: Sample Solutions ID: TA: Section: INSTRUCTIONS: You have 50 minutes to complete the exam. The exam is closed book. You may not

More information

Logic and Truth Tables

Logic and Truth Tables Logic and Truth Tables What is a Truth Table? A truth table is a tool that helps you analyze statements or arguments in order to verify whether or not they are logical, or true. There are five basic operations

More information

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

Proving Things. Why prove things? Proof by Substitution, within Logic. Rules of Inference: applying Logic. Using Assumptions. 1 Proving Things Why prove things? Proof by Substitution, within Logic Rules of Inference: applying Logic Using Assumptions Proof Strategies 2 Why Proofs? Knowledge is power. Where do we get it? direct

More information

Outline Goals and Assumptions Real Numbers Rational and Irrational. L11: Numbers. Alice E. Fischer

Outline Goals and Assumptions Real Numbers Rational and Irrational. L11: Numbers. Alice E. Fischer L11: Numbers Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing March 5-8, 2018 1 Goals and Assumptions 2 Real Numbers 3 Rational and Irrational Assumptions We rely the following assumptions:

More information

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

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 MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems taken from all the extra practice sets presented in random order. The challenge problems have not been

More information

Propositional Equivalence

Propositional Equivalence Propositional Equivalence Tautologies and contradictions A compound proposition that is always true, regardless of the truth values of the individual propositions involved, is called a tautology. Example:

More information

1 Implication and induction

1 Implication and induction 1 Implication and induction This chapter is about various kinds of argument which are used in mathematical proofs. When you have completed it, you should know what is meant by implication and equivalence,

More information

Proofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007

Proofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007 Proofs Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Fall 2007 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.5, 1.6, and 1.7 of Rosen cse235@cse.unl.edu

More information

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

Logic Overview, I. and T T T T F F F T F F F F Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical

More information

Propositional Calculus

Propositional Calculus CHAPTER - 1 Propositional Calculus Introduction Logic means reasoning. One of the important aims of logic is to provide rules through which one can determine the validity of any particular argument. Logic

More information

Topic 1: Propositional logic

Topic 1: Propositional logic Topic 1: Propositional logic Guy McCusker 1 1 University of Bath Logic! This lecture is about the simplest kind of mathematical logic: propositional calculus. We discuss propositions, which are statements

More information

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

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives Logic Logic is study of abstract reasoning, specifically, concerned with whether reasoning is correct. Logic focuses on relationship among statements as opposed to the content of any particular statement.

More information

Multiple Choice Answers. MA 110 Precalculus Spring 2016 Exam 1 9 February Question

Multiple Choice Answers. MA 110 Precalculus Spring 2016 Exam 1 9 February Question MA 110 Precalculus Spring 2016 Exam 1 9 February 2016 Name: Section: Last 4 digits of student ID #: This exam has eleven multiple choice questions (five points each) and five free response questions (nine

More information

Some Review Problems for Exam 1: Solutions

Some Review Problems for Exam 1: Solutions Math 3355 Fall 2018 Some Review Problems for Exam 1: Solutions Here is my quick review of proof techniques. I will focus exclusively on propositions of the form p q, or more properly, x P (x) Q(x) or x

More information

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

Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9 Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9 Typeset September 23, 2005 1 Statements or propositions Defn: A statement is an assertion

More information

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

1. Given the public RSA encryption key (e, n) = (5, 35), find the corresponding decryption key (d, n). MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems taken from all the extra practice sets presented in random order. The challenge problems have not been

More information

Basic properties of the Integers

Basic properties of the Integers Basic properties of the Integers Branko Ćurgus May 2, 2017 1 Axioms for the Integers In the axioms below we use the standard logical operators: conjunction, disjunction, exclusive disjunction, implication,

More information

Basic Algebra. Mathletics Instant Workbooks. 7(4x - y) = Copyright

Basic Algebra. Mathletics Instant Workbooks. 7(4x - y) = Copyright Basic Algebra Student Book - Series I- 7(4 - y) = Mathletics Instant Workbooks Copyright Student Book - Series I Contents Topics Topic - Addition and subtraction of like terms Topic 2 - Multiplication

More information

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

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called

More information

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.

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. Examples Let x, y be two variables, and denote statements p : x = 0 and q : y = 1. Example (1) Solve x 2 + (y 1) 2 = 0. The solution is x = 0 AND y = 1. [p q.] Example (2) Solve x(y 1) = 0. Examples Let

More information

Normal Forms Note: all ppts about normal forms are skipped.

Normal Forms Note: all ppts about normal forms are skipped. Normal Forms Note: all ppts about normal forms are skipped. Well formed formula (wff) also called formula, is a string consists of propositional variables, connectives, and parenthesis used in the proper

More information

2k n. k=0. 3x 2 7 (mod 11) 5 4x 1 (mod 9) 2 r r +1 = r (2 r )

2k n. k=0. 3x 2 7 (mod 11) 5 4x 1 (mod 9) 2 r r +1 = r (2 r ) MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems take from the extra practice sets presented in random order. The challenge problems have not been included.

More information

PROBLEM SET 3: PROOF TECHNIQUES

PROBLEM SET 3: PROOF TECHNIQUES PROBLEM SET 3: PROOF TECHNIQUES CS 198-087: INTRODUCTION TO MATHEMATICAL THINKING UC BERKELEY EECS FALL 2018 This homework is due on Monday, September 24th, at 6:30PM, on Gradescope. As usual, this homework

More information

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

Tools for reasoning: Logic. Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications: Tools for reasoning: Logic Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications: 1 Why study propositional logic? A formal mathematical language for precise

More information

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

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook) Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or

More information

All numbered readings are from Beck and Geoghegan s The art of proof.

All numbered readings are from Beck and Geoghegan s The art of proof. MATH 301. Assigned readings and homework All numbered readings are from Beck and Geoghegan s The art of proof. Reading Jan 30, Feb 1: Chapters 1.1 1.2 Feb 6, 8: Chapters 1.3 2.1 Feb 13, 15: Chapters 2.2

More information

CS206 Lecture 03. Propositional Logic Proofs. Plan for Lecture 03. Axioms. Normal Forms

CS206 Lecture 03. Propositional Logic Proofs. Plan for Lecture 03. Axioms. Normal Forms CS206 Lecture 03 Propositional Logic Proofs G. Sivakumar Computer Science Department IIT Bombay siva@iitb.ac.in http://www.cse.iitb.ac.in/ siva Page 1 of 12 Fri, Jan 03, 2003 Plan for Lecture 03 Axioms

More information

University of Illinois at Chicago Department of Computer Science. Final Examination. CS 151 Mathematical Foundations of Computer Science Fall 2012

University of Illinois at Chicago Department of Computer Science. Final Examination. CS 151 Mathematical Foundations of Computer Science Fall 2012 University of Illinois at Chicago Department of Computer Science Final Examination CS 151 Mathematical Foundations of Computer Science Fall 01 Thursday, October 18, 01 Name: Email: Print your name and

More information

Chapter 1 Elementary Logic

Chapter 1 Elementary Logic 2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help

More information

Fall 2014 CMSC250/250H Midterm II

Fall 2014 CMSC250/250H Midterm II Fall 2014 CMSC250/250H Midterm II Circle Your Section! 0101 (10am: 3120, Ladan) 0102 (11am: 3120, Ladan) 0103 (Noon: 3120, Peter) 0201 (2pm: 3120, Yi) 0202 (10am: 1121, Vikas) 0203 (11am: 1121, Vikas)

More information

1.1 Variables and Expressions How can a verbal expression be translated to an algebraic expression?

1.1 Variables and Expressions How can a verbal expression be translated to an algebraic expression? 1.1 Variables and Expressions How can a verbal expression be translated to an algebraic expression? Recall: Variable: Algebraic Expression: Examples of Algebraic Expressions: Different ways to show multiplication:

More information

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

not to be republished NCERT REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results Euclid s Division Lemma : Given two positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 r < b. Euclid s Division

More information

PHIL12A Section answers, 28 Feb 2011

PHIL12A Section answers, 28 Feb 2011 PHIL12A Section answers, 28 Feb 2011 Julian Jonker 1 How much do you know? Give formal proofs for the following arguments. 1. (Ex 6.18) 1 A B 2 A B 1 A B 2 A 3 A B Elim: 2 4 B 5 B 6 Intro: 4,5 7 B Intro:

More information

MA 113 Calculus I Fall 2015 Exam 3 Tuesday, 17 November Multiple Choice Answers. Question

MA 113 Calculus I Fall 2015 Exam 3 Tuesday, 17 November Multiple Choice Answers. Question MA 11 Calculus I Fall 2015 Exam Tuesday, 17 November 2015 Name: Section: Last 4 digits of student ID #: This exam has ten multiple choice questions (five points each) and five free response questions (ten

More information

Math Final Exam December 14, 2009 Page 1 of 5

Math Final Exam December 14, 2009 Page 1 of 5 Math 201-803-Final Exam December 14, 2009 Page 1 of 5 (3) 1. Evaluate the expressions: (a) 10 C 4 (b) 10 P 4 (c) 15!4! 3!11! (4) 2. (a) In how many ways can a president, a vice president and a treasurer

More information

Propositional Logic. Logical Expressions. Logic Minimization. CNF and DNF. Algebraic Laws for Logical Expressions CSC 173

Propositional Logic. Logical Expressions. Logic Minimization. CNF and DNF. Algebraic Laws for Logical Expressions CSC 173 Propositional Logic CSC 17 Propositional logic mathematical model (or algebra) for reasoning about the truth of logical expressions (propositions) Logical expressions propositional variables or logical

More information

MA 113 Calculus I Fall 2015 Exam 1 Tuesday, 22 September Multiple Choice Answers. Question

MA 113 Calculus I Fall 2015 Exam 1 Tuesday, 22 September Multiple Choice Answers. Question MA 113 Calculus I Fall 2015 Exam 1 Tuesday, 22 September 2015 Name: Section: Last 4 digits of student ID #: This exam has ten multiple choice questions (five points each) and five free response questions

More information

Math /Foundations of Algebra/Fall 2017 Foundations of the Foundations: Proofs

Math /Foundations of Algebra/Fall 2017 Foundations of the Foundations: Proofs Math 4030-001/Foundations of Algebra/Fall 017 Foundations of the Foundations: Proofs A proof is a demonstration of the truth of a mathematical statement. We already know what a mathematical statement is.

More information

Readings: Conjecture. Theorem. Rosen Section 1.5

Readings: Conjecture. Theorem. Rosen Section 1.5 Readings: Conjecture Theorem Lemma Lemma Step 1 Step 2 Step 3 : Step n-1 Step n a rule of inference an axiom a rule of inference Rosen Section 1.5 Provide justification of the steps used to show that a

More information

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is

More information

REVIEW PROBLEMS FOR SECOND 3200 MIDTERM

REVIEW PROBLEMS FOR SECOND 3200 MIDTERM REVIEW PROBLEMS FOR SECOND 3200 MIDTERM PETE L. CLARK 1)a) State Euclid s Lemma (the one involving prime numbers and divisibility). b) Use Euclid s Lemma to show that 3 1/5 and 5 1/3 are both irrational.

More information

Discrete Mathematics Recitation Course 張玟翔

Discrete Mathematics Recitation Course 張玟翔 Discrete Mathematics Recitation Course 1 2013.03.07 張玟翔 Acknowledge 鄭安哲 TA 2012 About Myself English Name : Zak Chinese Name : 張玟翔 Mail:o0000032@yahoo.com.tw Lab: ED612 1-1 Propositional Logic 1-1 Ex.2

More information

CS173 Lecture B, September 10, 2015

CS173 Lecture B, September 10, 2015 CS173 Lecture B, September 10, 2015 Tandy Warnow September 11, 2015 CS 173, Lecture B September 10, 2015 Tandy Warnow Examlet Today Four problems: One induction proof One problem on simplifying a logical

More information

ECE 238L Boolean Algebra - Part I

ECE 238L Boolean Algebra - Part I ECE 238L Boolean Algebra - Part I August 29, 2008 Typeset by FoilTEX Understand basic Boolean Algebra Boolean Algebra Objectives Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand

More information

MATH 271 Summer 2016 Practice problem solutions Week 1

MATH 271 Summer 2016 Practice problem solutions Week 1 Part I MATH 271 Summer 2016 Practice problem solutions Week 1 For each of the following statements, determine whether the statement is true or false. Prove the true statements. For the false statement,

More information

MA 113 Calculus I Fall 2016 Exam 3 Tuesday, November 15, True/False 1 T F 2 T F 3 T F 4 T F 5 T F. Name: Section:

MA 113 Calculus I Fall 2016 Exam 3 Tuesday, November 15, True/False 1 T F 2 T F 3 T F 4 T F 5 T F. Name: Section: MA 113 Calculus I Fall 2016 Exam 3 Tuesday, November 15, 2016 Name: Section: Last 4 digits of student ID #: This exam has five true/false questions (two points each), ten multiple choice questions (five

More information

Honors Geometry/Trigonometry course 4524/4525 Desert Mountain High School Math Department

Honors Geometry/Trigonometry course 4524/4525 Desert Mountain High School Math Department Honors Geometry/Trigonometry course 4524/4525 Desert Mountain High School Math Department Summer Work Packet Honors/AP/IB level math courses at Desert Mountain are for students who are enthusiastic learners

More information