/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q. 2.1 Consider an experiment that cons... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

Consider an experiment that consists of 6horses, numbered1through6, and running a race, and suppose that the sample space consists of the 6!possible orders in which the horses finish. Let Abe the event that the number-1the horse is among the top three finishers, and letBbe the event that the number-2horse comes in second. How many outcomes are in the eventA∪B?

Short Answer

Expert verified

N(A∪B)=432

Note thatN(A∪B)=N(A)+N(B)-N(A∩B), and count the elements on the right-hand side.

Step by step solution

01

Given Information.

LetAbe the event that the number-1the horse is among the top three finishers, and letBbe the event that the number-2 horse comes in second.

02

Explanation.

Using only mathematical context we have:

Outcome spaceS:

S=x1,x2,…x6:xi∈{1,2,…6},∶Äi

Shas all the ordered permutations of numbers 1-6(representing horses).

|S|=6!- the number of elements it Sis6!.

Event A- the number1is eitherlocalid="1649427017351" x1,x2-orlocalid="1649427028219" x3
.

A=1,x2,…x6,x1,1,…x6,x1,x2,1,…x6:xi∈{2,…6},∶Äi

There are 5!permutations of the other elements of the vector (2,3,4,5&6)and 1can be the first the second, or the third.

By the multiplication principle of counting - |A|=3·5!

EventB- the number 2isx2.

B=x1,2,…x6:xi∈{1,3,…6},∶Äi

There are 5!permutations of the other elements of the vector(1,3,4,5&6).|B|=5!

An event A∩Bwhere number one is in the first three and the number two is second

A∩B=1,2,…x6,x1,2,1,…x6:xi∈{3,…6},∶Äi

The remaining numbers-3,4,5&6can be permuted in 4!ways. And 1,2can either be the first and the second number or the third and the second number.

|A∩B|=2·4!

03

Explanation.

From one of the previous exercises we know:

|A∪B|=|A|+|B|-|A∩B|

The other notation for the number of elements in a set isN(A).

Finally:

|A∪B|=3·5!+5!-2·4!=18·4!=432

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91Ó°ÊÓ!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

For a finite setA, let's N(A)denote the number of elementsA.

(a)Show thatN(A∪B)=N(A)+N(B)−N(AB)

(b)More generally, show thatN(∪Ai)=∑N(Ai)-∑i<j∑N(AiAj)+...+(-1)n+1N(A1A2...An)

Poker dice is played by simultaneously rolling 5dice. Show that

(a) P{no two alike}

(b) P{one pair}

(c) P{two pair}

(d) P{three alike}

(e) P{full house}

(f) P{four alike}

(g) P{five alike}

The game of craps is played as follows: A player rolls two dice. If the sum of the dice is either a2,3,or12, the player loses; if the sum is either a 7or an 11, the player wins. If the outcome is anything else, the player continues to roll the dice until she rolls either the initial outcome or a 7. If the 7comes first, the player loses, whereas if the initial outcome reoccurs before the 7appears, the player wins. Compute the probability of a player winning at craps.

Hint: Let Eidenote the event that the initial outcome is iand the player wins. The desired probability is ∑i=1212P(Ei). To compute P(Ei), define the events Ei,nto be the event that the initial sum is i and the player wins on the nth roll. Argue that

P(Ei)=∑n=1∞P(Ei,n)

How many people have to be in a room in order that the probability that at least two of them celebrate their birthday in the same month is at least 12? Assume that all possible monthly outcomes are equally likely.

Let Tk(n)denote the number of partitions of the set1,...,nintoknonempty subsets, where1≤k≤n. (See Theoretical Exercise 8for the definition of a partition.) Argue that

Tk(n)=kTk(n−1)+Tk−1(n−1)

Hint: In how many partitions is1a subset, and in how many1elements of a subset that contains other elements?

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.