Quiz 1. Directions: Show all of your work and justify all of your answers.
|
|
- Roland Sparks
- 5 years ago
- Views:
Transcription
1 Quiz 1 1. Let p and q be the following statements. p : Maxwell is a mathematics major. q : Maxwell is a chemistry major. (1) a. Write each of the following in symbolic form using logical connectives. i. Maxwell is a mathematics major or a chemistry major. p q ii. Maxwell is a mathematics major but not a chemistry major. p q (1) b. Write each of the following in words. i. p q Maxwell is either a mathematics major or a chemistry major but not both. ii. p q Maxwell is not a mathematics major or he is a chemistry major. If Maxwell is a mathematics major, then he is a chemistry major. (1) 2. Give the truth table for the following. [p ( p q)] q p q p q p q [p ( p q)] q T T F F T F T F F T F F F T T F T F F F T T T F Recall that [p (p q)] q [p ( p q)] q is modus ponens. So ([p ( p q)] q) (q q) which is a contradiction.
2 Quiz 2 1. Use a truth table to verify each of the following. (1) a. p q p q p q p p q p q T T F T T T F F F F F T T T T F F T T T (1) b. An implication is logically equivalent to its contrapositive. p q p q q p T T T T T F F F F T T T F F T T (1) 2. Give the truth table for (p r) (r q). p q r p r r q (p r) (r q) T T T T T T T T F F T T T F T T F T T F F F T T F T T T T T F T F T T T F F T T F T F F F T T T
3 Quiz (1) 1. Suppose that x, ρ, and θ are distinct real numbers. Put them in numerical order given the following. a. If ρ is not the largest, then θ is the largest. b. If θ is not the smallest, then x is the largest. θ < ρ < x Note that by the first statement, either ρ or θ is the largest. If θ is not the smallest, then the second statement implies that x is the largest which contradicts the first statement. Therefore, θ is the smallest. Since θ is not the largest, then ρ is the largest (modus tollens) by the first statement. (1) 2. Suppose you encounter three inhabitants of the island of knights and knaves created by Smullyan. Knights always tell the truth and knaves always lie. If possible, determine the relative ages of the three inhabitants given that there is exactly one knave in the group and they make the following statements. A : I am the oldest. B : I am older than A. C : I am the oldest. Solution: Inhabitant C is the oldest, B is the next oldest, and A is the youngest. Since the statements made by A and C are contradictory, one of them is the knave. Therefore, B is a knight and is telling the truth when claiming to be older than A. This means that A is the knave and C is the other knight. Since the statements made by B and C are true, C is the oldest, B is the next oldest, and A is the youngest.
4 Quiz 4 (2) 1. Prove that the sum of two rational numbers is a rational number. You may use without proof that the sum or product of two integers is an integer. Proof: Suppose that r,s Q. Then there are p a,p b,q a,q b Z such that a = p a and b = q a p b. Then a+b = p a + p b = p a q b +p b q a which is the quotient of integers. q b q a q b q a q b (2) 2. Identify the error in this proof that 1 = 2. Proof: Let x = 1. Then we have x 2 x 2 = x 2 x 2 x(x x) = (x+x)(x x) (factor each side differently) x = x+x (divide each side by x 2 x 2 ) x = 2x (x+x = 2x) 1 = 2 1 (substitute x = 1) 1 = 2 (2 1 = 2) The erroneous step is dividing by x 2 x 2 = 0.
5 Quiz 5 (2) 1. Find integers p and q such that p q = 0.51 Note that 100x x = 51 99x = 51 x = (2) 2. Prove that if 2 divides n, then 4 divides (5n+2) 2. Proof: Since 2 n, there exists k Z such that 2k = n. Then (5n+2) 2 = 25n 2 +20n+4 = 25(2k) 2 +40k +4 = 4(25k 2 +10k +1) which is divisible by Prove the converse of the statement in the previous problem. Direct Proof: Proof: Suppose that 4 divides (5n+2) 2 = 25n 2 +20n+4. Since 4 divides 20n+4, 4 must also divide 25n 2 +20n+4 (20n+4) = 25n 2. This implies that n 2 is even which implies that n is even. Therefore, 2 n. Contraposition Proof: Recall that the product of two odd integers is odd. Proof: Suppose that 2 does not divide n. Then n is odd which implies that 5n and 5n+2 are odd. Since 5n+2 is odd, (5n+2) 2 is odd which implies that it is not divisible by 4.
6 Quiz 6 (2) 1. Prove that 3 is irrational. (2) 2. Suppose that n N and p is a prime number. Prove that p n! if and only if p n.
7 Quiz 7 (2) 1. Prove that 3 is irrational. Proof: Toward a contradiction, suppose that 3 is rational. Then there are integers p and q such that 3 = p and p and q are relatively prime. Then q p q = 3 p 2 q 2 = 3 p 2 = 3q 2. Since 3 p 2 and 3 is prime, 3 p. So there exists a natural number k such that p = 3k. So we have that p 2 = 3q 2 (3k) 2 = 3q 2 9k 2 = 3q 2 3k 2 = q 2. Then 3 q 2 which implies that 3 q since 3 is prime. This is a contradiction since p and q are relatively prime. Therefore, 3 is irrational. (2) 2. Suppose that n N and p is a prime number. Prove that p n! if and only if p n. Proof: First, suppose that p divides n! = n(n 1)(n 2) Since p is prime, p divides one of n,(n 1),(n 2),...,3,2 which implies that p n. Now suppose that p n. Then p is one of n,(n 1),(n 2),...,3,2 which implies that n! = n(n 1)(n 2) is a multiple of p.
8 Quiz 8 (1) 1. Let A = [4,7] and B = [5, ). Express the following sets using interval notation. a. A\B = [4,5) b. B \A = (7, ). (1) 2. Use Venn diagrams to illustrate the following. A (B C) = (A B) (A C) (2) 3. Suppose that A, B, and C are sets. Prove that A (B C) = (A B) (A C). Proof: First, suppose that x [A (B C)]. Then x A and x (B C). Since x (B C), x B or x C. If x B, then x A B and if x C, then x A C. Since x A B or x A C, x [(A B) (A C)]. Therefore, A (B C) (A B) (A C). Now suppose that x [(A B) (A C)]. Then x (A B) or x (A C). If x (A B), then x A and x B B C which means that x [A (B C)]. On the other hand, if x (A C), then x A and x C B C which means that x [A (B C)]. So in any case, x [A (B C)] which implies that (A B) (A C). A (B C). Since A (B C) (A B) (A C) and (A B) (A C) A (B C), A (B C) = (A B) (A C).
9 Quiz 9 (2) 1. Give an example of a set X and a set A such that A is both a subset of X and an element of X. Let X = {x,{x}} and A = {x}. Since x X, A = {x} X. Also, note that A = {x} X. (2) 2. Suppose that X is a set and S = {x X : x / x}. Prove that if S X, then S S if and only if S / S. Proof: First, suppose that S S. Then S is an element of the set of elements of X that are not elements of themselves. Therefore, S is not an element of itself. Now suppose that S / S. Then S is not an element of itself. This implies that S is an element of the set of elements that are not elements of themselves. Therefore, S S.
10 Quiz Recall that N = {1,2,3,...} Consider the function f : (0, ) R defined by f(x) = lnx. Find the following sets. (1) a. f(n) = {ln1,ln2,ln3,ln4,...} (1) b. f -1 (N) = {e,e 2,e 3 e 4,...} (2) 2. Suppose that f : X Y, A,B X. Prove that f(a B) f(a) f(b). Below are two proofs. Proof: Suppose that y f(a B). Then there exists x A B such that f(x) = y. Since x A B, x A and hence y = f(x) f(a). Also, since x A B, x B and hence y = f(x) f(b). Since y f(a) and y f(b), y f(a) f(b). Proof: Since A B A, f(a B) f(a). Also, since A B B, f(a B) f(b). Since f(a B) f(a) and f(a B) f(b), f(a B) f(a) f(b).
11 Quiz 11 (2) 1. Define a relation R on P(N) by A R B if and only if A B. a. Is the relation R reflexive? Yes. Note that every set is a subset of itself. b. Is the relation R symmetric? No. Note that {1} N while N {1}. c. Is the relation R antisymmetric? Yes. If A B and B A, then A = B. d. Is the relation R transitive? Yes. If A B and B C, then A C. (1) 2. Using words and math symbols, describe the relation on R pictured below. For all x,y R, x is related to y if and only if x = y.
12 Quiz 12 (2) 1. Let A={1,2,3,4,5}. Give anexample of a relation R onasuch that R is reflexive, antisymmetric, transitive, and not symmetric. For all x,y A, (x,y) R if and only if x y.
13 Quiz 13 (3) 1. Let A = {1,2,3,4,5} and suppose that a relation R on A is reflexive, symmetric, and antisymmetric. List the elements of R. Justify your answer. R = {(1,1),(2,2),(3,3),(4,4),(5,5)} Proof: Since R is reflexive, all elements of A are related to themselves. Now suppose that x,y A such that x R y. Since R is symmetric, y R x. This implies that x = y since R is antisymmetric. Total Points: 44
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
Midterm: Sample 3 ECS20 (Fall 2017) Part I: logic 1) Using truth tables, establish for each of the two propositions below if it is a tautology, a contradiction or neither. 1) [p (q r)] [((r p) q) q] Let
More informationDISCRETE MATH: FINAL REVIEW
DISCRETE MATH: FINAL REVIEW DR. DANIEL FREEMAN 1) a. Does 3 = {3}? b. Is 3 {3}? c. Is 3 {3}? c. Is {3} {3}? c. Is {3} {3}? d. Does {3} = {3, 3, 3, 3}? e. Is {x Z x > 0} {x R x > 0}? 1. Chapter 1 review
More informationThe 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 information5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.
Statements Compounds and Truth Tables. Statements, Negations, Compounds, Conjunctions, Disjunctions, Truth Tables, Logical Equivalence, De Morgan s Law, Tautology, Contradictions, Proofs with Logical Equivalent
More information1. 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
Introduction to Discrete Mathematics 3450:208 Test 1 1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : The inverse of E : The
More informationAt least one of us is a knave. What are A and B?
1. This is a puzzle about an island in which everyone is either a knight or a knave. Knights always tell the truth and knaves always lie. This problem is about two people A and B, each of whom is either
More informationMACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)
MACM 101 Discrete Mathematics I Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class) SOLUTIONS 1. Construct a truth table for the following compound proposition:
More informationMTH 299 In Class and Recitation Problems SUMMER 2016
MTH 299 In Class and Recitation Problems SUMMER 2016 Last updated on: May 13, 2016 MTH299 - Examples CONTENTS Contents 1 Week 1 3 1.1 In Class Problems.......................................... 3 1.2 Recitation
More informationHomework 2: Solutions
Homework 2: Solutions ECS 20 (Fall 2014) Patrice Koehl koehl@cs.ucdavis.edu October 7, 2014 Exercise 1 Construct a truth table for each of these compound propositions: a) (p q) (p q) p q p q p q (p q)
More informationCS250: Discrete Math for Computer Science. L6: CNF and Natural Deduction for PropCalc
CS250: Discrete Math for Computer Science L6: CNF and Natural Deduction for PropCalc How to Simplify a PropCalc Formula: (p q) ((q r) p) How to Simplify a PropCalc Formula: 1. Get rid of s using def. of
More informationProving Things. 1. Suppose that all ravens are black. Which of the following statements are then true?
Proving Things 1 Logic 1. Suppose that all ravens are black. Which of the following statements are then true? (a) If X is a raven, then X is black. (b) If X is black, then X is a raven. (c) If X is not
More informationPacket #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 informationMATH 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 informationLECTURE 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 informationUNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS MATH 122: Logic and Foundations
UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS 2013 MATH 122: Logic and Foundations Instructor and section (check one): K. Mynhardt [A01] CRN 12132 G. MacGillivray [A02] CRN 12133 NAME: V00#: Duration: 3
More informationRecitation 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 informationSolutions to Homework Set 1
Solutions to Homework Set 1 1. Prove that not-q not-p implies P Q. In class we proved that A B implies not-b not-a Replacing the statement A by the statement not-q and the statement B by the statement
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
More informationEconomics 204 Summer/Fall 2017 Lecture 1 Monday July 17, 2017
Economics 04 Summer/Fall 07 Lecture Monday July 7, 07 Section.. Methods of Proof We begin by looking at the notion of proof. What is a proof? Proof has a formal definition in mathematical logic, and a
More informationUndergraduate 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 informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationCSE 20 DISCRETE MATH SPRING
CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationCOMP 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 informationThe Logic of Compound Statements cont.
The Logic of Compound Statements cont. CSE 215, Computer Science 1, Fall 2011 Stony Brook University http://www.cs.stonybrook.edu/~cse215 Refresh from last time: Logical Equivalences Commutativity of :
More informationMATH 2001 MIDTERM EXAM 1 SOLUTION
MATH 2001 MIDTERM EXAM 1 SOLUTION FALL 2015 - MOON Do not abbreviate your answer. Write everything in full sentences. Except calculators, any electronic devices including laptops and cell phones are not
More informationBasic Proof Examples
Basic Proof Examples Lisa Oberbroeckling Loyola University Maryland Fall 2015 Note. In this document, we use the symbol as the negation symbol. Thus p means not p. There are four basic proof techniques
More information1) Let h = John is healthy, w = John is wealthy and s = John is wise Write the following statement is symbolic form
Math 378 Exam 1 Spring 2009 Show all Work Name 1) Let h = John is healthy, w = John is wealthy and s = John is wise Write the following statement is symbolic form a) In order for John to be wealthy it
More informationLECTURE 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 informationRYERSON UNIVERSITY DEPARTMENT OF MATHEMATICS
RYERSON UNIVERSITY DEPARTMENT OF MATHEMATICS MTH 110 Final Exam December 6, 2008 Total marks: 100 Time allowed: 3 Hours. NAME (Print): STUDENT #: SIGNATURE: Circle your Lab Section: Section 1 Section 2
More informationCSE 1400 Applied Discrete Mathematics Proofs
CSE 1400 Applied Discrete Mathematics Proofs Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Axioms 1 Logical Axioms 2 Models 2 Number Theory 3 Graph Theory 4 Set Theory 4
More informationMATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG
MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG Suggested Problems for Logic and Proof The following problems are from Discrete Mathematics and Its Applications by Kenneth H. Rosen. 1. Which of these
More informationArgument. whenever all the assumptions are true, then the conclusion is true. If today is Wednesday, then yesterday is Tuesday. Today is Wednesday.
Logic and Proof Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement is called the conclusion. An argument is valid
More informationRED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam
RED Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam Note that the first 10 questions are true-false. Mark A for true, B for false. Questions 11 through 20 are multiple choice
More informationAN INTRODUCTION TO MATHEMATICAL PROOFS NOTES FOR MATH Jimmy T. Arnold
AN INTRODUCTION TO MATHEMATICAL PROOFS NOTES FOR MATH 3034 Jimmy T. Arnold i TABLE OF CONTENTS CHAPTER 1: The Structure of Mathematical Statements.............................1 1.1. Statements..................................................................
More informationDiscrete Mathematics Logics and Proofs. Liangfeng Zhang School of Information Science and Technology ShanghaiTech University
Discrete Mathematics Logics and Proofs Liangfeng Zhang School of Information Science and Technology ShanghaiTech University Resolution Theorem: p q p r (q r) p q p r q r p q r p q p p r q r T T T T F T
More informationMath 3336: Discrete Mathematics Practice Problems for Exam I
Math 3336: Discrete Mathematics Practice Problems for Exam I The upcoming exam on Tuesday, February 26, will cover the material in Chapter 1 and Chapter 2*. You will be provided with a sheet containing
More informationMATH 135 Fall 2006 Proofs, Part IV
MATH 135 Fall 006 s, Part IV We ve spent a couple of days looking at one particular technique of proof: induction. Let s look at a few more. Direct Here we start with what we re given and proceed in a
More informationMCS-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 informationCHAPTER 1 REAL NUMBERS KEY POINTS
CHAPTER 1 REAL NUMBERS 1. Euclid s division lemma : KEY POINTS For given positive integers a and b there exist unique whole numbers q and r satisfying the relation a = bq + r, 0 r < b. 2. Euclid s division
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationnot 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 informationSolutions to Practice Final
s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (
More informationSTUDY 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
STUDY PROBLEMS FOR EXAM I CMSC 203 DISCRETE STRUCTURES DR. LOMONACO 1. Use the principle of mathematical induction to prove that P (n) : n (n +1)(2n +1), for all integers n 1. Answer: Proof (by weak induction):
More information2. The Logic of Compound Statements Summary. Aaron Tan August 2017
2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional
More informationComputer Science Section 1.6
Computer Science 180 Solutions for Recommended Exercises Section 1.6. Let m and n be any two even integers (possibly the same). Then, there exist integers k and l such that m = k and n = l. Consequently,
More informationReview Sheet for the Final Exam of MATH Fall 2009
Review Sheet for the Final Exam of MATH 1600 - Fall 2009 All of Chapter 1. 1. Sets and Proofs Elements and subsets of a set. The notion of implication and the way you can use it to build a proof. Logical
More informationWORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:
WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their
More informationSome 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 informationChapter 1: The Logic of Compound Statements. January 7, 2008
Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number
More informationFinals: Solutions. ECS 20 (Fall 2009) Patrice Koehl May 20, 2016
Finals: Solutions ECS 20 (Fall 2009) Patrice Koehl koehl@cs.ucdavis.edu May 20, 2016 Part I: Logic Exercise 1 On a distant island, every inhabitant is either a Knight or Knave. Knights only tell the truth.
More informationSteinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)
Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning Terminology, Notations, Definitions, & Principles: Mathematical Proof and Proving (MPP) 1. A statement
More informationECON 4117/5111 Mathematical Economics
Test 1 September 29, 2006 1. Use a truth table to show the following equivalence statement: (p q) (p q) 2. Consider the statement: A function f : X Y is continuous on X if for every open set V Y, the pre-image
More informationCHAPTER 1 - LOGIC OF COMPOUND STATEMENTS
CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS 1.1 - Logical Form and Logical Equivalence Definition. A statement or proposition is a sentence that is either true or false, but not both. ex. 1 + 2 = 3 IS a statement
More informationPSU MATH RELAYS LOGIC & SET THEORY 2017
PSU MATH RELAYS LOGIC & SET THEORY 2017 MULTIPLE CHOICE. There are 40 questions. Select the letter of the most appropriate answer and SHADE in the corresponding region of the answer sheet. If the correct
More informationThere are seven questions, of varying point-value. Each question is worth the indicated number of points.
Final Exam MAT 200 Solution Guide There are seven questions, of varying point-value. Each question is worth the indicated number of points. 1. (15 points) If X is uncountable and A X is countable, prove
More informationMATH 215 Discrete Mathematics Worksheets. Which of these are propositions? What are the truth values of those that are propositions?
Which of these are propositions? What are the truth values of those that are propositions? 1. Would you like some coffee? 2. I would like coffee with cream and sugar. 3. Either Mom or Dad will pick me
More informationMath 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 informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.
More informationDepartment of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007) Problem 1: Specify two different predicates P (x) and
More informationDepartment of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination I (Spring 2008)
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination I (Spring 2008) Problem 1: Suppose A, B, C and D are arbitrary sets.
More informationWUCT121. Discrete Mathematics. Logic. Tutorial Exercises
WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the
More informationMATH 2400: PRACTICE PROBLEMS FOR EXAM 1
MATH 2400: PRACTICE PROBLEMS FOR EXAM 1 PETE L. CLARK 1) Find all real numbers x such that x 3 = x. Prove your answer! Solution: If x 3 = x, then 0 = x 3 x = x(x + 1)(x 1). Earlier we showed using the
More informationAdvanced Algebra. MA Prof. Götz Pfeiffer
Advanced. Prof. Götz Pfeiffer http://schmidt.nuigalway.ie/ma180-4 School of Mathematics, Statistics and Applied Mathematics NUI Galway Semester 2 (2017/2018) Outline 1 2 3 References. Norman L. Biggs.
More informationSection 0. Sets and Relations
0. Sets and Relations 1 Section 0. Sets and Relations NOTE. Mathematics is the study of ideas, not of numbers!!! The idea from modern algebra which is the focus of most of this class is that of a group
More informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationReview 1. Andreas Klappenecker
Review 1 Andreas Klappenecker Summary Propositional Logic, Chapter 1 Predicate Logic, Chapter 1 Proofs, Chapter 1 Sets, Chapter 2 Functions, Chapter 2 Sequences and Sums, Chapter 2 Asymptotic Notations,
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationMATH 2200 Final LC Review
MATH 2200 Final LC Review Thomas Goller April 25, 2013 1 Final LC Format The final learning celebration will consist of 12-15 claims to be proven or disproven. It will take place on Wednesday, May 1, from
More informationProofs. 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 informationMath1a Set 1 Solutions
Math1a Set 1 Solutions October 15, 2018 Problem 1. (a) For all x, y, z Z we have (i) x x since x x = 0 is a multiple of 7. (ii) If x y then there is a k Z such that x y = 7k. So, y x = (x y) = 7k is also
More informationMathematical Reasoning & Proofs
Mathematical Reasoning & Proofs MAT 1362 Fall 2018 Alistair Savage Department of Mathematics and Statistics University of Ottawa This work is licensed under a Creative Commons Attribution-ShareAlike 4.0
More informationCarmen s Core Concepts (Math 135)
Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 3 1 Translating From Mathematics to English 2 Contrapositive 3 Example of Contrapositive 4 Types of Implications 5 Contradiction
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationMT181 Number Systems: Sheet 1. Attempt all numbered questions. To be handed in during the MT181 lecture on Thursday 11th October.
MT181 Number Systems: Sheet 1 Attempt all numbered questions. To be handed in during the MT181 lecture on Thursday 11th October. 1. Read the preface and pages 3 8 of How to think like a mathematician by
More informationCSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!
CSCE 222 Discrete Structures for Computing Review for Exam 1 Dr. Hyunyoung Lee 1 Topics Propositional Logic (Sections 1.1, 1.2 and 1.3) Predicate Logic (Sections 1.4 and 1.5) Rules of Inferences and Proofs
More information8. 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 informationSample Problems for all sections of CMSC250, Midterm 1 Fall 2014
Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical
More informationMathematical Reasoning Rules of Inference & Mathematical Induction. 1. Assign propositional variables to the component propositional argument.
Mathematical Reasoning Rules of Inference & Mathematical Induction Example. If I take the day off it either rains or snows 2. When It rains, my basement floods 3. When the basement floods or it snows,
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationExercise Set 1 Solutions Math 2020 Due: January 30, Find the truth tables of each of the following compound statements.
1. Find the truth tables of each of the following compound statements. (a) ( (p q)) (p q), p q p q (p q) q p q ( (p q)) (p q) 0 0 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 1 1 1 1 1 1 0 0 1 0 (b) [p ( p q)] [( (p
More informationCHAPTER 3 REVIEW QUESTIONS MATH 3034 Spring a 1 b 1
. Let U = { A M (R) A = and b 6 }. CHAPTER 3 REVIEW QUESTIONS MATH 334 Spring 7 a b a and b are integers and a 6 (a) Let S = { A U det A = }. List the elements of S; that is S = {... }. (b) Let T = { A
More informationMath 3140 Fall 2012 Assignment #3
Math 3140 Fall 2012 Assignment #3 Due Fri., Sept. 21. Remember to cite your sources, including the people you talk to. My solutions will repeatedly use the following proposition from class: Proposition
More informationMATH10040: 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 informationREAL NUMBERS. Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b.
REAL NUMBERS Introduction Euclid s Division Algorithm Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b. Fundamental
More informationEECS 1028 M: Discrete Mathematics for Engineers
EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 32 Proofs Proofs
More informationCOMP Intro to Logic for Computer Scientists. Lecture 15
COMP 1002 Intro to Logic for Computer Scientists Lecture 15 B 5 2 J Types of proofs Direct proof of x F x Show that F x holds for arbitrary x, then use universal generalization. Often, F x is of the form
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationTest 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?
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
More informationCSI30. Chapter 2. Basic Structures: Sets, Functions, Sequences, Sums. 2.1 Sets and subsets 2.2 Sets of sets
Chapter 2. Basic Structures: Sets, Functions, Sequences, Sums 2.1 Sets and subsets 2.2 Sets of sets 1 Set is an unordered collection of objects. - used to group objects together, - often the objects with
More informationAbout This Document. MTH299 - Examples Weeks 1-6; updated on January 5, 2018
About This Document This is the examples document for MTH 299. Basically it is a loosely organized universe of questions (examples) that we think are interesting, helpful, useful for practice, and serve
More information(1) Which of the following are propositions? If it is a proposition, determine its truth value: A propositional function, but not a proposition.
Math 231 Exam Practice Problem Solutions WARNING: This is not a sample test. Problems on the exams may or may not be similar to these problems. These problems are just intended to focus your study of the
More informationA Guide to Proof-Writing
A Guide to Proof-Writing 437 A Guide to Proof-Writing by Ron Morash, University of Michigan Dearborn Toward the end of Section 1.5, the text states that there is no algorithm for proving theorems.... Such
More informationb) since the remainder is 0 I need to factor the numerator. Synthetic division tells me this is true
Section 5.2 solutions #1-10: a) Perform the division using synthetic division. b) if the remainder is 0 use the result to completely factor the dividend (this is the numerator or the polynomial to the
More informationMidterm Preparation Problems
Midterm Preparation Problems The following are practice problems for the Math 1200 Midterm Exam. Some of these may appear on the exam version for your section. To use them well, solve the problems, then
More informationCSE 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 informationAnnouncements. Exam 1 Review
Announcements Quiz today Exam Monday! You are allowed one 8.5 x 11 in cheat sheet of handwritten notes for the exam (front and back of 8.5 x 11 in paper) Handwritten means you must write them by hand,
More information9/5/17. Fermat s last theorem. CS 220: Discrete Structures and their Applications. Proofs sections in zybooks. Proofs.
Fermat s last theorem CS 220: Discrete Structures and their Applications Theorem: For every integer n > 2 there is no solution to the equation a n + b n = c n where a,b, and c are positive integers Proofs
More informationMA 1124 Solutions 14 th May 2012
MA 1124 Solutions 14 th May 2012 1 (a) Use True/False Tables to prove (i) P = Q Q = P The definition of P = Q is given by P Q P = Q T T T T F F F T T F F T So Q P Q = P F F T T F F F T T T T T Since the
More information1. 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