/*! 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.39 There are 5hotels in a certain t... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

There are 5hotels in a certain town. If 3people check

into hotels in a day, what is the probability that they each check into a different hotel? What assumptions are you making?

Short Answer

Expert verified

the probability that they each check into a different hotel is0.48.

Step by step solution

01

Given Information.

There are 5hotels in a certain town. If 3people check

into hotels in a day.

02

Explanation.

5Cl4*Cl*3Cl*/5*5*5

=5*43*/125

=60/125

=0.48

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

An instructor gives her class a set of 10problems with the information that the final exam will consist of a random selection of 5them. If a student has figured out how to do 7the problems, what is the probability that he or she will answer correctly

(a)all 5problems?

(b) at least4of the problems?

Consider Example5o, which is concerned with the number of runs of wins obtained whennwins and mlosses are randomly permuted. Now consider the total number of runs—that is, win runs plus loss runs—and show that

P(2kruns)=n-1k-1m-1k-1n+mnP(2k+1runs)=n-1km-1k-1+n-1k-1m-1kn+mn

Consider the matching problem, Example5m, and define it to be the number of ways in which theNmen can select their hats so that no man selects his own.

Argue thatAN=(N−1)(AN-1+AN-2). This formula, along with the boundary conditionsA1=0,A2=1, can then be solved forAN, and the desired probability of no matches would be AN/N!.

Hint: After the first man selects a hat that is not his own, there remain N−1men to select among a set of N−1hats that do not contain the hat of one of these men. Thus, there is one extra man and one extra hat. Argue that we can get no matches either with the extra man selecting the extra hat or with the extra man not selecting the extra hat.

A forest contains20elk, which 5are captured, tagged, and then released. A certain time later,4the 20elk are captured. What is the probability that 2these 4have been tagged? What assumptions are you making?

An elementary school is offering 3 language classes: one in Spanish, one in French, and one in German. The

classes are open to any of the 100 students in the school. There are 28 students in the Spanish class, 26 in the French class, and 16 in the German class. There are 12 students who are in both Spanish and French, 4 who are in both Spanish and German, and 6 who are in both French and German. In addition, there are 2 students taking all 3 classes.

(a) If a student is chosen randomly, what is the probability that he or she is not in any of the language classes?

(b) If a student is chosen randomly, what is the probability that he or she is taking exactly one language class?

(c) If 2 students are chosen randomly, what is the probability that at least 1 is taking a language class?

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.