Discrete Structures Homework 1

Size: px
Start display at page:

Download "Discrete Structures Homework 1"

Transcription

1 Discrete Structures Homework 1 Due: June 15. Section Determine whether these biconditionals are true or false. a) = 4 if and only if = 2 b) = 2 if and only if = 4 c) = 3 if and only if monkeys can fly d) 0 > 1 if and only if 2 > 1 32 Construct a truth table for each of these compound propositions. (3 pt) a) p p c) p (p q) e) (q p) (p q) Section Show that each of these conditional statements is a tautology. You will get bonus points if you show it without a truth table. a) [ p (p q)] q b) [(p q) (q r)] (p r) c) [p (p q)] q d) [(p q) (p r) (q r)] r EC Find a compound proposition (a formula) using the variables p, q and r such that changing the truth value of one variable always also changes the truth value of the compound proposition. Section Let C(x) be the statement x has a cat, let D(x) be the statement x has a dog, and let F (x) be the statement x has a ferret. Express each of these statements in terms of C(x), D(x), F (x), quantifiers, and logical connectivities. Let the domain consist of all students in your class. a) A student in your class has a cat, a dog, and a ferret. b) All students in your class have a cat, a dog, or a ferret. c) Some student in your class has a cat and a ferret, but not a dog. d) No student in your class has a cat, a dog, and a ferret. e) For each of the three animals, cats, dogs, and ferrets there is a student in your class who has this animal as pet. 16 Determine the truth value of each of these statements if the domain of each variable consists of all real numbers. a) x : x 2 = 2 b) x : x 2 = 1 c) x : x d) x : x 2 x

2 Section Express the negations of each of these statements so that all negation symbols immediately precede predicates. a) z y x T (x, y, z) b) x y P (x, y) x y Q(x, y) c) x y (Q(x, y) Q(y, x)) d) y x z (T (x, y, z) Q(x, y)) 40 Find a counterexample, if possible, to these universally quantified statements, where the domain for all variables consists of all integers. (3 pt) a) x y : x = 1/y b) x y : y 2 x < 100 c) x y : x 2 y 3 EC Which of the following statements is right, which is wrong? Explain your answer. a) x F (x) x G(x) x (F (x) G(x)) b) x F (x) x G(x) x (F (x) G(x)) c) x F (x) x G(x) x (F (x) G(x)) d) x F (x) x G(x) x (F (x) G(x)) 2

3 Discrete Structures Homework 2 Due: June 22. Section Use rules of inference to show that the hypotheses If it does not rain or it is not foggy, then the sailing race will be held and the lifesaving demonstration will go on., If the sailing race is held, then the trophy will be awarded, and The trophy was not awarded imply the conclusion It rained. Please use the following variables: r - It rains. f - It is foggy. s - The sailing race will be held. l - The life saving demonstration will go on. t - The trophy will be awarded. 28 Use rules of inference to show that if x ( P (x) Q(x) ) and x ( ( P (x) Q(x)) R(x) ) are true, then x ( R(x) P (x) ) is also true, where the domains of all quantifiers are the same. (3 pt) Section Use a direct proof to show that the product of two odd numbers is odd. 26 Prove that if n is a positive integer, then n is even if and only if 7n + 4 is even. 32 Show that these statements about the real number x are equivalent: (i) x is rational (ii) x/2 is rational (iii) 3x 1 is rational. Section Show that the product of two of the numbers , , and is nonnegative. Is your proof constructive or nonconstructive? Hint. Ignore the value of the given numbers and don t try to find out if they are positive or negative. 20 Prove that given real number x there exist unique numbers n and ϵ such than x = n + ϵ, n is an integer, and 0 ϵ < 1 EC Prove the following statement: If a line L does not intersect a diagonal of a convex polygon P then L can intersect only one of the two subpolygons defined by that diagonal.

