Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 42 views

    SM 316 - Spring 2019 Homework 1 Solutions

    Uploaded by

    Nurlaila Dalidig
    1. The document contains solutions to homework problems involving probability concepts like sample spaces, events, and combinations/permutations. 2. Problem 2.1 defines sample spaces for different scenarios like rolling dice, coin tosses, and sets of numbers/continents. 3. Later problems involve finding the number of elements/outcomes for events like the intersection or union of other events, and counting arrangements of people in lines or on committees.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    SM 316 - Spring 2019 Homework 1 Solutions

    Uploaded by

    Nurlaila Dalidig
    42 views6 pages
    1. The document contains solutions to homework problems involving probability concepts like sample spaces, events, and combinations/permutations. 2. Problem 2.1 defines sample spaces for different scenarios like rolling dice, coin tosses, and sets of numbers/continents. 3. Later problems involve finding the number of elements/outcomes for events like the intersection or union of other events, and counting arrangements of people in lines or on committees.

    Original Title

    SM316_HW1_Solns

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1. The document contains solutions to homework problems involving probability concepts like sample spaces, events, and combinations/permutations. 2. Problem 2.1 defines sample spaces for different scenarios like rolling dice, coin tosses, and sets of numbers/continents. 3. Later problems involve finding the number of elements/outcomes for events like the intersection or union of other events, and counting arrangements of people in lines or on committees.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    42 views6 pages

    SM 316 - Spring 2019 Homework 1 Solutions

    Uploaded by

    Nurlaila Dalidig
    1. The document contains solutions to homework problems involving probability concepts like sample spaces, events, and combinations/permutations. 2. Problem 2.1 defines sample spaces for different scenarios like rolling dice, coin tosses, and sets of numbers/continents. 3. Later problems involve finding the number of elements/outcomes for events like the intersection or union of other events, and counting arrangements of people in lines or on committees.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 6

    SM 316 – Spring 2019

    Homework 1 Solutions

    Due: Wednesday 16 JAN 2019

    Please read the instructions/suggestions on the course webpage.

    Hand in the following problems:


    1. From the text book, 2.1, 2.4, 2.8, 2.17, 2.22, 2.30, 2.32, 2.36.
    2.1 Solution: List the elements of each of the following sample spaces:
    a) the set of integers between 1 and 50 divisible by 8.
    Using set notation, the sample space is

    S = {x|x ∈ N, 1 ≤ n ≤ 50, x/8 ∈ N} = {8, 16, 24, 32, 40, 48}.

    b) the set S = {x|x2 + 4x − 5 = 0} Solving x2 + 4x − 5 = 0 via factoring yields x = −5 and


    x = 1. Thus,
    S = {−5, 1}.

    c) the set of outcomes when a coin is tossed until a tail or three heads appear;
    For this problem, it is best to write out all the possibilities

    S = {T, HT, HHT, HHH}.

    d) the set S = {x|x is a continent}


    Using Google as a geography refresher,

    S = {Africa, Antartica, Australia, Asia, Europe, North America, South America}

    e) the set S = {x|2x − 4 ≥ 0 and x < 1}


    Note that 2x − 4 ≥ 0 implies that x ≥ 2. Thus there are no x that satisfy both inequalites and

    S = ∅.

    2.4 Solution: An experiment involves tossing a pair of dice, one green and one red, and
    recording the numbers that come up. If x equals the outcome on the green die and y the
    outcome on the red die, describe the sample space S.
    Listing out the different outcomes in (x, y) we have

    S = {(1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (2, 1), (2, 2), (2, 3), (2, 4), (2, 5), (2, 6), ...}

    giving 36 outcomes. Using the rule method, we have

    Number of outcomes = (6 outcomes for green die) · (6 outcomes for red die) = 36.

    2.8 Solution: For the sample space of Exercise 2.4


    a) list the elements corresponding to the event A that the sum is greater than 8;
    We list the events that have a sum greater than 8

    A = {(6, 3), (6, 4), (6, 5), (6, 6), (3, 6), (4, 6), (5, 6)}.

    b) list the elements corresponding to the event B that a 2 occurs on either die;
    We list the events that have a 2 occurs on either die

    B = {(2, 1), (2, 2), (2, 3), (2, 4), (2, 5), (2, 6), (1, 2), (3, 2), (4, 2), (5, 2), (6, 2)}

    c) list the elements corresponding to the event C that a number greater than 4 comes up on
    the green die;
    We list the events that have x greater than 4

    C = {(5, 1), (5, 2), (5, 3), (5, 4), (5, 5), (5, 6), (6, 1), (6, 2), (6, 3), (6, 4), (6, 5), (6, 6)}.

    d) list the elements corresponding to the event A ∩ C;


    The events common to both A and C are

    A ∩ C = {(5, 6), (6, 3), (6, 4), (6, 5), (6, 6)}.

    e) list the elements corresponding to the event A ∩ B;


    The events common to both A and B are

    A∩B =∅

    f) list the elements corresponding to the event B ∩ C;


    The events common to both B and C are

    B ∩ C = {(5, 2), (6, 2)}.


    g) construct a Venn diagram to illustrate the intersections and unions of the events A, B, and
    C.
    The figure below shows the Venn diagram. Note that A ∩ B = ∅, but B ∩ C and A ∩ C are
    non-empty.

    2.17 Solution: Let A, B, and C be events relative to the sample space S. Using Venn
    diagrams, shade the areas representing the following events:
    The sample space S and events A, B, and C are drawn in the figure below, possibly all
    overlapping.
    a) First we draw A ∩ B, then identify (A ∩ B)0 .

    b) First we draw A ∪ B, then identify (A ∪ B)0 .


    c) For this, we fill in both A ∩ C and B.

    2.22 Solution: In a medical study, patients are classified in 8 ways according to whether
    they have blood type AB+, AB-, A+, A-, B+, B-, O+, or O-, and also according to whether
    their blood pressure is low, normal, or high. Find the number of ways in which a patient can
    be classified.
    Note there are 8 ways to classify blood type and 3 ways in which each blood type can have blood
    pressure. So the total number of ways is

    Total Number of ways = (number of blood types) · (number of pressures) = (8) · (3) = 24.

    2.30 Solution: In how many different ways can a true-false test consisting of 9 questions be
    answered?
    In this problem we label questions 1,2,3,... as Q1, Q2, ..., Q9. There are two choices for each
    (T/F), thus the total number of ways are

    Total Number of ways = (# of answer for Q1)·(# of answer for Q2) · · · (# of answer for Q9) = 29 .

    2.32 Solution: a) In how many ways can 6 people be lined up to get on a bus?
    The 6 people are distinct and thus order matters. So the number of ways is a permutation of
    the full set of 6
    Total Number of ways = 6 · 5 · 4 · 3 · 2 · 1 = 6!.

    b) If 3 specific persons, among 6, insist on following each other, how many ways are possible?
    To answer this question, we consider the 3 specific people following each other to be essentially
    1 person (because the order between the three can not change). Thus the total number of ways
    is the permutation of the set of 4 {person 1, person 2, person 3, persons 456},

    Total Number of ways = 4 · 3 · 2 · 1 = 4!.

    c) If 2 specific persons, among 6, refuse to follow each other, how many ways are possible?
    To do this one, we consider the number of ways that the 2 specific persons are sitting next to
    each other. Let those persons be persons 5 and 6. Much like the previous one, we have the
    set {person 1, person 2, person 3, person 4, persons 56}. Note that persons 5 and 6 can sit
    56 or 65. Thus we must multiply by 2. Thus the number of ways is

    # of ways 56 are sitting next to each other = 2 · 5!.

    Then we take the total number of ways that the six can be arranged and subtract the above.
    In other words

    # of ways 56 are not sitting next to each other = Total # of ways−# of ways 56 are sitting next to each

    = 6 · 5! − 2 · 5! = 4 · 5!.

    2.36 Solution: a) How many three-digit numbers can be formed from the digits 0, 1, 2, 3,
    4, 5, and 6 if each digit can be used only once?
    We set this up as digits.

    3 digit number = (hundredth)(tens)(ones)

    Note that 0 can not be in the hundredth’s digit. Thus there are

    Total Number of ways = (6) · (6) ·(5) .


    |{z} |{z} |{z}
    hundreds tens ones

    b) How many of these are odd numbers?


    We use the same set up above. Here we choose the ones digit first among {1, 3, 5}. Thus

    Total Number of ways to be odd = (5) · (5) ·(3) .


    |{z} |{z} |{z}
    hundreds tens ones

    c) How many are greater than 330.


    We split these into two cases. Case 1, numbers starting with a number greater than or equal
    to 4 in the hundreds. This has no restriction for the tens or ones. Thus

    Total Number of 4XX = (1) · (5) ·(4) .


    |{z} |{z} |{z}
    hundreds tens ones

    For case 2 we consider numbers of 34X. Since we can not have, for example, 331 because 3
    is repeated. Thus,
    Total Number of 34X = (1) · (1) ·(4) .
    |{z} |{z} |{z}
    hundreds tens ones

    Finally,
    Total Number > 330 = 20 + 4 = 24.
    2. 10 women and 5 men are meeting in a conference room. How many different ways can a
    committee be formed that will consist of 2 men and 2 women?
    For this we, we break it up into choosing women as operation 1, and men as operation 2. For
    choosing men and women, we use combination, because it is done without replacement. Thus,
      
    10 5
    Total Number of ways = (choose 2 women)(choose 2 men) = .
    2 2

    3. You roll fair die 5 times. How many ways can you see a full house in the sense of seeing three
    roles of one type, and two of another (distinct) type? Note that we do note allow for all five
    to be of the same type.
    The die is being rolled sequentially. Thus order matters. That is, seeing a 44545 is different
    than seeing a 45544. First we have the number of full houses (e.g. “4’s over 5’s”) is

    number of FH = (Number of 3 of a kind)(Number of 2 of a kind) = 6 · 5.

    Now we count the number of ways of arranging the 3 of a kind. We have 5 slots to pick from.
    5
    So that is 3 . Thus the total number is
     
    5
    Total Number of ways = 6 · 5.
    3

    You might also like