Discrete Mathematics Exam File Spring Exam #1
|
|
- Gyles Knight
- 5 years ago
- Views:
Transcription
1 Discrete Mathematics Exam File Spring 2008 Exam #1 1.) Consider the sequence a n = 2n + 3. a.) Write out the first five terms of the sequence. b.) Determine a recursive formula for the sequence. 2.) Consider the sequence a 1 = 3, a n = a n-1 + 2n + 1, n > 1. a.) Write out the first five terms of the sequence. b.) Determine a closed form formula for the sequence. 3.) Consider the conditional p q. a.) Use a truth table to show whether or not the conditional and its contrapositive are logically equivalent. b.) Use a truth table to show whether or not the conditional and its converse are logically equivalent. 4.) Let Z denote the set of integers. Which of the following quantified predicate statements are true? Justify your answers. a.) n Z, k Z, n + k = 0 b.) n Z, k Z, n + k = 0 5.) For each of the statements in #4, write the negation of the statement. 6.) For each of the following, identify the reasoning as either valid (modus ponens), valid (modus tollens), invalid (converse fallacy) or invalid (inverse fallacy). a.) If Bob Gibson pitched the game, then the Cardinals won. The Cardinals did not win the game. Therefore, Bob Gibson did not pitch the game. b.) If today is Tuesday, then Bob is in Gurdon. Bob is in Gurdon. Therefore, today is Tuesday. c.) If calculus is a prerequisite for the course, then Mary will not take the course. Calculus is not a prerequisite for the course. Therefore, Mary took the course. d.) If the baseball team scores no runs then they will not win the game. The baseball team scored no runs. Therefore they did not win the game. e.) If today is raining then it is Saturday. Today is raining. Therefore it is Saturday. 7.) For each symbolic logic statement in the left column, identify the statement from the right column to which it is logically equivalent. p q A (p q) (p r ) p t B q p p (q r ) C q p (q p) D q p p q E q p p q F p 8.) There are three paths from Town A to Town B. Only one of the paths is free from land mines. The North Path has a sign on it that says "There are land mines here." The Central Path has a sign that says "There are mines on the north path." The South Path has a sign that says "The south path is clear." One and
2 only one of the signs is false. Which path is clear of land mines? Explain your answer. N NORTH PATH There Are Land Mines Here Town A CENTRAL PATH There Are Mines On The North Path SOUTH PATH The South Path Is Clear Town B 9.) Use a truth table to check if the following symbolic logic statements are logically equivalent; state your conclusion using complete sentence(s). p ( p q) and p ( p q) 10.) Use a truth table to determine if the following is a valid argument; depending on your approach, you may have to add columns. Give your conclusion using complete sentences. p r q ( ) r q p 11.) For D = { 3, 4, 7, 8, 9, 11, 13}, which of the following are true? Justify your answers. a.) x D, if x is odd then, x > 7. b.) x D, if x > 13, then x is even. 12.) Determine the truth value of [( q r) p] [ r ( s q)] if p, r, and s are all true and q is false. Justify your answer. 13.) Suppose that P and Q are logical statements made up of propositions p, q and r, along with some combinations of,, and. Suppose P Q. Prove that P Q is a tautology. Exam #2 1.) Compute the following: a.) 23 mod 5 b.) 6 mod 9 c.) -35 mod 8 d.) (8n 3-4n n + 9) mod 4 e.) mod 4 2.) Disprove the following statement by giving a counterexample. The difference of any two odd integers is odd. 3.) If 12 eggs are each to be dyed a single solid color and five colors are available, what can you say about the number of eggs of the same color?
3 4.) Prove that the sum of a rational number and an irrational number is irrational. 5.) n ( n + 1) Prove that, for every natural number, n, L + n =. 2 6.) Prove that any three integers contain a pair whose sum is even. 7.) Use the contrapositive to prove the following. Let n be a natural number. If n 2 is even, then n is even. 8.) Use proof by contradiction to show that, if n is an odd integer, then n 2 + n is even. 9.) Show that 3 is irrational. 10.) Suppose a, b and c are integers. Show that if a b and a c, then, for any integers, m and n, a (mb + nc). Exam #3 1.) Let U = {a, b, c, d, e, f, g, h, i, j}, A = {a, b, c, d}, B = {a, e, i}, C = {a, b, e, i}. [Note: U denotes the universe for this problem.] a.) Evaluate ( B C ) A. b.) Evaluate ( A B) ' C. c.) Evaluate (A C) B. 2.) Evaluate {1, 2} x {a, b, c}. 3.) Let A={a, 1, 2}. Find (A), that is, find the power set of A. 4.) Using appropriate set notation, describe the shaded region represented in the following Venn diagram. 5.) Without using Venn Diagrams, prove ( A B) ' = A ' B '. 6.) Give an element-wise proof that for sets A, B, C, ( A B) ( A C) A ( B C). 7.) Find a counterexample to the following statement A U ( B C) = ( A U B) C. 8.) As in the book, let n(s) denote the number of elements in a set S. Suppose n (A) = 23, n( A I B) = 5, and n( A U B) = 42. Find n(b). 9.) Given A = { 2k : k Z} and B = { 2k + 1: k Z}. Determine, with justification, if {A, B} is a partition of Z. 10.) Perform the following conversions. a.) ten to base 8 b.) 1AB301 hex to base 10 c.) two to hexadecimal d.) BEEF hex to binary e.) ten to base 7
4 Exam #4 1.) Given A = { 2k : k Z} and B = { 2k + 1: k Z}. Determine, with justification, if {A, B} is a partition of Z. 2.) In a small state, a license plate consists of two letters from {A, R, K, N, S} followed by 3 or 4 digits. (Repetitions of letters or digits are allowed.) How many license plates are possible? 3.) Consider the set B = {0,1,2,3,4,5,6}. a.) How many 5-digit numbers use distinct digits from B? b.) How many of these are odd? 4.) How many batting orders for a baseball team (9 players) are possible from a roster of 20 players? 5.) A club of 10 men and 8 women is forming a 5-person steering committee. Of these, how many are possible for each of these situations? a.) The committee contains exactly 3 men. b.) at least 3 men. c.) The committee contains at least one man. 6.) Consider the following definitions. A = {a, b, c, d, e} B = {1, 3, 4, 5, 6} C = {x, y, z, w} D = {Bob, Mary, Dave, Jane, Joseph, Martha} f is a relation defined by {(a, 1), (b, 4), (c, 3), (d, 5), (e, 4)} g is a relation defined by {(x, a), (y, b), (y, c), (z, b), (w, d)} h is a relation defined by {(Bob, a), (Mary, b), (Dave, b), (Jane, c), (Joseph, d), (Martha, e} Each relation is defined with one of A, B, C or D as its domain and one as its codomain. a.) Fill in the chart. f g h Is it a function? Yes or No b.) c.) What is its domain? What is its codomain? Is it one-to-one? Yes or No Is it onto? Yes or No Which composition(s) would be defined? For any of f, g or h that are invertible, give the set of ordered pairs which define the inverse function. If none are invertible, say so. 7.) Consider the set A = {1, 2, 3}. Draw the arrow diagram for the relation R = {(a, b} a, b (A), a b}. 8.) Suppose A is a finite set. Prove that R is an equivalence relation on (A) if, for a, b (A), (a, b) R if and only if n(a) = n(b). 9.) Use the Binomial Theorem to expand (2x + y) ) What is the coefficient of x 8 y 5 in the expansion of (2x - y) 13?
5 Final Exam 1.) Let our "universe" be U={a, b, c, d, e, f, g, h, i, j, k}. Let A={a, b, c, d}, B={a, e, i}, and C={a, b, e, i}. Evaluate each of the following. a.) (A C) B. b.) (A B) ' C. c.) (B C) - A. d.) Do A, B and C form a partition of U? Why or why not? 2.) Consider the conditional p q. a.) Use a truth table to show whether or not the conditional and its contrapositive are logically equivalent. b.) Use a truth table to show whether or not the conditional and its converse are logically equivalent. 3.) Prove that, for any integer n, the number n 2 + n is even. 4.) Perform the following conversions. a.) 1235 ten to base 8 b.) 1AB01 hex to base 10 c.) BAA0 hex to binary d.) 2345 ten to base 6 e.) Suppose we are doing work with various number bases. You are given the number but the base was accidentally erased. What can you say about the base? 5.) Compute the following: a.) 47 mod 5 b.) 6 mod 6 c.) -52 mod 7 d.) (8n 3-24n n + 9) mod 8 e.) mod 4 6.) Consider the following definitions. A = {a, b, c, d, e} B = {1, 3, 4, 5, 6} C = {x, y, z, w} D = {Bob, Mary, Dave, Joseph, Martha} f is a relation defined by {(x, a), (y, b), (z, b), (w, d)} g is a relation defined by {(Bob, a), (Mary, b), (Dave, c), (Joseph, d), (Martha, e} h is a relation defined by {(a, 1), (b, 4), (c, 3), (d, 5), (e, 4)} Each relation is defined with one of A, B, C or D as its domain and one as its codomain. a.) Fill in the chart. f g h Is it a function? Yes or No What is its domain? What is its codomain? Is it one-to-one? Yes or No Is it onto? Yes or No b.) Which composition(s) would be defined? c.) For any of f, g or h that are invertible, give the set of ordered pairs which define the inverse function. If none are invertible, say so. 7.) n ( n + 1) Use induction to prove that for every natural number, n, L + n =. 2
6 8.) Prove that for all integers n > 4, if n is a perfect square, then n - 1 is not a prime number. 9.) Use the contrapositive to prove the following. For all integers n, if n 2 is even, then n is even. 10.) Coins are randomly removed from a piggy bank containing 12 pennies, eight nickels, ten dimes, and three quarters. How many coins must be removed to guarantee: a.) three pennies? b.) three coins of the same kind? c.) three quarters? d.) a pair of pennies and a pair of dimes? 11.) Consider (S) (the power set of S) if S = {1, 2, 3}. Define a relation on (S) as follows. A relates to B if and only if A B Determine whether or not this defines an equivalence relation (S). 12.) Define an invertible function between A = {a, b, c, d, e} and B = {red, yellow, green, blue, brown}. Explain how this proves the two sets have the same number of elements. 13.) Prove that (A B) C (A C) (B C). 14.) Prove that ( A B) ' = A ' B '. 15.) Use a counterexample to disprove that the difference of the squares of any two odd numbers is odd. 16.) a.) Five children order one small soft drink each from a stand that offers seven kinds of soft drinks. How many outcomes are possible? b.) To save time, the chaperone decides to order some selection of five small soft drinks from the seven kinds available, without consulting the children or deciding who will get which drink. How many ways may the chaperone place the order?
1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points
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 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 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 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 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 informationMath 230 Final Exam, Spring 2008
c IIT Dept. Applied Mathematics, May 15, 2008 1 PRINT Last name: Signature: First name: Student ID: Math 230 Final Exam, Spring 2008 Conditions. 2 hours. No book, notes, calculator, cell phones, etc. Part
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 230 Final Exam, Spring 2009
IIT Dept. Applied Mathematics, May 13, 2009 1 PRINT Last name: Signature: First name: Student ID: Math 230 Final Exam, Spring 2009 Conditions. 2 hours. No book, notes, calculator, cell phones, etc. Part
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 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 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 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 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 informationCSC 125 :: Final Exam December 14, 2011
1-5. Complete the truth tables below: CSC 125 :: Final Exam December 14, 2011 p q p q p q p q p q p q T T F F T F T F (6 9) Let p be: Log rolling is fun. q be: The sawmill is closed. Express these as English
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 informationProblem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B.
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination III (Spring 2007) Problem 1: Suppose A, B, C and D are finite sets
More informationCSC 125 :: Final Exam December 15, 2010
1-5. Complete the truth tables below: CSC 125 :: Final Exam December 15, 2010 p q p q p q p q p q p q T T F F T F T F 6-13. Fill in the missing portion of each of the rules of inference named below: 6.
More informationLogic 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 information3. The Logic of Quantified Statements Summary. Aaron Tan August 2017
3. The Logic of Quantified Statements Summary Aaron Tan 28 31 August 2017 1 3. The Logic of Quantified Statements 3.1 Predicates and Quantified Statements I Predicate; domain; truth set Universal quantifier,
More informationLogic. Facts (with proofs) CHAPTER 1. Definitions
CHAPTER 1 Logic Definitions D1. Statements (propositions), compound statements. D2. Truth values for compound statements p q, p q, p q, p q. Truth tables. D3. Converse and contrapositive. D4. Tautologies
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 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 informationMATH 114 Fall 2004 Solutions to practice problems for Final Exam
MATH 11 Fall 00 Solutions to practice problems for Final Exam Reminder: the final exam is on Monday, December 13 from 11am - 1am. Office hours: Thursday, December 9 from 1-5pm; Friday, December 10 from
More informationMath 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 informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs
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 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 informationChapter 2: The Logic of Quantified Statements. January 22, 2010
Chapter 2: The Logic of Quantified Statements January 22, 2010 Outline 1 2.1- Introduction to Predicates and Quantified Statements I 2 2.2 - Introduction to Predicates and Quantified Statements II 3 2.3
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs
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 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 informationCSC 125 :: Final Exam May 3 & 5, 2010
CSC 125 :: Final Exam May 3 & 5, 2010 Name KEY (1 5) Complete the truth tables below: p Q p q p q p q p q p q T T T T F T T T F F T T F F F T F T T T F F F F F F T T 6-15. Match the following logical equivalences
More informationChapter 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 informationIntro to Logic and Proofs
Intro to Logic and Proofs Propositions A proposition is a declarative sentence (that is, a sentence that declares a fact) that is either true or false, but not both. Examples: It is raining today. Washington
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 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 information586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws
Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 465 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,
More informationShow 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 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 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 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 informationCMPSCI 250: Introduction to Computation. Lecture 11: Proof Techniques David Mix Barrington 5 March 2013
CMPSCI 250: Introduction to Computation Lecture 11: Proof Techniques David Mix Barrington 5 March 2013 Proof Techniques Review: The General Setting for Proofs Types of Proof: Direct, Contraposition, Contradiction
More information1.1 Language and Logic
c Oksana Shatalov, Spring 2018 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,
More informationDiscrete 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 informationConjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.
Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is
More informationA spinner has a pointer which can land on one of three regions labelled 1, 2, and 3 respectively.
Math For Liberal Arts Spring 2011 Final Exam. Practice Version Name A spinner has a pointer which can land on one of three regions labelled 1, 2, and 3 respectively. 1) Compute the expected value for the
More informationDiscrete Structures Homework 1
Discrete Structures Homework 1 Due: June 15. Section 1.1 16 Determine whether these biconditionals are true or false. a) 2 + 2 = 4 if and only if 1 + 1 = 2 b) 1 + 1 = 2 if and only if 2 + 3 = 4 c) 1 +
More informationMidterm 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 informationPROPOSITIONAL CALCULUS
PROPOSITIONAL CALCULUS A proposition is a complete declarative sentence that is either TRUE (truth value T or 1) or FALSE (truth value F or 0), but not both. These are not propositions! Connectives and
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 informationDISCRETE MATH: LECTURE 6
DISCRETE MATH: LECTURE 6 DR. DANIEL FREEMAN 1) a. Does 3 = {3}? b. 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 2) a. When does (a, b) = (c, d)?
More informationPropositional Calculus. Problems. Propositional Calculus 3&4. 1&2 Propositional Calculus. Johnson will leave the cabinet, and we ll lose the election.
1&2 Propositional Calculus Propositional Calculus Problems Jim Woodcock University of York October 2008 1. Let p be it s cold and let q be it s raining. Give a simple verbal sentence which describes each
More informationDiscrete 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 informationDiscrete Mathematical Structures: Theory and Applications
Chapter 1: Foundations: Sets, Logic, and Algorithms Discrete Mathematical Structures: Theory and Applications Learning Objectives Learn about sets Explore various operations on sets Become familiar with
More informationDISCRETE MATHEMATICS BA202
TOPIC 1 BASIC LOGIC This topic deals with propositional logic, logical connectives and truth tables and validity. Predicate logic, universal and existential quantification are discussed 1.1 PROPOSITION
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 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 informationTopics in Logic and Proofs
Chapter 2 Topics in Logic and Proofs Some mathematical statements carry a logical value of being true or false, while some do not. For example, the statement 4 + 5 = 9 is true, whereas the statement 2
More informationDiscrete Structures CRN Test 3 Version 1 CMSC 2123 Autumn 2013
. Print your name on your scantron in the space labeled NAME. 2. Print CMSC 223 in the space labeled SUBJECT. 3. Print the date 2-2-203, in the space labeled DATE. 4. Print your CRN, 786, in the space
More informationA. Propositional Logic
CmSc 175 Discrete Mathematics A. Propositional Logic 1. Statements (Propositions ): Statements are sentences that claim certain things. Can be either true or false, but not both. Propositional logic deals
More informationPractice 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 informationPacket #1: Logic & Proofs. Applied Discrete Mathematics
Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should
More informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Exam Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Express the set using the roster method. 1) {x x N and x is greater than 7} 1) A) {8,9,10,...}
More informationChapter 2: Set Theory 2. Chapter 3: Combinatorics 3. Chapter 4: Probability 4. Chapter 5: Statistics 5
M118 Exam Jam Concise s Contents Chapter 2: Set Theory 2 Chapter 3: Combinatorics 3 Chapter 4: Probability 4 Chapter 5: Statistics 5 Chapter 6: Linear Equations and Matrix Algebra 7 Chapter 7: Linear Programming:
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 informationMTH202 Discrete Mathematics
LATSEST MCQS FROM MIDTERM PAPERS 10 MAY 011 MC10040185 moaaz.pk@gmail.com Moaaz siddiq MTH0 Discrete Mathematics Question No. 1: If p= It is raining q = She will go to college "It is raining and she will
More informationHomework 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 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 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 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 informationTEST BANK Questions for Chapter 1
464 Test Bank Questions and Answers TEST BANK Questions for Chapter 1 What is the negation of the propositions in 1 3? 1. Abby has more than 300 friends on facebook. 2. A messaging package for a cell phone
More informationMath 13, Spring 2013, Lecture B: Midterm
Math 13, Spring 2013, Lecture B: Midterm Name Signature UCI ID # E-mail address Each numbered problem is worth 12 points, for a total of 84 points. Present your work, especially proofs, as clearly as possible.
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 informationMat 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 informationPS10.3 Logical implications
Warmup: Construct truth tables for these compound statements: 1) p (q r) p q r p q r p (q r) PS10.3 Logical implications Lets check it out: We will be covering Implications, logical equivalence, converse,
More informationMath 205 April 28, 2009 Final Exam Review
1 Definitions 1. Some question will ask you to statea a definition and/or give an example of a defined term. The terms are: subset proper subset intersection union power set cartesian product relation
More informationSETS. Chapter Overview
Chapter 1 SETS 1.1 Overview This chapter deals with the concept of a set, operations on sets.concept of sets will be useful in studying the relations and functions. 1.1.1 Set and their representations
More informationLecture 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 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 informationYour quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due by 11:59 p.m., Tuesday.
Friday, February 15 Today we will begin Course Notes 3.2: Methods of Proof. Your quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due
More informationCITS2211 Discrete Structures Proofs
CITS2211 Discrete Structures Proofs Unit coordinator: Rachel Cardell-Oliver August 13, 2017 Highlights 1 Arguments vs Proofs. 2 Proof strategies 3 Famous proofs Reading Chapter 1: What is a proof? Mathematics
More informationLogic Review Solutions
Logic Review Solutions 1. What is true concerning the validity of the argument below? (hint: Use a Venn diagram.) 1. All pesticides are harmful to the environment. 2. No fertilizer is a pesticide. Therefore,
More informationM118 Exam Jam. Contents. Chapter 2: Set Theory 2. Chapter 3: Combinatorics 5. Chapter 4: Probability 7. Chapter 5: Statistics 12
Contents Chapter 2: Set Theory 2 Chapter 3: Combinatorics 5 Chapter 4: Probability 7 Chapter 5: Statistics 12 Chapter 6: Linear Equations and Matrix Algebra 17 Chapter 7: Linear Programming: Graphical
More informationDRAFT. M118 Exam Jam Concise. Contents. Chapter 2: Set Theory 2. Chapter 3: Combinatorics 3. Chapter 4: Probability 4. Chapter 5: Statistics 6
Contents Chapter 2: Set Theory 2 Chapter 3: Combinatorics 3 Chapter 4: Probability 4 Chapter 5: Statistics 6 Chapter 6: Linear Equations and Matrix Algebra 8 Chapter 7: Linear Programming: Graphical Solutions
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 informationUNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK
UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) (2011 Admission Onwards) I Semester Core Course FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK 1) If A and B are two sets
More informationLogic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.
Math 0413 Appendix A.0 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. This type of logic is called propositional.
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 informationLogic and Proofs. (A brief summary)
Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations
More informationChapter 2: The Logic of Quantified Statements
Chapter 2: The Logic of Quantified Statements Topics include 2.1, 2.2 Predicates and Quantified Statements, 2.3 Statements with Multiple Quantifiers, and 2.4 Arguments with Quantified Statements. cs1231y
More informationReadings: 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 informationChapter 3. The Logic of Quantified Statements
Chapter 3. The Logic of Quantified Statements 3.1. Predicates and Quantified Statements I Predicate in grammar Predicate refers to the part of a sentence that gives information about the subject. Example:
More informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Explain the steps in a proof by (strong) mathematical induction Use (strong) mathematical induction
More informationMath Fall Final Exam. Friday, 14 December Show all work for full credit. The problems are worth 6 points each.
Name: Math 50 - Fall 2007 Final Exam Friday, 4 December 2007 Show all work for full credit. The problems are worth 6 points each.. Find the number of subsets of S = {, 2,... 0} that contain exactly 5 elements,
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 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 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 informationProof by Contradiction
Proof by Contradiction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Proof by Contradiction Fall 2014 1 / 12 Outline 1 Proving Statements with Contradiction 2 Proving
More information1. From Lewis Carroll: extract a pair of premises and finish the conclusion.
Math 2200 2. Treibergs σιι First Midterm Exam Name: Sample January 26, 2011 Sample First Midterm Questions. Sept. 17, 2008 and Sept. 16, 2009. Some questions from Math 3210 Midterms of 1. From Lewis Carroll:
More informationSection 2.1: Introduction to the Logic of Quantified Statements
Section 2.1: Introduction to the Logic of Quantified Statements In the previous chapter, we studied a branch of logic called propositional logic or propositional calculus. Loosely speaking, propositional
More information