4 Discrete Structures Homework 3 Due: June 29. Section Determine whether these statements are true or false. (7 pt) a) { } b) {, { }} c) { } { } d) { } {{ }} e) { } {, { }} f) {{ }} {, { }} g) {{ }} {{ }, { }} 18 Find two sets A and B such that A B and A B. 24 Determine whether each of these sets is the power set of a set, where a and b are distinct elements. a) b) {, {a}} c) {, {a}, {, a}} d) {, {a}, {b}, {a, b}} Section Let A = {a, b, c, d, e} and B = {a, b, c, d, e, f, g, h}. Find a) A B b) A B c) A B d) B A 18 Let A, B, and C be sets. Show that (3 pt) a) (A B) (A B C). c) (A B) C A C. e) (B A) (C A) = (B C) A. 50 Find i=1 A i and i=1 A i if for every positive integer i a) A i = {i, i + 1, i + 2,...} b) A i = {0, i} c) A i = (0, i), that is, the set of real numbers x with 0 < x < i. d) A i = (i, ), that is, the set of real numbers x with x > i. EC Show that (A 1 A 2 ) (B 1 B 2 ) = (A 1 B 1 ) (A 2 B 2 ).

5 Discrete Structures Homework 4 Due: July 6. Section Determine whether each of these functions from Z to Z is one-to-one. a) f(n) = n 1 b) f(n) = n c) f(n) = n 3 d) f(n) = n 2 14 Determine whether f : Z Z Z is onto if (3 pt) a) f(m, n) = 2m n c) f(m, n) = m + n + 1 e) f(m, n) = m Determine whether each of these functions is a bijection from R to R. a) f(x) = 3x + 4 b) f(x) = 3x c) f(x) = x+1 x+2 d) f(x) = x EC Given a function f : X Y. Define a set F which represents f. Note. To represent the image of an element x X, you can use f(x). Hint. If you draw the function in a coordinate system, how would you define the set of points drawn? Section 2.4 (3 pt) 16 Find the solution to each of these recurrence relations with the given initial conditions. Use an iterative approach such as that used in Example 10. a) a n = a n 1, a 0 = 5 c) a n = a n 1 n, a 0 = 4 e) a n = (n + 1)a n 1, a 0 = 2 f) a n = 2na n 1, a 0 = 3 34 Compute each of these double sums. 3 2 a) (i j) b) c) d) i=1 j=1 3 i=0 j=0 3 i=1 j=0 2 2 (3i + 2j) 2 j i=0 j=0 3 i 2 j 3

6 Discrete Structures Homework 5 Due: July 13. Section Let P (n) be the statement that n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What is the statement P (1)? b) Show that P (1). c) What is the inductive hypothesis? d) What do you need to prove the inductive step e) Complete the inductive step, identifying where you use the inductive hypothesis. 6 Prove that 1 1! + 2 2! + + n n! = (n + 1)! 1 whenever n is a positive integer. 32 Prove that 3 divides n 3 + 2n whenever n is a positive integer. 40 Prove that if A 1, A 2,..., A n and B are sets, then (A 1 A 2 A n ) B = (A 1 B) (A 2 B) (A n B). Section Give a recursive definition of S m (n) = m + n, the sum of the integer m and the nonnegative integer n. 26 Give a recursive definition of (6 pt) a) the set of odd positive integers. b) the set of positive integer powers of 3. c) the set of polynomials with integer coefficients. For example: 5x 3 2x or 7x 4 8x 3 + x EC Give a recursive definition of the rational numbers Q. Use as Basis Step only 0 Q and 1 Q.

7 Discrete Structures Homework 6 Due: July 20. Section A particular brand of shirts comes in 12 colours, has a male version and a female version, and comes in three sizes for each sex. How many different types of this shirt are made. 56 The name of a variable in the C programming language is a string that contains uppercase letters, lowercase letters, digits, or underscores. Further, the first character in the sting must be a letter, either uppercase or lowercase, or an underscore. If the name of a variable is determined by its first eight characters, how many different variables can be named in C? (Note that the name of a variable my contain fewer than eight characters.) Section A bowl contains 10 red and 10 blue balls. A woman selects balls at random without locking at them. a) How many balls must she select to be sure of having at least three balls of the same color? b) How many balls must she select to be sure of having at least three blue balls? 34 Assuming that no one has more than 1,000,000 hairs on the head of any person an that the population of New York City was 8,008,278 in 2010, show there had to be at least nine people in New York City in 2010 with the same number of Hairs on their heads. Section A coin is flipped eight times where each flip comes up either heads or tails. How many possible outcomes a) are there in total? b) contain exactly 3 heads? c) contain at least 3 heads? d) contain the same number of heads and tails? 22 How many Permutations of the letters ABCDEF GH contain (6 pt) a) the string ED? b) the string CDE? c) the strings BA and F GH? d) the string AB, DE, and GH? e) the string CAB and BED? f) the string BCA and ABF?

8 Section What is the coefficient of x 8 y 9 in the expansion of (3x + 2y) 17? 12 The row of Pascal s triangle containing the binomial coefficients ( 10 k ), 0 k 10, is: Use Pascal s identity to produce the row immediately following this row in Pascal s triangle. 2

9 Discrete Structures Homework 7 Due: July 27. Section What is the probability that a card selected at random from a standard deck of 52 cards is an ace or a heart? 16 What is the probability that a five-card poker hand contains a flush, that is, five cards of the same suit? 20 What is the probability that a five-card poker hand contains a royal flush, this is, the 10, jack queen king, and ace of one suit? 24 Find the probability of winning the lottery by selecting the correct six integers, where the order in which these integers are selected does not matter, from the positive integers not exceeding a) 30. b) 36. c) 42. d) What is the probability that Bo, Colleen, Jeff, and Rohini win the first, second, third, and fourth price, respectively, in a drawing if 50 people enter a contest and a) no one can win more than one price. b) winning more than one price is allowed. Section What is the probability of these events when we randomly select a permutation of {1, 2, 3} (3 pt) a) 1 precedes 3. b) 3 precedes 1. c) 3 precedes 1 and 3 precedes What is the probability of these events when we randomly select a permutation of the 26 lowercase letters of the English alphabet? (6 pt) a) The first 13 of the permutation letters are in alphabetical order. b) a is the first letter of the permutation and z is the last letter. c) a and z are next to each other in the permutation. d) a and z are not next to each other in the permutation. e) a and z are separated by at least 23 letters in the permutation. f) z precedes both a and b in the permutation.

10 16 Show that if E and F are independent events then E and F are also independent 34 Find each of the following probabilities when n independent Bernoulli trials are carried out with probability of success p. a) the probability of no successes b) the probability of at least one success c) the probability of at most one success d) the probability of at least two successes EC Assume, you chose the answer to this question randomly. How likely is it that your answer is correct. (3 pt) a) 50 % b) 25 % c) 33 % d) 25 % Hint. Do not take this question too serious ;-) 2

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

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 information

Chapter 8 Sequences, Series, and Probability

Chapter 8 Sequences, Series, and Probability Chapter 8 Sequences, Series, and Probability Overview 8.1 Sequences and Series 8.2 Arithmetic Sequences and Partial Sums 8.3 Geometric Sequences and Partial Sums 8.5 The Binomial Theorem 8.6 Counting Principles

More information

Discrete Mathematics: Midterm Test with Answers. Professor Callahan, section (A or B): Name: NetID: 30 multiple choice, 3 points each:

Discrete Mathematics: Midterm Test with Answers. Professor Callahan, section (A or B): Name: NetID: 30 multiple choice, 3 points each: Discrete Mathematics: Midterm Test with Answers Professor Callahan, section (A or B): Name: NetID: 30 multiple choice, 3 points each: 1. If f is defined recursively by: f (0) = -2, f (1) = 1, and for n

More information

Discrete Mathematics (CS503)

Discrete Mathematics (CS503) Discrete Mathematics (CS503) Module I Suggested Questions Day 1, 2 1. Translate the following statement into propositional logic using the propositions provided: You can upgrade your operating system only

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

1.1 Language and Logic

1.1 Language and Logic c Oksana Shatalov, Fall 2017 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 information

n N CHAPTER 1 Atoms Thermodynamics Molecules Statistical Thermodynamics (S.T.)

n N CHAPTER 1 Atoms Thermodynamics Molecules Statistical Thermodynamics (S.T.) CHAPTER 1 Atoms Thermodynamics Molecules Statistical Thermodynamics (S.T.) S.T. is the key to understanding driving forces. e.g., determines if a process proceeds spontaneously. Let s start with entropy

More information

Math 230 Final Exam, Spring 2009

Math 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 information

CS0441 Discrete Structures Recitation 3. Xiang Xiao

CS0441 Discrete Structures Recitation 3. Xiang Xiao CS0441 Discrete Structures Recitation 3 Xiang Xiao Section 1.5 Q10 Let F(x, y) be the statement x can fool y, where the domain consists of all people in the world. Use quantifiers to express each of these

More information

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares

More information

CS 250/251 Discrete Structures I and II Section 005 Fall/Winter Professor York

CS 250/251 Discrete Structures I and II Section 005 Fall/Winter Professor York CS 250/251 Discrete Structures I and II Section 005 Fall/Winter 2013-2014 Professor York Practice Quiz March 10, 2014 CALCULATORS ALLOWED, SHOW ALL YOUR WORK 1. Construct the power set of the set A = {1,2,3}

More information

Math 230 Final Exam, Spring 2008

Math 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 information

STAT 516 Answers Homework 2 January 23, 2008 Solutions by Mark Daniel Ward PROBLEMS. = {(a 1, a 2,...) : a i < 6 for all i}

