Chapter 7: Problem 5
Let \(U_{1}, U_{2}, \ldots\) be independent uniform \((0,1)\) random variables, and define \(N\) by $$ N=\min \left(n: U_{1}+U_{2}+\cdots+U_{n}>1\right\\} $$ What is \(E[N] ?\)
Chapter 7: Problem 5
Let \(U_{1}, U_{2}, \ldots\) be independent uniform \((0,1)\) random variables, and define \(N\) by $$ N=\min \left(n: U_{1}+U_{2}+\cdots+U_{n}>1\right\\} $$ What is \(E[N] ?\)
All the tools & learning materials you need for study success - in one app.
Get started for freeThere are three machines, all of which are needed for a system to work. Machine \(i\) functions for an exponential time with rate \(\lambda_{i}\) before it fails, \(i=1,2,3 .\) When a machine fails, the system is shut down and repair begins on the failed machine. The time to fix machine 1 is exponential with rate \(5 ;\) the time to fix machine 2 is uniform on \((0,4) ;\) and the time to fix machine 3 is a gamma random variable with parameters \(n=3\) and \(\lambda=2 .\) Once a failed machine is repaired, it is as good as new and all machines are restarted. (a) What proportion of time is the system working? (b) What proportion of time is machine 1 being repaired? (c) What proportion of time is machine 2 in a state of suspended animation (that is, neither working nor being repaired)?
Each of \(n\) skiers continually, and independently, climbs up and then skis down a particular slope. The time it takes skier \(i\) to climb up has distribution \(F_{i}\), and it is independent of her time to ski down, which has distribution \(H_{i}, i=1, \ldots, n\). Let \(N(t)\) denote the total number of times members of this group have skied down the slope by time \(t .\) Also, let \(U(t)\) denote the number of skiers climbing up the hill at time \(t\). (a) What is \(\lim _{t \rightarrow \infty} N(t) / t\) ? (b) Find \(\lim _{t \rightarrow \infty} E[U(t)]\). (c) If all \(F_{i}\) are exponential with rate \(\lambda\) and all \(G_{i}\) are exponential with rate \(\mu\), what is \(P\\{U(t)=k\\} ?\)
A taxi alternates between three different locations. Whenever it reaches location \(i\), it stops and spends a random time having mean \(t_{i}\) before obtaining another passenger, \(i=1,2,3 .\) A passenger entering the cab at location \(i\) will want to go to location \(j\) with probability \(P_{i j} .\) The time to travel from \(i\) to \(j\) is a random variable with mean \(m_{i j} .\) Suppose that \(t_{1}=1, t_{2}=2, t_{3}=4, P_{12}=1, P_{23}=1, P_{31}=\frac{2}{3}=1-P_{32}\) \(m_{12}=10, m_{23}=20, m_{31}=15, m_{32}=25 .\) Define an appropriate semi- Markov process and determine (a) the proportion of time the taxi is waiting at location \(i\), and (b) the proportion of time the taxi is on the road from \(i\) to \(j, i, j=1,2,3\).
A machine in use is replaced by a new machine either when it fails or when it reaches the age of \(T\) years. If the lifetimes of successive machines are independent with a common distribution \(F\) having density \(f\), show that (a) the long-run rate at which machines are replaced equals $$ \left[\int_{0}^{T} x f(x) d x+T(1-F(T))\right]^{-1} $$ (b) the long-run rate at which machines in use fail equals $$ \frac{F(T)}{\int_{0}^{T} x f(x) d x+T[1-F(T)]} $$
Consider a single-server bank for which customers arrive in accordance with a Poisson process with rate \(\lambda .\) If a customer will enter the bank only if the server is free when he arrives, and if the service time of a customer has the distribution \(G\), then what proportion of time is the server busy?
What do you think about this solution?
We value your feedback to improve our textbook solutions.