/*! 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.4.73 聽Suppose in Problem 4.72 that t... [FREE SOLUTION] | 91影视

91影视

Suppose in Problem 4.72 that the two teams are evenly matched and each has probability 1 2 of winning each game. Find the expected number of games played.

Short Answer

Expert verified

In the given information the answer isEX=5.8125

Step by step solution

01

Given Information

Given that the two players are evenly matched, evenly matched means the two teams are played same number of matches with equal probability.

The probability is12.

By the definition E(X)=xp(x).

Let E games played=EGP

Expected value isE(GP)=2xp(x).

02

Calculation

E[GP]=2433124+512C3412312+612C33123122+712C36123123

E[GP]=214+518+6532+7532

=29332=5.8125

03

Step 3:Final Answer

The final answer isEX=5.8125

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

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.

Show that Xis a Poisson random variable with parameter , then

EXn=E(X+1)n-1

Now use this result to compute EX3.

One of the numbers 1through 10is randomly chosen. You are to try to guess the number chosen by asking questions with 鈥測es-no鈥 answers. Compute the expected number of questions you will need to ask in each of the following two cases:

(a) Your ith question is to be 鈥淚s it i?鈥 i = 1,2,3,4,5,6,7,8,9,10. (b) With each question, you try to eliminate one-half of the remaining numbers, as nearly as possible.

If the distribution function of Xis given by

F(b)=0鈥呪赌呪赌呪赌b<012鈥呪赌呪赌呪赌0b<135鈥呪赌呪赌呪赌1b<245鈥呪赌呪赌呪赌2b<3910鈥呪赌呪赌呪赌3b<3.51鈥呪赌呪赌呪赌b3.5

calculate the probability mass function of X.

A family has n children with probability pn,n1where(1-p)/p

(a) What proportion of families has no children?

(b) If each child is equally likely to be a boy or a girl (independently of each other), what proportion of families consists of k boys (and any number of girls)?

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.