STAT 516 Answers Homework 2 January 23, 2008 Solutions by Mark Daniel Ward PROBLEMS. = {(a 1, a 2,...) : a i < 6 for all i} STAT 56 Answers Homework 2 January 23, 2008 Solutions by Mark Daniel Ward PROBLEMS 2. We note that E n consists of rolls that end in 6, namely, experiments of the form (a, a 2,...,a n, 6 for n and a i

More information

1.1 Language and Logic

1.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 information

CSE 20. Final Review. CSE 20: Final Review

CSE 20. Final Review. CSE 20: Final Review CSE 20 Final Review Final Review Representation of integers in base b Logic Proof systems: Direct Proof Proof by contradiction Contraposetive Sets Theory Functions Induction Final Review Representation

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.

(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 information

Exam Practice Problems

Exam Practice Problems Math 231 Exam Practice Problems 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 topics.

More information

LOGIC CONNECTIVES. Students who have an ACT score of at least 30 OR a GPA of at least 3.5 can receive a college scholarship.

LOGIC CONNECTIVES. Students who have an ACT score of at least 30 OR a GPA of at least 3.5 can receive a college scholarship. LOGIC In mathematical and everyday English language, we frequently use logic to express our thoughts verbally and in writing. We also use logic in numerous other areas such as computer coding, probability,

More information

Section 1.1 Propositions

Section 1.1 Propositions Set Theory & Logic Section 1.1 Propositions Fall, 2009 Section 1.1 Propositions In Chapter 1, our main goals are to prove sentences about numbers, equations or functions and to write the proofs. Definition.

More information

{ 0! = 1 n! = n(n 1)!, n 1. n! =

{ 0! = 1 n! = n(n 1)!, n 1. n! = Summations Question? What is the sum of the first 100 positive integers? Counting Question? In how many ways may the first three horses in a 10 horse race finish? Multiplication Principle: If an event

More information

Name: Exam 2 Solutions. March 13, 2017

Name: Exam 2 Solutions. March 13, 2017 Department of Mathematics University of Notre Dame Math 00 Finite Math Spring 07 Name: Instructors: Conant/Galvin Exam Solutions March, 07 This exam is in two parts on pages and contains problems worth

More information

4. Suppose that we roll two die and let X be equal to the maximum of the two rolls. Find P (X {1, 3, 5}) and draw the PMF for X.

4. Suppose that we roll two die and let X be equal to the maximum of the two rolls. Find P (X {1, 3, 5}) and draw the PMF for X. Math 10B with Professor Stankova Worksheet, Midterm #2; Wednesday, 3/21/2018 GSI name: Roy Zhao 1 Problems 1.1 Bayes Theorem 1. Suppose a test is 99% accurate and 1% of people have a disease. What is the

More information

Discrete Mathematics Exam File Spring Exam #1

Discrete Mathematics Exam File Spring Exam #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

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

Computations - Show all your work. (30 pts)

Computations - Show all your work. (30 pts) Math 1012 Final Name: Computations - Show all your work. (30 pts) 1. Fractions. a. 1 7 + 1 5 b. 12 5 5 9 c. 6 8 2 16 d. 1 6 + 2 5 + 3 4 2.a Powers of ten. i. 10 3 10 2 ii. 10 2 10 6 iii. 10 0 iv. (10 5

More information

MATH MW Elementary Probability Course Notes Part I: Models and Counting

MATH MW Elementary Probability Course Notes Part I: Models and Counting MATH 2030 3.00MW Elementary Probability Course Notes Part I: Models and Counting Tom Salisbury salt@yorku.ca York University Winter 2010 Introduction [Jan 5] Probability: the mathematics used for Statistics

More information

Steinhardt 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. 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 information

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1) Week 1: Logic Lecture 1, 8/1 (Sections 1.1 and 1.3) Examples of theorems and proofs Theorem (Pythagoras). Let ABC be a right triangle, with legs of lengths a and b, and hypotenuse of length c. Then a +

More information

Propositional Logic Not Enough

Propositional Logic Not Enough Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks

More information

4/17/2012. NE ( ) # of ways an event can happen NS ( ) # of events in the sample space

4/17/2012. NE ( ) # of ways an event can happen NS ( ) # of events in the sample space I. Vocabulary: A. Outcomes: the things that can happen in a probability experiment B. Sample Space (S): all possible outcomes C. Event (E): one outcome D. Probability of an Event (P(E)): the likelihood

More information

CMSC 250 Spring 2016: Final Exam Review Questions Key

CMSC 250 Spring 2016: Final Exam Review Questions Key CMSC 250 Spring 2016: Final Exam Review Questions Key 1 Description and disclaimer Use these questions to help review for the upcoming final exam. Note, these questions are not necessarily representative

More information

CSC 125 :: Final Exam December 14, 2011

CSC 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 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

2. Polynomials. 19 points. 3/3/3/3/3/4 Clearly indicate your correctly formatted answer: this is what is to be graded. No need to justify!

2. Polynomials. 19 points. 3/3/3/3/3/4 Clearly indicate your correctly formatted answer: this is what is to be graded. No need to justify! 1. Short Modular Arithmetic/RSA. 16 points: 3/3/3/3/4 For each question, please answer in the correct format. When an expression is asked for, it may simply be a number, or an expression involving variables

More information

UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis

UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis Lecture 6 Class URL: http://vlsicad.ucsd.edu/courses/cse21-s14/ Lecture 6 Notes Goals: CL Sections 3, 4; FN Section

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

Lecture 4: Counting, Pigeonhole Principle, Permutations, Combinations Lecturer: Lale Özkahya

Lecture 4: Counting, Pigeonhole Principle, Permutations, Combinations Lecturer: Lale Özkahya BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 4: Counting, Pigeonhole Principle, Permutations, Combinations Lecturer: Lale Özkahya Resources: Kenneth

More information

Probability, For the Enthusiastic Beginner (Exercises, Version 1, September 2016) David Morin,

Probability, For the Enthusiastic Beginner (Exercises, Version 1, September 2016) David Morin, Chapter 8 Exercises Probability, For the Enthusiastic Beginner (Exercises, Version 1, September 2016) David Morin, morin@physics.harvard.edu 8.1 Chapter 1 Section 1.2: Permutations 1. Assigning seats *

More information

Discrete Structures CRN Test 3 Version 1 CMSC 2123 Autumn 2013

Discrete 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 information

Probability and Statistics Notes

Probability and Statistics Notes Probability and Statistics Notes Chapter One Jesse Crawford Department of Mathematics Tarleton State University (Tarleton State University) Chapter One Notes 1 / 71 Outline 1 A Sketch of Probability and

More information

DISCRETE MATHEMATICS BA202

DISCRETE 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 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

Discrete Mathematical Structures: Theory and Applications

Discrete 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 information

REVIEW QUESTIONS. Chapter 1: Foundations: Sets, Logic, and Algorithms

REVIEW QUESTIONS. Chapter 1: Foundations: Sets, Logic, and Algorithms REVIEW QUESTIONS Chapter 1: Foundations: Sets, Logic, and Algorithms 1. Why can t a Venn diagram be used to prove a statement about sets? 2. Suppose S is a set with n elements. Explain why the power set

More information

Ciphering MU ALPHA THETA STATE 2008 ROUND

Ciphering MU ALPHA THETA STATE 2008 ROUND Ciphering MU ALPHA THETA STATE 2008 ROUND SCHOOL NAME ID CODE Circle one of the following Mu Alpha Theta Euclidean Round 1 What is the distance between the points (1, -6) and (5, -3)? Simplify: 5 + 5 5

More information

CSC 125 :: Final Exam May 3 & 5, 2010

CSC 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 information

PRECALCULUS SEM. 1 REVIEW ( ) (additional copies available online!) Use the given functions to find solutions to problems 1 6.

PRECALCULUS SEM. 1 REVIEW ( ) (additional copies available online!) Use the given functions to find solutions to problems 1 6. PRECALCULUS SEM. 1 REVIEW (2011 2012) (additional copies available online!) Name: Period: Unit 1: Functions *** No Calculators!!**** Use the given functions to find solutions to problems 1 6. f (x) = x

More information

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1) CS100: DISCREE SRUCURES Lecture 5: Logic (Ch1) Lecture Overview 2 Statement Logical Connectives Conjunction Disjunction Propositions Conditional Bio-conditional Converse Inverse Contrapositive Laws of

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

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

Combinatorics. But there are some standard techniques. That s what we ll be studying.

Combinatorics. But there are some standard techniques. That s what we ll be studying. Combinatorics Problem: How to count without counting. How do you figure out how many things there are with a certain property without actually enumerating all of them. Sometimes this requires a lot of

More information

MATH 114 Fall 2004 Solutions to practice problems for Final Exam

MATH 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 information

Contents. Counting Methods and Induction

Contents. Counting Methods and Induction Contents Counting Methods and Induction Lesson 1 Counting Strategies Investigations 1 Careful Counting... 555 Order and Repetition I... 56 3 Order and Repetition II... 569 On Your Own... 573 Lesson Counting

More information

With Question/Answer Animations. Chapter 7

With Question/Answer Animations. Chapter 7 With Question/Answer Animations Chapter 7 Chapter Summary Introduction to Discrete Probability Probability Theory Bayes Theorem Section 7.1 Section Summary Finite Probability Probabilities of Complements

More information

MATH STUDENT BOOK. 12th Grade Unit 9

MATH STUDENT BOOK. 12th Grade Unit 9 MATH STUDENT BOOK 12th Grade Unit 9 Unit 9 COUNTING PRINCIPLES MATH 1209 COUNTING PRINCIPLES INTRODUCTION 1. PROBABILITY DEFINITIONS, SAMPLE SPACES, AND PROBABILITY ADDITION OF PROBABILITIES 11 MULTIPLICATION

More information

1. Solve the following system of equations. 5x + y = 2z 13 3x + 3z = y 4y 2z = 2x + 12

1. Solve the following system of equations. 5x + y = 2z 13 3x + 3z = y 4y 2z = 2x + 12 Math 166 Final Exam Review Note: This review does not cover every concept that could be tested on a final. Please also take a look at previous Week in Reviews for more practice problems. Every instructor

More information

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Foundations 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 information

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

WUCT121. 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 information

STRATEGIES OF PROBLEM SOLVING

STRATEGIES OF PROBLEM SOLVING STRATEGIES OF PROBLEM SOLVING Second Edition Maria Nogin Department of Mathematics College of Science and Mathematics California State University, Fresno 2014 2 Chapter 1 Introduction Solving mathematical

More information

Counting Methods. CSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo

Counting Methods. CSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo Counting Methods CSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo c Xin He (University at Buffalo) CSE 191 Discrete Structures 1 / 48 Need for Counting The problem of counting

More information

Logic. Facts (with proofs) CHAPTER 1. Definitions

Logic. 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 information

Math 3336: Discrete Mathematics Practice Problems for Exam I

Math 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 information

Propositional Logic, Predicates, and Equivalence

Propositional Logic, Predicates, and Equivalence Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If

More information

MA Discrete Mathematics

MA Discrete Mathematics MA2265 - Discrete Mathematics UNIT I 1. Check the validity of the following argument. If the band could not play rock music or the refreshments were not delivered on time, then the New year s party would

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

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Lecture 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 information

Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting

Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 39 Chapter Summary The Basics

More information

Definition: Let S and T be sets. A binary relation on SxT is any subset of SxT. A binary relation on S is any subset of SxS.

Definition: Let S and T be sets. A binary relation on SxT is any subset of SxT. A binary relation on S is any subset of SxS. 4 Functions Before studying functions we will first quickly define a more general idea, namely the notion of a relation. A function turns out to be a special type of relation. Definition: Let S and T be

More information

Solutions to Exercises (Sections )

Solutions to Exercises (Sections ) s to Exercises (Sections 1.1-1.10) Section 1.1 Exercise 1.1.1: Identifying propositions (a) Have a nice day. : Command, not a proposition. (b) The soup is cold. : Proposition. Negation: The soup is not

More information

Section Summary. Section 1.5 9/9/2014

Section Summary. Section 1.5 9/9/2014 Section 1.5 Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements into Statements involving Nested Quantifiers Translated

More information

First Midterm Examination

First Midterm Examination 2015-2016 Spring Semester First Midterm Examination 1) How many numbers in the set {1000, 1001, 1002,..., 9999} have sum of digits equal to 17? 2) Let n Z +. Find the negation, converse and contrapositive

More information

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

University of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura. February 9, :30 pm Duration: 1:50 hs. Closed book, no calculators University of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura February 9, 2010 11:30 pm Duration: 1:50 hs Closed book, no calculators Last name: First name: Student number: There are 5 questions and

More information

Department 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) 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 information

MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG

MATH 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 information

IVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS. 1. Combinatorics

IVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS. 1. Combinatorics IVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS Combinatorics Go over combinatorics examples in the text Review all the combinatorics problems from homewor Do at least a couple of extra

More information

Axioms of Probability

Axioms of Probability Sample Space (denoted by S) The set of all possible outcomes of a random experiment is called the Sample Space of the experiment, and is denoted by S. Example 1.10 If the experiment consists of tossing

More information

At least one of us is a knave. What are A and B?

At 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 information

Module 1. Probability

Module 1. Probability Module 1 Probability 1. Introduction In our daily life we come across many processes whose nature cannot be predicted in advance. Such processes are referred to as random processes. The only way to derive

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

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

Finite and Infinite Sets

Finite and Infinite Sets Chapter 9 Finite and Infinite Sets 9. Finite Sets Preview Activity (Equivalent Sets, Part ). Let A and B be sets and let f be a function from A to B..f W A! B/. Carefully complete each of the following

More information

Math is Cool Championships

Math is Cool Championships Individual Contest Express all answers as reduced fractions unless stated otherwise. Leave answers in terms of π where applicable. Do not round any answers unless stated otherwise. Record all answers on

More information

EECS 1028 M: Discrete Mathematics for Engineers

EECS 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 / 26 Why Study Logic?

More information

Math 210 Exam 2 - Practice Problems. 1. For each of the following, determine whether the statement is True or False.

Math 210 Exam 2 - Practice Problems. 1. For each of the following, determine whether the statement is True or False. Math 20 Exam 2 - Practice Problems. For each of the following, determine whether the statement is True or False. (a) {a,b,c,d} TRE (b) {a,b,c,d} FLSE (c) {a,b, } TRE (d) {a,b, } TRE (e) {a,b} {a,b} FLSE

More information

Intermediate Math Circles November 8, 2017 Probability II

Intermediate Math Circles November 8, 2017 Probability II Intersection of Events and Independence Consider two groups of pairs of events Intermediate Math Circles November 8, 017 Probability II Group 1 (Dependent Events) A = {a sales associate has training} B

More information

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations Logic Propositions and logical operations Main concepts: propositions truth values propositional variables logical operations 1 Propositions and logical operations A proposition is the most basic element

More information

Organization Team Team ID#

Organization Team Team ID# 1. [4] A random number generator will always output 7. Sam uses this random number generator once. What is the expected value of the output? 2. [4] Let A, B, C, D, E, F be 6 points on a circle in that

More information

Math 205 April 28, 2009 Final Exam Review

Math 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 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

Lecture 11: Measuring the Complexity of Proofs

