Repeat the preceding problem when the seating is random but subject to the constraint that the men and women alternate.

Short Answer

Expert verified
  1. The probability of Ciis PCi=((n1)!)22n(n!)22n=1n2
  2. The probability of PCjCi=PCj,CiPCi=1n(n1)21n2=1(n1)2
  3. For very large nthe required probability isP(X=0)=eλe1

Step by step solution

01

Given Information (part a)

Given that the Ci, denote the event that the members of a couple iare seated next to each other,i=1,...,n.

We have to findPCi

02

Explanation (part a)

From the combinatorics, we learn that we can permute men on n!paths.

Even, we learn that we can permute women onn!paths.

Put them around the table in that demand and alternate.

Since the table is rounded, we do not differ in every 2nseating. Therefore, we have that there exist (n!)22nmodes to seat them. Suppose that the couple ihas been seated somewhere, but together.

Then, we have to remain n-1men and n-1women and we can set them on ((n1)!)2routes since they have to alternate, and also, we do not differ every2nseating.

Therefore

PCi=((n1)!)22n(n)22n=1n2

03

Final Answer (part a)

The probability of Ci is:

width="169">PCi=((n1)!)22n(n)22n=1n2
04

Given Information (part b)

Given that ji.

We have to findPCjCi

05

Explanation (part b)

Assume that pair iand jsit together.

So, the remaining pairs can place on((n2)!)2modes.

Also, as in (a), we have that

PCjCi=PCj,CiPCi=1n2(n1)21n3=1(n1)2

06

Step 6:Final Answer (part b)

Probability of Cj|Ci is,PCjCi=PCj,CiPCi=1n2(n1)21n3=1(n1)2

07

Given Information (part c)

Given that for nlarge, there are no married couples who are seated next to each other.

08

Explanation (part c)

The probability that some pair sits to each other is 1PCi=n21n2. Describe Xas the random variable that denotes the number of pairs that do not sit to each other.

Utilizing Poisson approximation, we have that X~Pois n21n2. For very large, the required probability is

P(X=0)=eλe1

since

09

Step 9:Final Answer(part c)

For nlarge, there are no married couples who are seated next to each other. The approximate probability is

P(X=0)=eλe1

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 Vaia!

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

Let X be a binomial random variable with parameters (n, p). What value of p maximizes P{X = k}, k = 0, 1, ... , n? This is an example of a statistical method used to estimate p when a binomial (n, p) random variable is observed to equal k. If we assume that n is known, then we estimate p by choosing that value of p that maximizes P{X = k}. This is known as the method of maximum likelihood estimation.

The suicide rate in a certain state is 1 suicide per 100,000 inhabitants per month.

(a) Find the probability that in a city of 400,000 inhabitants within this state, there will be 8 or more suicides in a given month.

(b) What is the probability that there will be at least 2 months during the year that will have 8 or more suicides?

(c) Counting the present month as month number 1, what is the probability that the first month to have 8 or more suicides will be month number i,i1? What assumptions are you making?

Here is another way to obtain a set of recursive equations for determining Pn, the probability that there is a string of kconsecutive heads in a sequence of nflips of a fair coin that comes up heads with probability p:

(a) Argue that for k<n, there will be a string of kconsecutive heads if either

1. there is a string of kconsecutive heads within the first n-1flips, or

2. there is no string of kconsecutive heads within the first n-k-1flips, flip n-kis a tail, and flips n-k+1,,nare all heads.

(b) Using the preceding, relate PntoPn-1. Starting with Pk=pk, the recursion can be used to obtain Pk+1, thenPk+2, and so on, up to Pn.

A communications channel transmits the digits 0and 1. However, due to static, the digit transmitted is incorrectly received with probability 2. Suppose that we want to transmit an important message consisting of one binary digit. To reduce the chance of error, we transmit 00000 instead of 0 and 11111 instead of 1. If the receiver of the message uses “majority” decoding, what is the probability that the message will be wrong when decoded? What independence assumptions are you making?

Five men and 5 women are ranked according to their scores on an examination. Assume that no two scores are alike and all 10! possible rankings are equally likely. LetXdenote the highest ranking achieved by a woman. (For instance,X=1 if the top-ranked person is female.) FindP{X=i},i=1,2,3,,8,9,10

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.

Sign-up for free