Problems

Solution:

1. \(\,\) \begin{align*} && \mu &= \E[X] \\ &&&= \int_0^1 x f(x) \d x \\ &&&= \int_0^1 nx^n \d x \\ &&&= \frac{n}{n+1} \\ \\ && \var[X] &= \sigma^2 \\ &&&= \E[X^2] - \mu^2 \\ &&&= \int_0^1 x^2 f(x) \d x - \mu^2 \\ &&&= \int_0^1 nx^{n+1} \d x - \mu^2 \\ &&&= \frac{n}{n+2} - \frac{n^2}{(n+1)^2} \\ &&&= \frac{n(n+1)^2 - n^2(n+2)}{(n+1)^2(n+2)} \\ &&&= \frac{n}{(n+1)^2(n+2)} \end{align*}
2. \(\,\) \begin{align*} && \frac14 &= \int_0^{Q_1} 2x \d x \\ &&&= Q_1^2 \\ \Rightarrow && Q_1 &= \frac12 \\ && \frac34 &= \int_0^{Q_3} 2x \d x \\ &&&= Q_3^2 \\ \Rightarrow && Q_3 &= \frac{\sqrt{3}}2 \\ \\ \Rightarrow && IQR &= Q_3 - Q_1 = \frac{\sqrt{3}-1}{2} \\ && 2 \sigma &= 2\sqrt{\frac{2}{3^2 \cdot 4}} \\ &&&= \frac{\sqrt{2}}{3} \\ \\ && 2\sigma - IRQ &= \frac{\sqrt{2}}{3} - \frac{\sqrt{3}-1}{2} \\ &&&= \frac{2\sqrt{2}-3\sqrt{3}+3}{6} \\ && (3+2\sqrt{2})^2 &= 17+12\sqrt{2} > 29 \\ && (3\sqrt{3})^2 &= 27 \end{align*} Therefore \(2\sigma > IQR\)
3. \[ (1+x)^n = 1 + nx + \frac{n(n-1)}2 x^2 + \cdots + \binom{n}{k} x^k+ \cdots \] \begin{align*} && Q_1^{-n} &= 4 \\ && Q_2^{-n} &= 2\\ && \mu &=\frac{n}{n+1} \\ \Rightarrow && \mu^{-n} &= \left (1 + \frac1n \right)^n\\ &&&\geq 1 + n \frac1n + \cdots > 2 \\ \Rightarrow && \mu &< Q_2 \\ \\ && \mu^{-n} &= \left (1 + \frac1n \right)^n\\ &&&= 1 + n \frac1n + \frac{n(n-1)}{2!} \frac{1}{n^2} + \cdots + \frac{n(n-1) \cdots (n-k+1)}{k!} \frac{1}{n^k} + \cdots \\ &&&= 1 + 1 + \left (1 - \frac1n \right ) \frac1{2!} + \cdots + \left (1 - \frac1n \right)\cdot\left (1 - \frac2n \right) \cdots \left (1 - \frac{k-1}n \right) \frac{1}{k!} + \cdots \\ &&&< 1 + 1 + \frac1{2!} + \cdots + \frac1{k!} \\ &&&< 4 \\ \Rightarrow && \mu &> Q_1 \end{align*}

Solution:

1. \begin{align*} && \frac1{1+x} &= 1 - x+ x^2 - x^3+ \cdots \\ \Rightarrow && \int_0^x \frac{1}{1+t} \d t &= \int_0^x \sum_{n=0}^{\infty} (-t)^n \d t \\ &&&= \left [\sum_{n=0}^{\infty} -\frac{(-t)^{n+1}}{n+1} \right]_0^x \\ \Rightarrow &&\ln(1+x)&=- \sum_{n=1}^\infty \frac{(-x)^n}{n} \end{align*}
2. \begin{align*} && e^{-ax} &= \sum_{n=0}^\infty \frac{(-a)^n}{n!} x^n \\ \Rightarrow && \int_0^{\infty} \frac{1}{x} \left (1-e^{-ax} \right)e^{-x} \d x &= \int_0^{\infty} \frac{1}{x} \left (-\sum_{n=1}^\infty \frac{(-a)^n}{n!}x^n \right)e^{-x} \d x \\ &&&= -\int_0^{\infty} \sum_{n=1}^\infty \frac{(-a)^n}{n!} x^{n-1} e^{-x} \d x \\ &&&= -\sum_{n=1}^\infty \frac{(-a)^n}{n!} \int_0^{\infty} x^{n-1} e^{-x} \d x \\ &&&= -\sum_{n=1}^\infty \frac{(-a)^n}{n!} (n-1)! \\ &&&= -\sum_{n=1}^\infty \frac{(-a)^n}{n} \\ &&&= \ln (1+a) \end{align*}
3. \begin{align*} && \int_0^1 \frac{x^p - x^q}{\ln x} \, \d x &= \int_0^1 \frac{x^p(1 - x^{q-p})}{\ln x} \, \d x \\ e^{-u} = x, \d x = -e^{-u} \d u: &&&=\int_{u=\infty}^{0} \frac{e^{-pu}-e^{-qu}}{-u} (-e^{-u})\d u \\ &&&= \int_0^\infty \frac{e^{-u}(e^{-qu}-e^{-pu})}{u} \d u \\ &&&= \int_0^\infty \frac{e^{-(1+q)u}(1-e^{-(p-q)u})}{u} \d u \\ v = (1+q)u, \d v = (1+q) \d u: &&&=\int_0^{\infty} \frac{e^{-v}(1-e^{-\left(\frac{p-q}{1+q}\right)v}}{v}\d v \\ &&&= \ln \left(1 + \frac{p-q}{1+q} \right) \\ &&&= \ln \left ( \frac{1+p}{1+q} \right) \end{align*}

Solution:

1. \begin{align*} \frac{\left(\cot \theta + i\right)^{2n+1} -\left(\cot \theta - i\right)^{2n+1}}{2i} &= \frac{1}{\sin^{2n+1} \theta}\frac{\left(\cos \theta + i \sin \theta \right)^{2n+1} -\left(\cos\theta - i\sin \theta\right)^{2n+1}}{2i} \\ &= \frac{1}{\sin^{2n+1} \theta} \frac{e^{i(2n+1) \theta} - e^{-i(2n+1) \theta} }{2i} \\ &=\frac{\sin (2n+1) \theta}{\sin^{2n+1} \theta} \end{align*} Notice that: \begin{align*} (\cot \theta + i)^{2n+1} - (\cot \theta - i)^{2n+1} &= \sum_{k=0}^{2n+1} \binom{2n+1}{k}(i)^k \cdot \cot^{2n+1-k} \theta - \sum_{k=0}^{2n+1} \binom{2n+1}{k}(-i)^k \cdot \cot^{2n+1-k} \theta \\ &= \sum_{k=0}^{2n+1} \binom{2n+1}{k} \l i^k - (-i)^k \r \cdot \cot^{2n+1-k} \theta \\ &= \sum_{l=0}^{n} \binom{2n+1}{2l+1} \l i^{2l+1} - (-i)^{2l+1} \r \cdot \cot^{2n+1-(2l+1)} \theta \\ &= \sum_{l=0}^{n} \binom{2n+1}{2l+1} 2i \cdot \cot^{2(n-l)} \theta \\ &= 2i\sum_{l=0}^{n} \binom{2n+1}{2l+1} \cot^{2(n-l)} \theta \\ \end{align*} Therefore if \(\theta\) satisfies \(\frac{\sin (2n+1) \theta}{\sin^{2n+1} \theta} = 0\) then \(z = \cot^2 \theta\) satisfies the equation. But \(\theta = \frac{m \pi}{2n+1}, m = 1, 2, \ldots, n\) are \(n\) distinct all the roots must be \(\cot^2 \frac{m \pi}{2n+1}\).
2. Notice that the sum of the roots will be \(\displaystyle \frac{\binom{2n+1}{3}}{\binom{2n+1}{1}} = \frac{(2n+1)\cdot 2n \cdot (2n-1)}{3! \cdot (2n+1)} = \frac{n \cdot (2n-1)}{3}\) and so \[ \sum_{m=1}^n \cot^{2}\left(\frac{m\pi}{2n+1}\right) =\frac{n\left(2n-1\right)}{3}. \]
3. For \(0 < \theta < \frac{1}{2}\pi\), \begin{align*} && 0 < \sin \theta < \theta < \tan \theta \\ \Leftrightarrow && 0 < \cot \theta < \frac{1}{\theta} < \frac{1}{\sin \theta} \\ \Leftrightarrow && 0 < \cot^2 \theta < \frac{1}{\theta^2} < \cosec^2 \theta = 1 + \cot^2 \theta\\ \end{align*} Therefore \begin{align*} && \sum_{n=1}^N \cot^2 \frac{n \pi}{2N+1} < \sum_{n=1}^N \frac{(2N+1)^2}{n^2 \pi^2} < N + \sum_{n=1}^N \cot^2 \frac{n \pi}{2N+1} \\ \Rightarrow && \frac{1}{(2N+1)^2} \frac{N(2N-1)}{3} < \sum_{n=1}^N \frac{1}{n^2 \pi^2} < \frac{1}{(2N+1)^2} \l \frac{N(2N-1)}{3} + 1 \r \\ \Rightarrow && \lim_{N \to \infty}\frac{1}{(2N+1)^2} \frac{N(2N-1)}{3} < \lim_{N \to \infty}\sum_{n=1}^N \frac{1}{n^2 \pi^2} < \lim_{N \to \infty}\frac{1}{(2N+1)^2} \l \frac{N(2N-1)}{3} + 1 \r \\ \Rightarrow && \frac{1}{6} \leq \lim_{N \to \infty}\sum_{n=1}^N \frac{1}{n^2 \pi^2} \leq \frac16 \\ \Rightarrow && \sum_{n=1}^N \frac{1}{n^2} = \frac{\pi^2}{6} \end{align*}

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*}

Solution:

1. \(n=1\): \begin{align*} && p_1(x) &= (x+1)^2 - 3x(x^2+x+1)^0 \\ &&&= x^2+2x+1-3x \\ &&&= x^2-x+1\\ && q_1(x) &= \frac{x^3+1}{x+1} \\ &&&= x^2-x+1 = p_1(x) \\ \\ && p_2(x) &= (x+1)^4-5x(x^2+x+1)^1 \\ &&&= x^4+4x^3+6x^2+4x+1 - 5x^3-5x^2-5x \\ &&&= x^4-x^3+x^2-x+1 \\ &&q_2(x) &= \frac{x^5+1}{x+1} \\ &&&= x^4-x^3+x^2-x+1 = p_2(x) \\ \\ && p_3(x) &= (x+1)^6-7x(x^2+x+1)^2 \\ &&&= x^6+6x^5+15x^4+20x^3+15x^2+6x+1 - 7x(x^4+2x^3+3x^2+2x+1) \\ &&&= x^6-x^5+x^4-x^3+x^2-x+1 \\ && q_3(x) &= \frac{x^7+1}{x+1} \\ &&&= x^6-x^5+x^4-x^3+x^2-x+1 = p_3(x) \\ \\ && p_4(1) &= 2^8 - 9 \cdot 1 \cdot 3^3 \\ &&&= 256 - 243 = 13 \\ && q_4(1) &= \frac{2}{2} = 1 \neq 13 \end{align*}
2. • \(\bf (a)\) \(\,\) \begin{align*} && \frac{300^3+1}{300+1} &= (300+1)^2 - 3 \cdot 300 \\ &&&= 301^2 - 30^2 \\ &&&= 271 \cdot 331 \end{align*}
   • \(\bf (b)\) \(\,\) \begin{align*} && \dfrac {7^{49}+1}{7^7+1} &= (7^7+1)^6 - 7 \cdot 7^7 \cdot (7^2+7+1)^2 \\ &&&= (7^7+1)^6 - 7^8 \cdot (7^2+7+1)^2 \\ &&&= ((7^7+1)^3 - 7^4(7^2+7+1)) \cdot ((7^7+1)^3 + 7^4(7^2+7+1)) \end{align*}

Solution:

1. \(\frac{(-N)(-N-1)\cdots(-N-n+1)}{n!} = \binom{N+n-1}{n}\), so \[ (1-x)^{-N} = \sum_{n=0}^{\infty} \binom{N+n-1}{n} x^n\] \begin{align*} && (1-x)^{-N-1} &= (1-x)^{-1}(1-x)^{-N} \\ &&&= (1 + x + x^2 + \cdots)\left ( \sum_{n=0}^{\infty} \binom{N+n-1}{n} x^n\right)\\ [x^{n}]: && \binom{N+1+n-1}{n} &= \sum_{j=0}^n \underbrace{1}_{x^{n-j} \text{ from 1st bracket}}\cdot\underbrace{\binom{N+j-1}{j}}_{x^j\text{ from second bracket}} \\ \Rightarrow && \binom{N+n}{n} &= \sum_{j=0}^n \binom{N+j-1}{j} \end{align*}
2. Consider \((1+x)^{m+n} = (1+x)^m(1+x)^n\) and consider the coefficient of \(x^r\) from each side. On the left hand side this is clearly \(\binom{m+n}{r}\) on the right hand side we can take \(x^j\) from \((1+x)^m\) and \(x^{n-j}\) from \((1+x)^n\) and \(j\) can take any value from \(0\) to \(r\), ie \[ \binom{m+n} r = \sum _{j=0}^r \binom m j \binom n {r-j} \]
3. Consider \((1-x)^{-(N+m+1)} = (\)

Solution:

1. \(\,\) \begin{align*} \mathbb{P}(A) &= \mathbb{P}(\text{the first 6 arises on the \(n\)th throw.}) \\ &= \mathbb{P}(\text{\(n-1\) not 6s, followed by a 6.})\\ &= \left ( \frac56\right)^{n-1} \cdot \frac16 = \frac{5^{n-1}}{6^n} \end{align*}
2. There is nothing special about \(5\) or \(6\), so which comes first is \(50:50\), therefore this probability is \(\frac12\)
3. There is nothing special about \(4\), \(5\) or \(6\) so this is the probability that \(6\) appears last out of these three numbers, hence \(\frac13\)
4. \(\,\) \begin{align*} \mathbb{P}(D) &= \mathbb{P}(\text{exactly one 5 arises before the first 6.}) \\ &=\sum_{n=2}^{\infty} \mathbb{P}(\text{exactly one 5 arises before the first 6 which appears on the \(n\)th roll.}) \\ &= \sum_{n=2}^{\infty} \binom{n-1}{1} \left ( \frac46 \right)^{n-2} \frac16 \cdot \frac16 \\ &= \frac1{36} \sum_{n=2}^{\infty} (n-1) \left ( \frac23 \right)^{n-2} \\ &= \frac1{36} \sum_{n=1}^{\infty} n \left ( \frac23 \right)^{n-1} \\ &= \frac1{36} \frac{1}{\left ( 1- \frac23 \right)^2} = \frac14 \end{align*}
5. \(\,\) \begin{align*} \mathbb{P}(D \cup E) &= \mathbb{P}(D) + \mathbb{P}(E) - \mathbb{P}(D \cap E) \\ &= \frac12 - \mathbb{P}(D \cap E) \\ &=\frac12 - \sum_{n=3}^{\infty} \mathbb{P}(\text{exactly one 5 and one 4 arises before the first 6 which appears on the \(n\)th roll.}) \\ &=\frac12 - \sum_{n=3}^{\infty} 2\binom{n-1}{2} \left ( \frac36 \right)^{n-3}\cdot \frac16 \cdot \frac16 \cdot \frac16 \\ &=\frac12 - \frac2{6^3}\sum_{n=3}^{\infty} \frac{(n-1)(n-2)}{2} \left ( \frac12 \right)^{n-3} \\ &=\frac12 - \frac2{6^3}\frac{1}{(1-\tfrac12)^3}\\ &= \frac12 - \frac{2}{27} \\ &= \frac{23}{54} \end{align*}

Solution:

1. Claim: For all \(n \geq 1\) \(T_{2n} = A_{2n} + B_{2n}\sqrt{a(a+1)}\) where \(A_{2n}, B_{2n}\) are integers and \(A_{2n}^2 = a(a+1)B_{2n}^2+1\) Proof: (By induction) Base case: \(n =1\). \begin{align*} && T_2 &= (\sqrt{a+1}+\sqrt{a})^2 \\ &&&= a+1+2\sqrt{a(a+1)}+a \\ &&&=2a+1+2\sqrt{a(a+1)} \\ \Rightarrow && A_2 &= 2a+1 \\ && B_2 &= 2 \\ && A_2^2 &= 4a^2+4a+1 \\ && a(a+1)B_1^2 + 1 &= 4a^2+4a+1 \end{align*} Therefore our base case is true. Suppose it is true for some \(n = k\) then consider \(n = k+1\) we must have \(T_{2k} = A_{2k}+B_{2k}\sqrt{a(a+1)}\) \begin{align*} && T_{2(k+1)} &= T_{2k} (\sqrt{a+1}+\sqrt{a})^2 \\ &&&= \left (A_{2k}+B_{2k}\sqrt{a(a+1)} \right)\left (2a+1+2\sqrt{a(a+1)} \right) \\ &&&= (2a+1)A_{2k}+2a(a+1)B_{2k} + (2A_{2k}+(2a+1)B_{2k})\sqrt{a(a+1)} \\ \Rightarrow && A_{2(k+1)} &= (2a+1)A_{2k}+2a(a+1)B_{2k} \in \mathbb{Z} \\ && B_{2(k+1)} &= 2A_{2k}+(2a+1)B_{2k} \in \mathbb{Z} \\ && A_{2(k+1)}^2 &= \left ( (2a+1)A_{2k}+2a(a+1)B_{2k} \right)^2 \\ &&&= (2a+1)^2A_{2k}^2+4a^2(a+1)^2B_{2k}^2+4a(a+1)(2a+1)A_{2k}B_{2k} \\ &&&= a^2(a+1)^2(2a+1)^2B_{2k}^2+(2a+1)^2\\ &&&\quad\quad+4a^2(a+1)^2B_{2k}^2+4a(a+1)(2a+1)A_{2k}B_{2k}\\ && a(a+1)B_{2(k+1)}^2 + 1 &= a(a+1)\left ( 2A_{2k}+(2a+1)B_{2k} \right)^2 \\ &&&= 4a(a+1)A_{2k}^2 + 4a(a+1)(2a+1)A_{2k}B_{2k} + a(a+1)(2a+1)^2B_{2k}^2 + 1\\ &&&= 4a^2(a+1)^2B_{2k}^2+4a(a+1) + \\ &&&\quad\quad+ 4a(a+1)(2a+1)A_{2k}B_{2k} + a(a+1)(2a+1)^2B_{2k}^2 + 1 \end{align*} So our relation holds ad therefore by induction we're done.
2. When \(n\) is odd, notice that \begin{align*} && T_n &= (\sqrt{a+1}+\sqrt{a})(A_m+B_m\sqrt{a(a+1)})\\ &&&= \sqrt{a+1}(\underbrace{A_m+aB_m}_{C_n})+\sqrt{a}(\underbrace{(a+1)B_m+A_m}_{D_n}) \\ \\ && (a+1)C_n^2 &= (a+1)(A_m+aB_m)^2 \\ &&&= (a+1)(A_m^2+2aA_mB_m+B_m^2) \\ &&&= (a+1)(a(a+1)B_m^2+1+2aA_mB_m+B_m^2) \\ &&&= a(a+1)^2B_m^2 + 2a(a+1)A_mB_m+(a+1)B_m^2+a+1 \\ && aD_n^2+1 &= a((a+1)^2B_m + 2(a+1)A_mB_m + A_m^2)+1 \\ &&&= a(a+1)^2B_m + 2a(a+1)A_mB_m + aB_{m}^2+a+1 \end{align*}
3. For even \(n\) \(T_n = \sqrt{a(a+1)B_{2n}^2+1} + \sqrt{a(a+1)B_{2n}^2}\) For odd \(n\), \(T_n = \sqrt{aD_n^2+1}+ \sqrt{aD_n^2}\) therefore it is always the sum of the square root of two consecutive integers.

Solution: \begin{align*} && \frac{1+x}{(1-x)^2(1+x^2)} &= \frac{A}{1-x} + \frac{B}{(1-x)^2} + \frac{Cx+D}{1+x^2} \\ \Rightarrow && 1 + x &= A(1-x)(1+x^2) + B(1+x^2) + Cx(1-x)^2 + D(1-x)^2 \\ \Rightarrow && 2 &= 2B \tag{\(x = 1\)} \\ \Rightarrow && 1 &= B \\ \Rightarrow && 1 &= A+B+D \tag{\(x = 0\)}\\ \Rightarrow && A &= -D \\ \Rightarrow && 0 &= 4A+2B-4C+4D \tag{\(x = -1\)}\\ \Rightarrow && C &= \frac12\\ \Rightarrow && 3 &= -5A+5B+2C+D \tag{\(x=2\)} \\ \Rightarrow && 3 &= -6A+6 \\ \Rightarrow && A,D &=-\frac12,\frac12 \\ \Rightarrow && \frac{1+x}{(1-x)^2(1+x^2)} &= \frac{1}{(1-x)^2} +\frac{1}{2(1-x)}+ \frac{x-1}{2(1+x^2)} \\ &&&=\sum_{k=0}^{\infty}(k+1)x^k + \sum_{k=0}^{\infty}\frac12 x^k + \sum_{k=0}^{\infty}\frac12 (-1)^kx^{2k+1} - \sum_{k=0}^{\infty}\frac12 (-1)^kx^{2k} \end{align*} Therefore the coefficient of \(x^n\) is \(n+1\) or \(n+2\) depending on whether the coefficients from the final series add constructively \(n \equiv 1, 2 \pmod{4}\) or destructively. \begin{align*} \frac{11\, 000}{8181} &= \frac{(10+1) \cdot 1000}{(10-1)^2 \cdot (100+1)} \\ &= \frac{(1+\frac{1}{10})}{(1-\frac{1}{10})^2 \cdot (1+\frac1{10})} \\ &= 1 + \frac3{10} + \frac4{10^2} + \frac{4}{10^3}+\frac{5}{10^4} + \frac{7}{10^5} + \frac{8}{10^6} + \cdots \\ & \quad \quad \cdots + \frac{8}{10^7} + \frac{9}{10^8} + \frac{11}{10^9} + \frac{12}{10^{10}} + \cdots \\ &= 1.34457890 + \frac{12}{10^{10}} + \cdots \end{align*} \begin{align*} && \sum_{k=m}^{\infty} (k+2)x^k &= x^m \sum_{k=0}^{\infty} (k+m+2)x^{k} \\ && &= \frac{x^k}{(1-x)^2} + \frac{(m+2)x^k}{1-x} \\ \Rightarrow && |\sum_{k=m}^{\infty} a_k \left ( \frac1{10} \right )^k | &\leq \frac{1}{10^m}\left ( \frac{1}{(1-\frac1{10})^2} + \frac{m+2}{1-\frac1{10}} \right) \\ &&&= \frac{1}{10^{m-1}} \left ( \frac{9m+28}{81}\right ) \end{align*} Therefore for this will be less than \(10^{-9}\), when \(m = 11\), so our approximation is valid to 9sf

Solution: \begin{align*} && I &= \int_0^{\frac{1}{2}\pi} \frac{\sin 2x}{1+\sin^2x} \d x \\ &&&= \int_0^{\frac{1}{2}\pi} \frac{2 \sin x \cos x}{1+\sin^2x} \d x \\ &&&= \left [\ln (1 + \sin^2 x) \right]_0^{\pi/2} \\ &&&= \ln 2 \\ \\ && J &= \int_0^{\frac{1}{2}\pi} \frac{\sin x}{1+\sin^2x} \d x \\ &&&= \int_0^{\frac{1}{2}\pi} \frac{\sin x}{2-\cos^2x} \d x \\ &&&= \frac{1}{2\sqrt{2}}\int_0^{\frac{1}{2}\pi} \left ( \frac{\sin x}{\sqrt{2}-\cos x}+ \frac{\sin x}{\sqrt{2}+\cos x} \right) \d x \\ &&&= \frac{1}{2\sqrt{2}} \left [\ln (\sqrt{2}-\cos x) - \ln (\sqrt{2}+\cos x) \right]_0^{\pi/2} \\ &&&= \frac{1}{2\sqrt{2}} \left (-\ln(\sqrt{2}-1)+\ln(\sqrt{2}+1) \right) \\ &&&= \frac1{2\sqrt{2}} \ln \left (\frac{\sqrt{2}+1}{\sqrt{2}-1} \right)\\ &&&= \frac1{\sqrt{2}} \ln (\sqrt{2}+1) \end{align*} \begin{align*} && (1+\sqrt{2})^5 + (1-\sqrt{2})^5 &= 2(1+10\cdot2+5\cdot2^2) \\ &&&= 82 \\ && |(1-\sqrt{2})^5| & < 1 \\ && (1+\sqrt{2})^5 &< 83 < 99 \\ \\ && 1.4^2 &= 1.96 \\ &&&< 2 \\ \Rightarrow && 1.4 &<\sqrt{2} \\ \\ \Rightarrow && 2^{\sqrt{2}} &> 2^{1.4} \\ &&&=2^{7/5} \\ &&&= {128}^{1/5} \\ &&&>99^{1/5} \\ &&&>1+\sqrt{2} \end{align*} \begin{align*} && \ln 2 & > \frac{1}{\sqrt{2}} \ln(\sqrt{2}+1) \\ \Leftrightarrow && \sqrt{2} \ln 2 &> \ln(\sqrt{2}+1) \\ \Leftrightarrow && 2^{\sqrt{2}} &> 1+\sqrt{2} \end{align*} which we have already shown, so the first integral is larger.

Solution:

1. Using the generalise binomial theorem \begin{align*} \left( 1+\frac k {100} \right)^{\frac12} &= 1 + \frac12 \frac{k}{100} + \frac{\tfrac12 \cdot \left ( -\tfrac12\right)}{2!} \left (\frac{k}{100} \right)^2 + \frac{\tfrac12 \cdot \left ( -\tfrac12\right)\cdot \left ( -\tfrac32\right)}{3!} \left (\frac{k}{100} \right)^3 + \cdots \\ &= 1 + \frac{1}{200}k - \frac{1}{80\,000}k^2 + \frac{1}{16\,000\,000}k^3 + \cdots \end{align*}
   1. If \(k = 8\), \begin{align*} && \left( 1+\frac 8 {100} \right)^{\frac12} &= 1 + \frac{1}{200}8 - \frac{1}{80\,000}8^2 + \frac{1}{16\,000\,000}8^3 + \cdots \\ \Rightarrow && \frac{6\sqrt{3}}{10} &\approx 1 + 0.04 - 0.0008 + 0.000032 \\ &&&= 1.039232\\ \Rightarrow && \sqrt{3} &\approx 1.73205 \, (5\, \text{d.p.}) \end{align*}
   2. If \(k = -4\), \begin{align*} && \left( 1-\frac 4 {100} \right)^{\frac12} &= 1 - \frac{1}{200}4 - \frac{1}{80\,000}4^2 - \frac{1}{16\,000\,000}4^3 + \cdots \\ \Rightarrow && \frac{4\sqrt{6}}{10} &\approx 1 -0.02-0.0002 -0.000004 \\ &&&= 0.979796\\ \Rightarrow && \sqrt{6} &\approx 2.44949\, (5\, \text{d.p.}) \end{align*}
2. \(\,\) \begin{align*} && \left( 1+\frac k {1000} \right)^{\!\frac13} &= 1 + \frac13 \frac{k}{1000} + \cdots \\ &&&= 1 + \frac{k}{3\,000} + \cdots \\ && 3 \times 7^3 &= 1029 \\ \Rightarrow && \left( 1+\frac {29} {1000} \right)^{\!\frac13} &\approx 1 + \frac{29}{3\,000} \\ \Rightarrow && \frac{7\sqrt[3]{3}}{10} &\approx \frac{3\,029}{3000} \\ \Rightarrow && \sqrt[3]{3} &= \frac{3\,029}{2\,100} \end{align*}

Solution:

1. Notice that \(1 \cdot 3 \cdot 5 \cdot 7 \cdot (2n-1) = \frac{1 \cdot 2 \cdot 3 \cdot 4 \cdots \cdots 2n}{2 \cdot 4 \cdot 6 \cdots 2n} = \frac{(2n)!}{2^n \cdot n!}\) as required. When \(|4x| < 1\) or \(|x|<\frac14\) we can apply the generalised binomial theorem to see that: \begin{align*} \frac{1}{\sqrt{1-4x}} &= (1-4x)^{-\frac12} \\ &= 1+\sum_{n=1}^\infty \frac{-\frac12 \cdot \left ( -\frac32\right)\cdots \left ( -\frac{2n-1}2\right)}{n!} (-4x)^n \\ &= 1+\sum_{n=1}^{\infty} (-1)^n\frac{(2n)!}{(n!)^2 2^{2n}} (-4)^n x^n \\ &= 1+\sum_{n=1}^{\infty} \frac{(2n)!}{(n!)^2 } x^n \\ \end{align*}
2. Differentiating we obtain \begin{align*} && 2(1-4x)^{-\frac32} &= \sum_{n=1}^\infty \frac{(2n)!}{n!(n-1)!} x^{n-1} \\ \Rightarrow &&\sum_{n=1}^\infty \frac{(2n)!}{n!(n-1)!} \left (\frac{6}{25} \right)^{n} &= \frac{6}{25} \cdot 2\left(1- 4 \frac{6}{25}\right)^{-\frac32} \\ &&&= \frac{12}{25} \left (\frac{1}{25} \right)^{-\frac32} \\ &&&= \frac{12}{25} \cdot 125 = 60 \end{align*}
3. By integrating, we obtain \begin{align*} && \int_{t=0}^{t=x} \frac{1}{\sqrt{1-4t}} \d t &= \int_{t=0}^{t=x} \left (1+\sum_{n=1}^{\infty} \frac{(2n)!}{(n!)^2 } t^n \right) \d t \\ \Rightarrow && \left [ -\frac12 \sqrt{1-4t}\right]_0^x &= x + \sum_{n=1}^{\infty} \frac{(2n)!}{n!(n+1)! } x^{n+1} \\ \Rightarrow && \frac12 - \frac12\sqrt{1-4x} - x &= \sum_{n=1}^{\infty} \frac{(2n)!}{n!(n+1)! } x^{n+1} \\ \\ \Rightarrow && 9\sum_{n=1}^{\infty} \frac{(2n)!}{n!(n+1)! } \left ( \frac{2}{9}\right)^{n+1} &=9 \cdot\left( \frac12 - \frac12 \sqrt{1-4\cdot \frac{2}{9}} - \frac29\right )\\ &&&= 9 \cdot \left (\frac12 - \frac{1}{6} - \frac{2}{9} \right) \\ &&&= 1 \end{align*}

Solution: Not that the number of diamonds per kilogram is \(1\) so we are assuming it is \(Po(M)\) where \(M\) is the mass in kg. In particular \(\E[X] = M\) and \(\mathbb{P}(X = 0) = e^{-M}\)

1. \(\,\) \begin{align*} && \mathbb{P}(\text{no diamonds}) &= \sum_{n=1}^6\mathbb{P}(\text{no diamonds and roll }n) \\ &&&= \sum_{n=1}^6 \tfrac16 e^{-\frac{n}{10}} \\ &&&= \frac{e^{-0.1}}6 \left ( \frac{1-e^{-0.6}}{1-e^{-0.1}}\right) \\ && \E[\text{diamonds}] &= \sum_{n=1}^6 \E(\text{diamonds}|N = n)\mathbb{P}(N = n) \\ &&&= \sum_{n=1}^6 0.1n \cdot \frac16 \\ &&&= 0.1 \cdot \frac{7}{2} = 0.35 \end{align*}
2. \(\mathbb{P}(T = k) = \left ( \frac56 \right)^{t-1} \frac16\), so \begin{align*} && \mathbb{P}(\text{no diamonds}) &= \sum_{n=1}^\infty\mathbb{P}(\text{no diamonds and }T=n) \\ &&&= \sum_{n=1}^\infty e^{-0.1n} \left ( \frac56 \right)^{n-1} \frac16 \\ &&&= \frac{e^{-0.1}}{6} \frac1{1- \frac56 e^{-0.1}} \\ &&&= \frac{e^{-0.1}}{6 - 5e^{-0.1}} \\ \\ && \E[\text{diamonds}] &= \sum_{n=1}^\infty \E(\text{diamonds}|T = n)\mathbb{P}(T = n) \\ &&&= \sum_{n=1}^\infty 0.1n \cdot \left ( \frac56 \right)^{n-1} \frac16 \\ &&&= \frac{0.1}{6} \sum_{n=1}^\infty n \cdot \left ( \frac56 \right)^{n-1} \\ &&&= \frac{1}{60} \frac{1}{(1- \tfrac56)^2} \\ &&&= \frac{6}{10} = \frac35 \end{align*}

Solution:

1. First notice that \(\frac{1}{5+\sqrt{24}} = \frac{5-\sqrt{24}}{25-24} = 5 - \sqrt{24}\), hence \begin{align*} && ( 5 + \sqrt {24})^4 + \frac{1 }{(5 + \sqrt {24})^4} &= ( 5 + \sqrt {24})^4 + ( 5 - \sqrt {24})^4 \\ \end{align*} where clearly all terms including \(\sqrt{24}\) will cancel out, therefore it is an integer. \begin{align*} && 5 + \sqrt{24} &< 5 + 5 = 10 \\ \Rightarrow && \frac{1}{5+\sqrt{24}}& > \frac{1}{10} = 0.1 \\ && 2(5 + \sqrt{24}) &=10 + \sqrt{96} > 19 \\ \Rightarrow && \frac{1}{5+\sqrt{24}} & < \frac{2}{19} < \frac{2}{18} = \frac19 = 0.11111\ldots < 0.11 \end{align*} Therefore, \(10^{-4} < (5+\sqrt{24})^4 < 0.11^{-4} = 0.00014641\) \begin{align*} && (5+\sqrt{24})^4 + (5-\sqrt{24})^4 &= 2(5^4+6\cdot5^2\cdot24+24^2) \\ &&&= 2\cdot (625 + 3600+576) \\ &&&= 9602 \\ \Rightarrow && (5+\sqrt{24})^4 &= 9602 - \epsilon, \epsilon \in (0.0001, 0.00014641) \\ \Rightarrow && (5+\sqrt{24})^4 &\in (9601.999854, ,9601.9999) \\ \Rightarrow && (5+\sqrt{24})^4 &= 9601.9998 \, (4 \text{ d.p.}) \end{align*}
2. Notice that \((N+\sqrt{N^2-1})^{k}+(N-\sqrt{N^2-1})^{k}\) is an integer for the same reason as before (sum of conjugates). Notice also that \(\frac{1}{N+\sqrt{N^2-1}} = N - \sqrt{N^2-1}\) and that so it sufficies to show that \begin{align*} && N + \sqrt{N^2-1} &> 2N-\tfrac12 \\ \Leftrightarrow && \sqrt{N^2-1} &> N - \tfrac12 \\ \Leftrightarrow && N^2-1 &> N^2-N+1\\ \Leftrightarrow && N &> \tfrac32\\ \end{align*} Which is true since \(N > 1\) and \(N\) is an integer.

Solution:

1. \(\displaystyle (1-x)^{-1} = \sum_{n=0}^\infty x^n\), \(\displaystyle (1-x)^{-2} = \sum_{n=0}^\infty (n+1)x^n\), \(\displaystyle (1-x)^{-3} = \sum_{n=0}^\infty \frac{(n+2)(n+1)}{2}x^n\) \begin{align*} && \sum_{n=1}^{\infty} n2^{-n} &= \frac12\sum_{n=0}^{\infty}(n+1)2^{-n} \\ &&&= \frac12 (1-\tfrac12)^{-2} = 2 \\ \\ && \sum_{n=1}^{\infty} nx^n&= x(1-x)^{-2} \\ \Rightarrow && \sum_{n=1}^{\infty} n^2x^{n-1}&= (1-x)^{-2}+2x(1-x)^{-3} \\ \Rightarrow && \sum_{n=1}^{\infty} n^22^{-n} &= \frac12 \left ( (1-\tfrac12)^{-2}+2\cdot \tfrac12 \cdot (1-\tfrac12)^{-3} \right) \\ &&&= \frac12 \left ( 4 +8\right) = 6 \end{align*}
2. By the generalised binomial theorem, \begin{align*} && (1-x)^{-\frac12} &= 1 + \sum_{n=1}^{\infty} \frac{(-\tfrac12)\cdot(-\tfrac32)\cdots(-\tfrac12-n+1)}{n!}(-x)^n \\ &&&= 1 + \sum_{n=1}^{\infty} \frac{(-1)^n(\tfrac12)\cdot(\tfrac32)\cdots(\tfrac{2n-1}2)}{n!}(-x)^n \\ &&&= 1 + \sum_{n=1}^{\infty} \frac{1 \cdot 3 \cdot 5 \cdots (2n-1)}{2^nn!}x^n \\ &&&= 1 + \sum_{n=1}^{\infty} \frac{(2n)!}{2^nn! \cdot 2^n n!}x^n \\ &&&= 1 + \sum_{n=1}^{\infty} \frac{(2n)!}{2^{2n}(n!)^2}x^n \\ &&&= \sum_{n=0}^{\infty} \frac{(2n)!}{2^{2n}(n!)^2}x^n \\ \end{align*} \begin{align*} && \sum_{n=0}^\infty \frac{(2n)!} {(n!)^2 2^{2n}3^{n}} &= (1-\tfrac13)^{-\frac12} \\ &&&= \sqrt{\frac32} \\ \\ && (1-x)^{-\frac12} &= \sum_{n=0}^{\infty} \frac{(2n)!}{2^{2n}(n!)^2}x^n \\ \Rightarrow && \tfrac12(1-x)^{-\frac32} &= \sum_{n=0}^{\infty} \frac{n(2n)!}{2^{2n}(n!)^2}x^{n-1} \\ \Rightarrow && \sum_{n=1}^\infty \frac{n(2n)!} {(n!)^2 2^{2n}3^{n}} &= \frac16(1-\tfrac13)^{-3/2} \\ &&&= \frac16 \sqrt{\frac{27}{8}} = \frac14\sqrt{\frac{3}2} \end{align*}