Solution: It may be helpful to list out exactly what is in each of these events:

Similar documents
11 Sets II Operations

1.1 - Introduction to Sets

Compliments and Disjoint Events

Section Sets and Set Operations

Review of Sets. Review. Philippe B. Laval. Current Semester. Kennesaw State University. Philippe B. Laval (KSU) Sets Current Semester 1 / 16

Sets MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Sets Fall / 31

2.2 Set Operations. Introduction DEFINITION 1. EXAMPLE 1 The union of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 2, 3, 5}; that is, EXAMPLE 2

2 Review of Set Theory

The Probabilistic Method

SETS. Sets are of two sorts: finite infinite A system of sets is a set, whose elements are again sets.

1 Sets, Fields, and Events

Chapter 3. Set Theory. 3.1 What is a Set?

Introduction II. Sets. Terminology III. Definition. Definition. Definition. Example

Set and Set Operations

What is Set? Set Theory. Notation. Venn Diagram

9.5 Equivalence Relations

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets

Objectives/Outcomes. Introduction: If we have a set "collection" of fruits : Banana, Apple and Grapes.

Math Exam 2 Solutions. Problem 1 (8 points) Problem 2 (8 points) Problem 3 (12 points) Problem 4 (26 points) Problem 5 (14 points)

Discrete Mathematics Course Review 3

CSC Discrete Math I, Spring Sets

Math 110 FOUNDATIONS OF THE REAL NUMBER SYSTEM FOR ELEMENTARY AND MIDDLE SCHOOL TEACHERS

Math Week in Review #5

1.2 Venn Diagrams and Partitions

2.1 Symbols and Terminology

Skip Lists S 3 S 2 S 1. Skip Lists Goodrich, Tamassia

Algebra of Sets (Mathematics & Logic A)

2. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Fall

Chapter 2: Sets. Diana Pell. In the roster method: elements are listed between braces, with commas between the elements

COMP Logic for Computer Scientists. Lecture 17

12/2/2016. Error Detection May Not Be Enough. ECE 120: Introduction to Computing. Can We Use Redundancy to Correct Errors?

Topology notes. Basic Definitions and Properties.

LESSON 1: INTRODUCTION TO COUNTING

Discrete Mathematics and Probability Theory Fall 2013 Midterm #2

Lecture 7. SchemeList, finish up; Universal Hashing introduction

1. (10 points) Draw the state diagram of the DFA that recognizes the language over Σ = {0, 1}

Introduction. Sets and the Real Number System

Combinatorics: The Fine Art of Counting

COMP 352 FALL Tutorial 10

LECTURE 8: SETS. Software Engineering Mike Wooldridge

Math Week in Review #5. A proposition, or statement, is a declarative sentence that can be classified as either true or false, but not both.

Cardinality of Sets. Washington University Math Circle 10/30/2016

The clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) We will be interested in s.t. ( )~1. To gain some intuition note ( )

The clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) 2 ( ) ( )

UNC Charlotte 2010 Comprehensive

Section 6.3: Further Rules for Counting Sets

3. Probability 51. probability A numerical value between 0 and 1 assigned to an event to indicate how often the event occurs (in the long run).

GRAPH THEORY: AN INTRODUCTION

Problem One: A Quick Algebra Review

Math 202 Test Problem Solving, Sets, and Whole Numbers 19 September, 2008

CS220/MATH320 Applied Discrete Mathematics Instructor: Marc Pomplun Practice Exam. Sample Solutions

Today s Topics. What is a set?

Lecture 15: The subspace topology, Closed sets

Topology I Test 1 Solutions October 13, 2008

Topology 550A Homework 3, Week 3 (Corrections: February 22, 2012)

CS195H Homework 5. Due:March 12th, 2015

CS100: DISCRETE STRUCTURES

Johns Hopkins Math Tournament Proof Round: Point Set Topology

Intersection of sets *

Combinatorics: The Fine Art of Counting

Graph Contraction. Graph Contraction CSE341T/CSE549T 10/20/2014. Lecture 14

Lattice Polygon s and Pick s Theorem From Dana Paquin and Tom Davis 1 Warm-Up to Ponder

SET DEFINITION 1 elements members

Sets 1. The things in a set are called the elements of it. If x is an element of the set S, we say

A graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.

Outline. CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 1 Sets. Sets. Enumerating the elements of a set

Mathematics for Computer Science Exercises from Week 4

SEVENTH EDITION and EXPANDED SEVENTH EDITION

Topology Homework 3. Section Section 3.3. Samuel Otten

CSE 21 Math for Algorithms and Systems Analysis. Lecture 14 Review of Random Variables

Lecture : Topological Space

Algebra of Sets. Aditya Ghosh. April 6, 2018 It is recommended that while reading it, sit with a pen and a paper.

The set consisting of all natural numbers that are in A and are in B is the set f1; 3; 5g;

MATHEMATICS 191, FALL 2004 MATHEMATICAL PROBABILITY Outline #1 (Countability and Uncountability)

Comparing sizes of sets

5 Graphs

Hillel Academy. Grade 9 Mathematics End of Year Study Guide September June 2013

2.1 Sets 2.2 Set Operations

Sets. X. Zhang Dept. of Computer & Information Sciences Fordham University

Counting: Basics. Rosen, Chapter 6.1

Math-2. Lesson 3-1. Equations of Lines

Recognizing a Function

Basic Counting Principles: The Product Rule

5-Minute Check Solve.

Lecture 20 : Trees DRAFT

Fundamental Mathematical Concepts Math 107A. Professor T. D. Hamilton

Algorithm. Algorithm Analysis. Algorithm. Algorithm. Analyzing Sorting Algorithms (Insertion Sort) Analyzing Algorithms 8/31/2017

c) the set of students at your school who either are sophomores or are taking discrete mathematics

UNC Charlotte 2010 Comprehensive

A Reduction of Conway s Thrackle Conjecture

1KOd17RMoURxjn2 CSE 20 DISCRETE MATH Fall

Paths, Circuits, and Connected Graphs

MAT 090 Brian Killough s Instructor Notes Strayer University

Homework Set #2 Math 440 Topology Topology by J. Munkres

CAP 5993/CAP 4993 Game Theory. Instructor: Sam Ganzfried

1 Counting triangles and cliques

The Language of Sets and Functions

1-1 Sets of Numbers. Warm Up Lesson Presentation Lesson Quiz. Holt Algebra 2

Discrete Math: Selected Homework Problems

MATH 2100 / 2105 / 2350 EXAM 1

Transcription:

MATH 5010(002) Fall 2017 Homework 1 Solutions Please inform your instructor if you find any errors in the solutions. 1. You ask a friend to choose an integer N between 0 and 9. Let A = {N 5}, B = {3 N 7} and C = {N is even and > 0}. List the points that belong to the following events: a A B C. b A (B C c ). c (A B) C c. d (A B) ((A C) c ). It may be helpful to list out exactly what is in each of these events: A = {0, 1, 2, 3, 4, 5} B = {3, 4, 5, 6, 7} C = {2, 4, 6, 8}. a A B = {0, 1, 2, 3, 4, 5} {3, 4, 5, 6, 7} = {3, 4, 5}. Then A B C = {3, 4, 5} {2, 4, 6, 8} = {4}. b C c = {0, 1, 3, 5, 7, 9}, so B C c = {3, 4, 5, 6, 7} {0, 1, 3, 5, 7, 9} = {3, 5, 7}. Then A (B C c ) = {0, 1, 2, 3, 4, 5} {3, 5, 7} = {0, 1, 2, 3, 4, 5, 7}. c (A B) = {0, 1, 2, 3, 4, 5} {3, 4, 5, 6, 7} = {0, 1, 2, 3, 4, 5, 6, 7}. C c = {0, 1, 3, 5, 7, 9}, so (A B) C c = {0, 1, 3, 5, 7}. d A C = {0, 1, 2, 3, 4, 5} {2, 4, 6, 8} = {0, 1, 2, 3, 4, 5, 6, 8}, so (A C) c = {7, 9}. A B = {0, 1, 2, 3, 4, 5} {3, 4, 5, 6, 7} = {3, 4, 5}, which is disjoint from {7, 9}. We conclude that (A B) ((A C) c ) =. We could also do this part of the problem more easily without going through all of this. Notice that A B A and (A C) c = A c C c, so (A C) c A =. 2. Let A, B, and C be arbitrary events in a sample space Ω. Express each of the following events in terms of A, B, and C using intersections, unions, and complements. a A and B occur, but not C; b A is the only one to occur; c at least two of the events A, B, C occur; d at least one of the events A, B, C occurs; e exactly two of the events A, B, C occur; f exactly one of the events A, B, C occurs; g not more than one of the events A, B, C occur.

