1531 problems found
Prove that, for any real numbers \(x\) and \(y\), \(x^2+y^2\ge2xy\,\).
I seat \(n\) boys and \(3\) girls in a line at random, so that each order of the \(n+3\) children is as likely to occur as any other. Let \(K\) be the maximum number of consecutive girls in the line so, for example, \(K=1\) if there is at least one boy between each pair of girls.
Solution:
Two curves have equations \(\; x^4+y^4=u\;\) and \(\; xy = v\;\), where \(u\) and \(v\) are positive constants. State the equations of the lines of symmetry of each curve. The curves intersect at the distinct points \(A\), \(B\), \(C\) and \(D\) (taken anticlockwise from \(A\)). The coordinates of \(A\) are \((\alpha,\beta)\), where \(\alpha > \beta > 0\). Write down, in terms of \(\alpha\) and \(\beta\), the coordinates of \(B\), \(C\) and \(D\). Show that the quadrilateral \(ABCD\) is a rectangle and find its area in terms of \(u\) and \(v\) only. Verify that, for the case \(u=81\) and \(v=4\), the area is \(14\).
Solution: The curve \(x^4 + y^4 = u\) has lines of symmetry:
The curve \(C\) has equation \[ y= a^{\sin (\pi \e^ x)}\,, \] where \(a>1\).
Solution:
Prove that \[ \tan \left ( \tfrac14 \pi -\tfrac12 x \right)\equiv \sec x -\tan x\,. \tag{\(*\)} \]
Solution: \begin{align*} && \tan \left ( \tfrac14 \pi -\tfrac12 x \right) &\equiv \frac{\tan \tfrac{\pi}{4} - \tan \tfrac12 x}{1 + \tan \tfrac{\pi}{4} \tan \tfrac12 x} \\ &&&= \frac{1-\tan \tfrac12 x}{1+\tan \tfrac12 x} \\ \\ && \sec x - \tan x &= \frac{1+t^2}{1-t^2} - \frac{2t}{1-t^2} \\ &&&= \frac{(1-t)^2}{(1-t)(1+t)} \\ &&&= \frac{1-t}{1+t} \end{align*} Therefore both sides are equal to the same thing.
The polynomial \(\p(x)\) is of degree 9 and \(\p(x)-1\) is exactly divisible by \((x-1)^5\).
Solution: \(p(x) = q(x)(x-1)^5 + 1\) where \(q(x)\) has degree \(4\).
Expand and simplify \((\sqrt{x-1}+1)^2\,\).
The Fibonacci sequence \(F_1\), \(F_2\), \(F_3\), \(\ldots\) is defined by \(F_1=1\), \(F_2= 1\) and \[ F_{n+1} = F_n+F_{n-1} \qquad\qquad (n\ge 2). \] Write down the values of \(F_3\), \(F_4\), \(\ldots\), \(F_{10}\). Let \(\displaystyle S=\sum_{i=1}^\infty \dfrac1 {F_i}\,\).
Solution: \begin{array}{c|r} n & F_n \\ \hline 1 & 1 \\ 2 & 1 \\ 3 & 2 \\ 4 & 3 \\ 5 & 5 \\ 6 & 8 \\ 7 & 13 \\ 8 & 21 \\ 9 & 34 \\ 10 & 55 \end{array} \begin{questionparts} \item Claim: \(\frac1{F_i} > \frac1{2F_{i-1}}\) for \(i \geq 4\). Proof: Since \(F_i = F_{i-1}+F_{i-2}\) and \(F_i > 1\) for \(i \geq 1\) we have \(F_i > F_{i-1}\) for \(i \geq 3\). In particular we have \(F_i = F_{i-1}+F_{i-2} < 2F_{i-1}\) for \(i -1 \geq 3\) or \(i \geq 4\). Therefore \(\frac{1}{F_i} > \frac1{2F_{i-1}}\)
Let \(y= (x-a)^n \e^{bx} \sqrt{1+x^2}\,\), where \(n\) and \(a\) are constants and \(b\) is a non-zero constant. Show that \[ \frac{\d y}{\d x} = \frac{(x-a)^{n-1} \e^{bx} \q(x)}{\sqrt{1+x^2}}\,, \] where \(\q(x)\) is a cubic polynomial. Using this result, determine:
The non-collinear points \(A\), \(B\) and \(C\) have position vectors \(\bf a\), \(\bf b\) and \(\bf c\), respectively. The points \(P\) and \(Q\) have position vectors \(\bf p\) and \(\bf q\), respectively, given by \[ {\bf p}= \lambda {\bf a} +(1-\lambda){\bf b} \text{ \ \ \ and \ \ \ } {\bf q}= \mu {\bf a} +(1-\mu){\bf c} \] where \(0<\lambda<1\) and \(\mu>1\). Draw a diagram showing \(A\), \(B\), \(C\), \(P\) and \(Q\). Given that \(CQ\times BP = AB\times AC\), find \(\mu\) in terms of \(\lambda\), and show that, for all values of \(\lambda\), the the line \(PQ\) passes through the fixed point \(D\), with position vector \({\bf d}\) given by \({\bf d= -a +b +c}\,\). What can be said about the quadrilateral \(ABDC\)?
Solution:
\(\,\)
A train consists of an engine and \(n\) trucks. It is travelling along a straight horizontal section of track. The mass of the engine and of each truck is \(M\). The resistance to motion of the engine and of each truck is \(R\), which is constant. The maximum power at which the engine can work is \(P\). Obtain an expression for the acceleration of the train when its speed is \(v\) and the engine is working at maximum power. The train starts from rest with the engine working at maximum power. Obtain an expression for the time \(T\) taken to reach a given speed \(V\), and show that this speed is only achievable if \[ P>(n+1)RV\,. \]
A continuous random variable \(X\) has probability density function given by \[ \f(x) = \begin{cases} 0 & \mbox{for } x<0 \\ k\e^{-2 x^2} & \mbox{for } 0\le x< \infty \;,\\ \end{cases} \] where \(k\) is a constant.
Solution:
Satellites are launched using two different types of rocket: the Andover and the Basingstoke. The Andover has four engines and the Basingstoke has six. Each engine has a probability~\(p\) of failing during any given launch. After the launch, the rockets are retrieved and repaired by replacing some or all of the engines. The cost of replacing each engine is \(K\). For the Andover, if more than one engine fails, all four engines are replaced. Otherwise, only the failed engine (if there is one) is replaced. Show that the expected repair cost for a single launch using the Andover is \[ 4Kp(1+q+q^2-2q^3) \ \ \ \ \ \ \ \ \ \ \ \ \ (q=1-p) \tag{*} \] For the Basingstoke, if more than two engines fail, all six engines are replaced. Otherwise only the failed engines (if there are any) are replaced. Find, in a form similar to \((*)\), the expected repair cost for a single launch using the Basingstoke. Find the values of \(p\) for which the expected repair cost for the Andover is \(\frac23\) of the expected repair cost for the Basingstoke.