Problems

Solution:

+ - ↺

1. \(\,\) \begin{align*} \bf{COE}: && \frac12 m \cdot 5ag &= mg\cdot 2a + \frac12 m v^2 \\ \Rightarrow && v^2 &= ag \\ && v &= \sqrt{ag} \end{align*} If it just clears the second wall, we must have: \begin{align*} && 0 &= \sqrt{ag} \sin \theta t - \frac12 gt^2 \\ \Rightarrow && t &= \frac{2\sqrt{ag}\sin \theta}{g} \\ && a &= \sqrt{ag} \cos \theta t \\ &&&=\sqrt{ag} \cos \theta \frac{2\sqrt{ag}\sin \theta}{g} \\ &&&= a \sin 2 \theta \\ \Rightarrow && \theta &= 45^{\circ} \end{align*} Imagine firing the particle backwards from the top of the wall at \(45^\circ\) then \begin{align*} && -2a &= \sqrt{ag}\cdot \left ( -\frac1{\sqrt{2}} \right) t - \frac12 g t^2 \\ \Rightarrow && 0 &= gt^2+\sqrt{2ag} t -4a \\ &&&= (\sqrt{g}t -\sqrt{2} \sqrt{a})(\sqrt{g}t +2\sqrt{2} \sqrt{a}) \\ \Rightarrow && t &= \sqrt{\frac{2a}{g}} \\ \Rightarrow && s &= \left ( -\frac1{\sqrt{2}} \right) \sqrt{ag} \sqrt{\frac{2a}{g}} \\ &&&= -a \end{align*} Therefore the \(A\) is \(a\) from the wall.
2. When it passes over the first wall, \begin{align*} \bf{COE}: && \frac52amg &= (2a+h)mg + \frac12 m v^2 \\ \Rightarrow && v^2 &= (a-2h)g \end{align*} Now imagine firing a particle with this speed in any direction. The question is asking whether we can ever travel \(2a\) without descending more than \(h\). \begin{align*} && a &= \sqrt{(a-2h)g} \cos \beta t \\ \Rightarrow && t &= \frac{a}{\sqrt{(a-2h)g} \cos \beta}\\ && -h &= \sqrt{(a-2h)g} \sin \beta t - \frac12 g t^2 \\ &&&= a \tan \beta - \frac12 \frac{a^2}{(a-2h)} \sec^2 \beta \\ &&&= a \tan \beta - \frac{a^2}{2(a-2h)}(1+ \tan^2 \beta )\\ \Rightarrow && 0 &= \frac{a^2}{2(a-2h)} \tan^2 \beta-a \tan \beta + \frac{a^2-2ah+4h^2}{2(a-2h)} \\ && \Delta &= a^2 - \frac{a^2}{a-2h} \frac{a^2-2ah+4h^2}{a-2h} \\ &&&= \frac{a^2}{(a-2h)^2}\left ( a^2-4ah+4h^2-a^2+2ah-4h^2\right) \\ &&&= \frac{a^2}{(a-2h)^2}\left ( -2ah\right) < 0 \\ \end{align*} So there are no solutions if \(h > 0\)

Solution:

1. \(\,\) \begin{align*} && \mathbb{P}(X+Y=r) &= \sum_{k=0}^r \mathbb{P}(X = k, Y = r-k) \\ &&&= \sum_{k=0}^r \mathbb{P}(X = k)\mathbb{P}( Y = r-k) \\ &&&= \sum_{k=0}^r \frac{e^{-\lambda T} (\lambda T)^k}{k!}\frac{e^{-\mu T} (\mu T)^{r-k}}{(r-k)!}\\ &&&= \frac{e^{-(\mu+\lambda)T}}{r!}\sum_{k=0}^r \binom{r}{k}(\lambda T)^k (\mu T)^{r-k}\\ &&&= \frac{e^{-(\mu+\lambda)T}((\mu+\lambda)T)^r}{r!} \end{align*} Therefore \(X+Y \sim Po \left ( (\mu+\lambda)T \right)\)
2. \(\,\) \begin{align*} && \mathbb{P}(X = r | X+Y = k) &= \frac{\mathbb{P}(X=r, Y = k-r)}{\mathbb{P}(X+Y=k)} \\ &&&= \frac{\frac{e^{-\lambda T} (\lambda T)^r}{r!}\frac{e^{-\mu T} (\mu T)^{k-r}}{(k-r)!}}{\frac{e^{-(\mu+\lambda)T}((\mu+\lambda)T)^k}{k!}} \\ &&&= \binom{k}{r} \left ( \frac{\lambda}{\lambda + \mu} \right)^r \left ( \frac{\mu}{\lambda + \mu} \right)^{k-r} \end{align*} Therefore \(X|X+Y=k \sim B(k, \frac{\lambda}{\lambda + \mu})\)
3. \(P(X=1|X+Y = 1) = \frac{\lambda}{\lambda + \mu}\)
4. Let \(X_1, Y_1\) be the time to the first fish are caught by Adam and Eve, then \begin{align*} && \mathbb{P}(X_1, Y_1 > t) &= \mathbb{P}(X_1> t) \mathbb{P}( Y_1 > t) \\ &&&= e^{-\lambda t}e^{-\mu t} \\ &&&= e^{-(\lambda+\mu)t} \\ \Rightarrow && f_{\max(X_1,Y_1)}(t) &= (\lambda+\mu)e^{-(\lambda+\mu)} \end{align*} Therefore the expected time is \(\frac1{\mu+\lambda}\)

Solution:

1. The probability they pull the key out on the \(k\)th attempt will be \(\left ( \frac{n-1}{n} \right)^{k-1} \frac1n\), so we want: \begin{align*} \E[G_1] &= \sum_{k=1}^{\infty} k \cdot \left ( \frac{n-1}{n} \right)^{k-1} \frac1n \\ &= \frac{1}n \sum_{k=1}^{\infty} k \cdot \left ( \frac{n-1}{n} \right)^{k-1} \\ &= \frac1n \frac{1}{\left (1 - \frac{n-1}{n} \right)^2} \\ &= \frac{1}{n} \frac{n^2}{1^2} = n \end{align*}
2. In version 2, the probability the correct key comes out at the \(k\)th attempt is \(\frac1n\) (assume we take out all the keys, then the correct key is equally likely to appear in all of the space). Therefore \(\E[G_2] = \frac1n (1 + 2 + \cdots + n) = \frac{n+1}{2}\)
3. The probability the key comes out on the correct attempt is: \begin{align*} && \mathbb{P}(G_3 = k) &= \frac{n-1}{n} \cdot \frac{n}{n+1} \cdot \frac{n+1}{n+2} \cdots \frac{n+k-3}{n+k-2} \cdot \frac{1}{n+k-1} \\ &&&= \frac{n-1}{(n+k-2)(n+k-1)} \\ \\ &&k \cdot \mathbb{P}(G_3 = k) &= \frac{k(n-1)}{(n+k-2)(n+k-1)} \\ &&&= \frac{(n-1)(2-n)}{n+k-2} + \frac{(n-1)^2}{n+k-1} \\ &&&= \frac{(n-1)^2}{n+k-1} - \frac{(n-1)^2}{n+k-2} + \frac{n-1}{n-k+2} \\ \Rightarrow && \E[G_3] &= \sum_{k=1}^{\infty} k \cdot \mathbb{P}(G_3 = k) \\ &&&= \sum_{k=1}^{\infty} \left ( \frac{(n-1)^2}{n+k-1} - \frac{(n-1)^2}{n+k-2} + \frac{n-1}{n+k-2} \right) \\ &&&= \sum_{k=1}^{\infty} \left ( \frac{(n-1)^2}{n+k-1} - \frac{(n-1)^2}{n+k-2} \right) +\underbrace{\sum_{k=1}^{\infty} \frac{n-1}{n-k+2}}_{\to \infty} \\ \end{align*}