exercise:Cb30e81684: Difference between revisions
From Stochiki
(Created page with "<div class="d-none"><math> \newcommand{\NA}{{\rm NA}} \newcommand{\mat}[1]{{\bf#1}} \newcommand{\exref}[1]{\ref{##1}} \newcommand{\secstoprocess}{\all} \newcommand{\NA}{{\rm NA}} \newcommand{\mathds}{\mathbb}</math></div> Once upon a time, there were two railway trains competing for the passenger traffic of 1000 people leaving from Chicago at the same hour and going to Los Angeles. Assume that passengers are equally likely to choose each train. How many seats mu...") |
No edit summary |
||
| Line 1: | Line 1: | ||
Once upon a time, there were two railway trains competing for the passenger traffic of 1000 people leaving from Chicago at the same hour and | |||
going to Los Angeles. Assume that passengers are equally likely to choose each train. How many seats must a train have to assure a probability of .99 or | |||
passenger traffic of 1000 people leaving from Chicago at the same hour and | |||
going to Los Angeles. Assume that passengers are equally likely to choose each | |||
train. How many seats must a train have to assure a probability of .99 or | |||
better of having a seat for each passenger? | better of having a seat for each passenger? | ||
Latest revision as of 23:57, 14 June 2024
Once upon a time, there were two railway trains competing for the passenger traffic of 1000 people leaving from Chicago at the same hour and going to Los Angeles. Assume that passengers are equally likely to choose each train. How many seats must a train have to assure a probability of .99 or better of having a seat for each passenger?