a A B C c. b A B c C c. c (A B) (B C) (A C). This is also the same as (A B C) (A B C c ) (A B c C) (A c B C c ). d A B C. As above, you could also enumerate all the possibilities here, but it would be messier. f (A B c C c ) (A c B C c ) (A c B c C). g (A B c C c ) (A c B C c ) (A c B c C) (A c B c C c ). 3. Two sets are disjoint if their intersection is empty. If A and B are disjoint events in a sample space Ω, are A c and B c disjoint? Are A C and B C disjoint? What about A C and B C? a Take the example of Ω = {1, 2, 3} and let A = {1} and B = {3}. Then A c = {2, 3} and B c = {1, 2}, so A c and B c are not disjoint. b If A and B are disjoint, then (A C) (B C) = A B C = C =. c In the same setting as above, let C = {2}, so (A C) (B C) = {2} = C. 4. An urn contains three chips: one black, one green, and one red. We draw one chip at random. Give a sample space Ω and a collection of events F for this experiment. We will denote the event that the chip is black by B, the event that it is green by G, and the event that it is red by R. We can then choose Ω = {B, G, R} F = {, B, G, R, {B, G}, {B, R}, {G, R}, {B, G, R}}. This choice of F is the usual one in the setting where we only have finitely many possible outcomes: it is the collection of all subsets of Ω. 5. A public opinion poll (fictional) consists of the following three questions: (1) Are you a registered Democrat? (2) Do you approve of President Obama s performance in office? (3) Do you favor the Health Care Bill? A group of 1000 people is polled. Answers to the questions are either yes or no. It is found that 550 people answer yes to the third question and 450 answer no. 325 people answer yes exactly twice (i.e. their answers contain 2 yeses and one no). 100 people answer yes to all three questions. 125 registered Democrats approve of Obama s performance. How many of those who favor the Health Care Bill do not approve of Obama s performance and in addition are not registered Democrats? (Hint: use a Venn diagram.)

A B C A B C c B A c B C A C A B c C Let A denote the set of people who voted yes on question one, B denote the set of people who voted yes on question two, and C denote the set of people who voted yes on question 3. We will denote the size of a set with bars, so for example when the question tells us that 550 people answer yes to the third question and 450 answer no, this becomes C = 550 and C c = 450. With this notation, we can now translate rest of the paragraph: (a) 325 people answer yes exactly twice means that (A B C c ) (A B c C) (A c B C) = 325 (b) 100 people answer yes to all three questions means that A B C = 100 (c) 125 registered Democrats approve of Obama s performance means that A B = 125. Notice that A B = (A B C) (A B C c ). (d) The question in the problem, How many of those who favor the Health Care Bill do not approve of Obama s performance and in addition are not registered Democrats?, is asking us to compute what A c B c C is equal to. At this point, we should try to fill out as many of the sizes of these sets as we can. For example, we know that 125 = A B = A B C + A B C c = 100 + A B C c and therefore A B C c = 25. With this, we then know that 325 = A B C c + A B c C + A c B C = 25 + A B c C + A c B C so we conclude that A B c C + A c B C = 300. But now, we know that C = 550 and that 550 = C = A c B c C + A c B C + A B c C + A B C, = A c B c C + 300 + 100

and therefore A c B c C = 150. 6. We toss a coin twice. We consider three steps in this experiment. 1. before the first toss; 2. after the first toss but before the second toss; 3. after the two tosses. a Give a sample space Ω for this experiment. b Give the collection F 3 of observable events at step 3. c Give the collection F 2 of observable events at step 2. d Give the collection F 1 of observable events at step 1. a Ω = {(H 1, H 2 ), (H 1, T 2 ), (T 1, H 2 ), (T 1, T 2 )}. Notationally, (H 1, H 2 ) means heads on the first flip, heads on the second and similarly for the rest. b At step 3, we have seen the result of the experiment, so F 3 is the set of all subsets of Ω, which is the usual choice of F that we deal with. c At step 2, we have only observed the first toss. This means that the information in the second toss is not yet available, so we cannot distinguish for example between (H 1, H 2 ) and (H 1, T 2 ). This is because they only differ in the result of the second coin flip, which we have not yet observed. Once we know whether the first flip is heads or not, we also know whether it is tails or not. We see from this that F 2 is the F that is generated by the event {(H 1, H 2 ), (H 1, T 2 )}: F 2 = {, {(H 1, H 2 ), (H 1, T 2 )}, {(T 1, H 2 ), (T 1, T 2 )}, {(H 1, H 2 ), (H 1, T 2 ), (T 1, H 2 ), (T 1, T 2 )}}. d At step one, nothing has happened yet so the only information available to us is that something will happen once we run the experiment. This corresponds to the choice F 1 = {, {(H 1, H 2 ), (H 1, T 2 ), (T 1, H 2 ), (T 1, T 2 )}} 7. A fair die is rolled 5 times and the sequence of scores recorded. a How many outcomes are there? b Find the probability that the first and last rolls are 6. a In each roll, there are 6 possibilities, so there are 6 5 possible distinct combinations b There are 6 3 possible sequences of scores which begin and end with 6 (this is the number of ways of choosing the remaining 3 rolls). Therefore the probability is 6 3 /6 5 = 1/36. 8. An urn contains 3 red, 8 yellow, and 13 green balls; another urn contains 5 red, 7 yellow, and 6 green balls. We pick one ball from each urn at random. Find the probability that both balls are of the same color.

There are 3 5 ways to pick two red balls, 8 7 ways to pick two yellow balls and 13 6 ways to pick two green balls. In total, this means that there are 149 ways to pick two balls of the same color. In total, there are (3 + 8 + 13) (5 + 7 + 6) = 432 ways to pick two balls from these two urns. Therefore the probability is 149/432.