Lecture 11: Measuring the Complexity of Proofs IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 11: Measuring the Complexity of Proofs David Mix Barrington and Alexis Maciel July

More information

Logic and Propositional Calculus

Logic and Propositional Calculus CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know

More information

CMSC Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005

CMSC Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005 CMSC-37110 Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005 Instructor: László Babai Ryerson 164 e-mail: laci@cs This exam contributes 20% to your course grade.

More information

Logic and Propositional Calculus

Logic and Propositional Calculus CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know

More information

DISCRETE MATH: FINAL REVIEW

DISCRETE 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 information

1.5 MATHEMATICAL LANGUAGE

1.5 MATHEMATICAL LANGUAGE 1.5 MATHEMATICAL LANGUAGE Contemporary Calculus The calculus concepts we will explore in this book are simple and powerful, but sometimes subtle. To succeed in calculus you will have to master some techniques,

More information

Name (please print) Mathematics Final Examination December 14, 2005 I. (4)

Name (please print) Mathematics Final Examination December 14, 2005 I. (4) Mathematics 513-00 Final Examination December 14, 005 I Use a direct argument to prove the following implication: The product of two odd integers is odd Let m and n be two odd integers Since they are odd,

More information

Predicates and Quantifiers. CS 231 Dianna Xu

Predicates and Quantifiers. CS 231 Dianna Xu Predicates and Quantifiers CS 231 Dianna Xu 1 Predicates Consider P(x) = x < 5 P(x) has no truth values (x is not given a value) P(1) is true 1< 5 is true P(10) is false 10 < 5 is false Thus, P(x) will

More information

About This Document. MTH299 - Examples Weeks 1-6; updated on January 5, 2018

About 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

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

NORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S. B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION NORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION 011-1 DISCRETE MATHEMATICS (EOE 038) 1. UNIT I (SET, RELATION,

More information

MTH 299 In Class and Recitation Problems SUMMER 2016

MTH 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 information