/*! 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}

91Ó°ÊÓ

In Example 2h,say that i andj,i≠j, form a matched pair if i chooses the hat belonging to j and j chooses the hat belonging to i. Find the expected number of matched pairs.

Short Answer

Expert verified

The expected number of matched pairs isE[X]=12

Step by step solution

01

Given Information 

Given in the question that i≠jform a matched pair if i choose the hat belonging to j and j chooses the that belonging to i.

02

Explanation

Let

Xij={1Ifiandjformamatched pair ifichooses the hat belong tojandjchooses the hat belong to0otherwise.

X=∑i=1N∑j=1,i≠jN,Xij-total number

E[X]=∑i=1N∑j=1,i≠jN,E[Xij]

=(N2)1N(N−1)

We get,

=N(N−1)2N(N−1)

=12.

03

Final Answer

The expected number of matched pairs isE[X]=12

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

Consider a gambler who, at each gamble, either wins or loses her bet with respective probabilities pand 1-p. A popular gambling system known as the Kelley strategy is to always bet the fraction 2p-1of your current fortune when p>12. Compute the expected fortune afterngambles of a gambler who starts with xunits and employs the Kelley strategy.

Two envelopes, each containing a check, are placed in front of you. You are to choose one of the envelopes, open it, and see the amount of the check. At this point, either you can accept that amount or you can exchange it for the check in the unopened envelope. What should you do? Is it possible to devise a strategy that does better than just accepting the first envelope? Let Aand B, A<B, denote the (unknown) amounts of the checks and note that the strategy that randomly selects an envelope and always accepts its check has an expected return of (A+B)/2. Consider the following strategy: Let F(·)be any strictly increasing (that is, continuous) distribution function. Choose an envelope randomly and open it. If the discovered check has the value x, then accept it with probability F(x)and exchange it with probability 1−F(x).

(a) Show that if you employ the latter strategy, then your expected return is greater than (A+B)/2. Hint: Condition on whether the first envelope has the value Aor B. Now consider the strategy that fixes a value x and then accepts the first check if its value is greater than x and exchanges it otherwise. (b) Show that for any x, the expected return under thex-strategy is always at least (A+B)/2and that it is strictly larger than (A+B)/2if xlies between Aand B.

(c) Let X be a continuous random variable on the whole line, and consider the following strategy: Generate the value ofX, and if X=x, then employ the x-strategy of part (b). Show that the expected return under this strategy is greater than (A+B)/2.

For Example 2i, show that the variance of the number of coupons needed to a mass a full set is equal to∑i=1N−1 iN(N−i)2

When Nis large, this can be shown to be approximately equal (in the sense that their ratio approaches 1 as N→∞) to N2π2/6.

The k-of-r-out-of- ncircular reliability system, k≤r≤n, consists of ncomponents that are arranged in a circular fashion. Each component is either functional or failed, and the system functions if there is no block of rconsecutive components of which at least kare failed. Show that there is no way to arrange 47components, 8of which are failed, to make a functional 3-of-12-out-of-47circular system.

A fair die is rolled 10times. Calculate the expected sum of the10 rolls.

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.