A particle \(P\) of mass \(m\) is connected by two light inextensible strings to two fixed points \(A\) and \(B\), with \(A\) vertically above \(B\). The string \(AP\) has length \(x\). The particle is rotating about the vertical through \(A\) and \(B\) with angular velocity \(\omega\), and both strings are taut. Angles \(PAB\) and \(PBA\) are \(\alpha\) and \(\beta\), respectively. Find the tensions \(T_A\) and \(T_B\) in the strings \(AP\) and \(BP\) (respectively), and hence show that \(\omega^2 x\cos\alpha \ge g\). Consider now the case that \(\omega^2 x\cos\alpha = g\). Given that \(AB=h\) and \(BP=d\), where \(h>d\), show that \(h\cos\alpha \ge \sqrt{h^2-d^2}\). Show further that \[ mg < T_A \le \frac{mgh}{\sqrt{h^2-d^2}\,}\,. \] Describe the geometry of the strings when \(T_A\) attains its upper bound.
Solution:
The random variable \(X\) has probability density function \(f(x)\) (which you may assume is differentiable) and cumulative distribution function \(F(x)\) where \(-\infty < x < \infty \). The random variable \(Y\) is defined by \(Y= \e^X\). You may assume throughout this question that \(X\) and \(Y\) have unique modes.
Solution:
I play a game which has repeated rounds. Before the first round, my score is \(0\). Each round can have three outcomes:
Solution:
Solution:
In this question, \(\lfloor x \rfloor\) denotes the greatest integer that is less than or equal to \(x\), so that \(\lfloor 2.9 \rfloor = 2 = \lfloor 2.0 \rfloor\) and \(\lfloor -1.5 \rfloor = -2\). The function \(\f\) is defined, for \(x\ne0\), by \(\f(x) = \dfrac{\lfloor x \rfloor}{x}\,\).
Solution:
For any two points \(X\) and \(Y\), with position vectors \(\bf x\) and \(\bf y\) respectively, \(X*Y\) is defined to be the point with position vector \(\lambda {\bf x}+ (1-\lambda){\bf y}\), where \(\lambda\) is a fixed number.
Solution:
Solution:
The point \(P\) has coordinates \((x,y)\) which satisfy \[ x^2+y^2 + kxy +3x +y =0\,. \]
Solution:
By considering the coefficient of \(x^r\) in the series for \((1+x)(1+x)^n\), or otherwise, obtain the following relation between binomial coefficients: \[ \binom n r + \binom n {r-1} = \binom {n+1} r \qquad (1\le r\le n). \] The sequence of numbers \(B_0\), \(B_1\), \(B_2\), \(\ldots\) is defined by \[ B_{2m} = \sum_{j=0}^m \binom{2m-j}j \text{ and } B_{2m+1} = \sum_{k=0}^m \binom{2m+1-k}k . \] Show that \(B_{n+2} - B_{n+1} = B_{n}\,\) (\(n=0\), \(1\), \(2\), \(\ldots\,\)). What is the relation between the sequence \(B_0\), \(B_1\), \(B_2\), \(\ldots\) and the Fibonacci sequence \(F_0\), \(F_1\), \(F_2\), \(\ldots\) defined by \(F_0=0\), \(F_1=1\) and \(F_n = F_{n-1}+F_{n-2}\) for \(n\ge2\)?
Solution: The coefficient of \(x^{r-1}\) in \((1+x)^n\) is \(\binom{n}{r-1}\) and the coefficient of \(x^r\) in \((1+x)^n\) is \(\binom{n}{r}\). The only ways to get \(x^r\) in the expansion of \((1+x)(1+x)^n\) is to either multiply the \(x^r\) term from the second expansion by \(1\) or the \(x^{r-1}\) term by \(x\). This is \(\binom{n}{r-1} + \binom{n}{r}\). However, the coefficient of \(x^r\) in \((1+x)^{n+1}\) is \(\binom{n+1}r\), so \(\binom{n}{r} + \binom{n}{n-1} = \binom{n+1}r\). Claim: \(B_{n+2} - B_{n+1} = B_{n}\). Proof: Consider \(n\) even, ie \(n = 2m\) \begin{align*} B_{n+2} - B_{n+1} &= \sum_{j=0}^{m+1} \binom{2(m+1)-j}{j} - \sum_{j=0}^m \binom{2m+1-j}{j} \\ &= \binom{2(m+1)-(m+1)}{m+1} +\sum_{j=0}^m \left ( \binom{2(m+1)-j}{j} - \binom{2m+1-j}{j} \right) \\ &= 1 + \sum_{j=1}^m \binom{2m+1-j}{j-1} \\ &= 1 + \sum_{j=0}^{m-1} \binom{2m-j}{j} \\ &= \binom{m}{m} + \sum_{j=0}^{m-1} \binom{2m-j}{j} \\ &= \sum_{j=0}^{m} \binom{2m-j}{j} \\ &= B_n \end{align*} Consider \(n\) even, ie \(n = 2m+1\) \begin{align*} B_{n+2} - B_{n+1} &= \sum_{j=0}^{m+1} \binom{2(m+1)+1-j}{j} - \sum_{j=0}^{m+1} \binom{2(m+1)-j}{j} \\ &= \sum_{j=0}^{m+1} \left (\binom{2(m+1)+1-j}{j} - \binom{2(m+1)-j}{j}\right)\\ &= \sum_{j=1}^{m+1} \binom{2(m+1)-j}{j-1} \\ &= \sum_{j=0}^{m} \binom{2m+1-j}{j} \\ &= B_n \end{align*} as required. \(B_0 = 1, B_1 = 2\), therefore \(B_n = F_{n+2}\)
Solution: