15 problems found
If we split a set \(S\) of integers into two subsets \(A\) and \(B\) whose intersection is empty and whose union is the whole of \(S\), and such that
Solution:
Solution:
Throughout this question, \(N\) is an integer with \(N \geqslant 1\) and \(S_N = \displaystyle\sum_{r=1}^{N} \frac{1}{r^2}\). You may assume that \(\displaystyle\lim_{N\to\infty} S_N\) exists and is equal to \(\frac{1}{6}\pi^2\).
Solution:
Solution:
Let \[ T _n = \left( \sqrt{a+1} + \sqrt a\right)^n\,, \] where \(n\) is a positive integer and \(a\) is any given positive integer.
Solution:
A sequence of numbers, \(F_1, F_2, \ldots\), is defined by \(F_1=1, F_2=1\), and \[ F_n=F_{n-1}+F_{n-2}\, \quad \text{for \(n\ge 3\)}. \]
Show that the distinct complex numbers \(\alpha\), \(\beta\) and \(\gamma\) represent the vertices of an equilateral triangle (in clockwise or anti-clockwise order) if and only if \[ \alpha^2 + \beta^2 +\gamma^2 -\beta\gamma - \gamma \alpha -\alpha\beta =0\,. \] Show that the roots of the equation \begin{equation*} z^3 +az^2 +bz +c=0 \tag{\(*\)} \end{equation*} represent the vertices of an equilateral triangle if and only if \(a^2=3b\). Under the transformation \(z=pw+q\), where \(p\) and \(q\) are given complex numbers with \(p\ne0\), the equation (\(*\)) becomes \[ w^3 +Aw^2 +Bw +C=0\,. \tag{\(**\)} \] Show that if the roots of equation \((*)\) represent the vertices of an equilateral triangle, then the roots of equation \((**)\) also represent the vertices of an equilateral triangle.
Solution: The complex numbers represent an equilateral triangle iff \(\gamma\) is a \(\pm 60^\circ\) rotation of \(\beta\) around \(\alpha\), ie \begin{align*} && \gamma - \alpha &= \omega(\beta - \alpha) \\ \Leftrightarrow && \omega &= \frac{\gamma - \alpha}{\beta - \alpha} \\ \Leftrightarrow && -1 &= \left (\frac{\gamma - \alpha}{\beta - \alpha} \right)^3 \\ \Leftrightarrow && -(\beta - \alpha)^3 &=(\gamma - \alpha)^3 \\ \Leftrightarrow && 0 &= (\gamma-\alpha)^3+(\beta-\alpha)^3 \\ &&&= \gamma^3-3\gamma^2\alpha +3\gamma\alpha^2-\alpha^3 +\beta^3-3\beta^2\alpha+3\beta\alpha^2-\alpha^3 \\ &&&= (\beta + \gamma - 2\alpha)(\alpha^2+\beta^2+\gamma^2 - \alpha\beta - \beta\gamma - \gamma \delta) \\ \Leftrightarrow && 0 &= \alpha^2+\beta^2+\gamma^2 - \alpha\beta - \beta\gamma - \gamma \delta \end{align*} The roots of the equation \(z^3+az^2+bz+c = 0\) represents the vertices of an equilateral triangle iff \(a^2-3b = (\alpha+\beta+\gamma^2) - 3(\alpha\beta+\beta\gamma+\gamma\alpha) = \alpha^2+\beta^2+\gamma^2 - \alpha\beta - \beta\gamma - \gamma \delta = 0\) as erquired. Suppose \(a^2 = 3b\), then consider \(z = pw +q\), we must have \begin{align*} && 0 &= (pw+q)^3+a(pw+q)^2 + b(pw+q)+c \\ &&&= p^3w^3 +(3p^2q+ap^2)w^2+(3pq^2+2apq+bp)w+(q^3+aq^2+bq+c) \\ &&&= p^3w^3+p^2(3q+a)w^2+p(3q^2+2aq+b)w+(q^3+aq^2+bq+c) \\ \end{align*} We need to check if \(\left(\frac{3q+a}{p} \right)^2 = 3 \left (\frac{3q^2+2qa+b}{p^2} \right)\). Clearly the denominators match, so consider the numerators \begin{align*} && (3q+a)^2 &= 9q^2+6aq+a^2 \\ &&&= 9q^2+6aq+3b \\ &&&= 3(3q^2+2qa+b) \end{align*} as required
The positive numbers \(a\), \(b\) and \(c\) satisfy \(bc=a^2+1\). Prove that $$ \arctan\left(\frac1 {a+b}\right)+ \arctan\left(\frac1 {a+c}\right)= \arctan\left(\frac1 a \right). $$ The positive numbers \(p\), \(q\), \(r\), \(s\), \(t\), \(u\) and \(v\) satisfy $$ st = (p+q)^2 + 1 \;, \ \ \ \ \ \ uv=(p+r)^2 + 1 \;, \ \ \ \ \ \ qr = p^2+1\;. $$ Prove that $$ \arctan \! \!\left(\!\frac1 {p+q+s}\!\right) + \arctan \! \!\left(\!\frac 1{p+q+t}\!\right) + \arctan \! \!\left(\!\frac 1 {p+r+u}\!\right) + \arctan \! \!\left(\!\frac1 {p+r+v}\!\right) =\arctan \! \!\left( \! \frac1 p \! \right) . $$ Hence show that $$ \arctan\left(\frac1 {13}\right) +\arctan\left(\frac1 {21}\right) +\arctan\left(\frac1 {82}\right) +\arctan\left(\frac1 {187}\right) =\arctan\left(\frac1 {7}\right). $$ [Note that \(\arctan x\) is another notation for \( \tan^{-1}x \,.\,\)]
Solution: \begin{align*} && \tan \left (\arctan\left(\frac1 {a+b}\right)+ \arctan\left(\frac1 {a+c}\right) \right) &= \frac{\frac1{a+b}+\frac1{a+c}}{1-\frac{1}{(a+b)(a+c)}} \\ &&&= \frac{a+c+a+b}{(a+b)(a+c)-1} \\ &&&= \frac{2a+b+c}{a^2+ab+ac+bc-1} \\ &&&= \frac{2a+b+c}{2a^2+ab+ac} \\ &&&= \frac{1}{a} \\ &&&= \tan \arctan \frac1a\\ \Rightarrow && \arctan\left(\frac1 {a+b}\right)+ \arctan\left(\frac1 {a+c}\right) &= \arctan \frac{1}{a} + n \pi \end{align*} Since \(\arctan x \in (-\frac{\pi}{2}, \frac{\pi}{2})\) the LHS \(\in (0, \pi)\) so \(n = 0\). \begin{align*} a=p+q, b = s, c = t:&& \arctan \! \!\left(\!\frac1 {p+q+s}\!\right) + \arctan \! \!\left(\!\frac 1{p+q+t}\!\right) &= \arctan \left ( \frac{1}{p+q} \right) \\ a=p+r, b= u, c = v && \arctan \! \!\left(\!\frac 1 {p+r+u}\!\right) + \arctan \! \!\left(\!\frac1 {p+r+v}\!\right) &= \arctan \! \!\left(\!\frac1 {p+r}\!\right) \\ a = p, b = q, c = r:&& \arctan \left ( \frac{1}{p+q} \right) +\arctan \! \!\left(\!\frac1 {p+r}\!\right) &= \arctan \left ( \frac1p \right) \end{align*} and the result follows. Taking \(p = 7\) we need to solve \[ \begin{cases} q+s &= 6 \\ q+t &= 14 \\ r+u &= 75 \\ r+v &= 180 \end{cases} \] also satisfying \(qr = 50\) etc, so say \(q = 1, r = 50, s = 5, v=25\)
By considering the expansions in powers of \(x\) of both sides of the identity $$ {(1+x)^n}{(1+x)^n}\equiv{(1+x)^{2n}}, $$ show that $$ \sum_{s=0}^n {n\choose s}^2 = {2n\choose n}, $$ where \(\displaystyle {n\choose s}= \frac{n!}{s!\,(n-s)!}\). By considering similar identities, or otherwise, show also that:
Solution: To obtain the coefficient of \(x^n\) on the RHS we clearly have \(\displaystyle \binom{2n}n\). To obtain the coefficient of \(x^n\) on the LHS we can obtain \(x^s\) from the first bracket and \(x^{n-s}\) from the second bracket, ie \(\displaystyle \sum_{s=0}^n \binom{n}{s}\binom{n}{n-s} = \sum_{s=0}^n \binom{n}{s}\binom{n}{s} = \sum_{s=0}^n \binom{n}{s}^2\)
The sequence \(u_0\), \(u_1\), \(u_2\), ... is defined by $$ u_0=1,\hspace{0.2in} u_1=1, \quad u_{n+1}=u_n+u_{n-1} \hspace{0.2in}{\rm for}\hspace{0.1in}n \ge 1\,. $$ Prove that $$ u^2_{n+2} + u^2_{n-1} = 2( u^2_{n+1} + u^2_n ) \,. $$ Using induction, or otherwise, prove the following result: \[ u_{2n} = u^2_n + u^2_{n-1} \quad \mbox{ and }\quad u_{2n+1} = u^2_{n+1} - u^2_{n-1} \] for any positive integer \(n\).
Solution: Claim: \(u^2_{n+2} + u^2_{n-1} = 2( u^2_{n+1} + u^2_n )\) Proof: (By Induction). (Base Case): \(n = 1\) \begin{align*} && LHS &= u_{n+2}^2 + u_{n-1}^2 \\ &&&= u_3^2 + u_0^2 \\ &&&= 3^2 + 1^2 = 10\\ && RHS &= 2(u_{n+1}^2+u_n^2) \\ &&&= 2(2^2 + 1^2) \\ &&&= 10 \end{align*} Therefore the base case is true. (Inductive hypothesis) Suppose \(u^2_{n+2} + u^2_{n-1} = 2( u^2_{n+1} + u^2_n )\) is true for some \(n = k\), ie \(u^2_{k+2} + u^2_{k-1} = 2( u^2_{k+1} + u^2_k )\), the consider \(n = k+1\) \begin{align*} && LHS &= u_{k+1+2}^2 + u_{k+1-1}^2 \\ &&&= (u_{k+1}+u_{k+2})^2+u_k^2 \\ &&&= u_{k+2}^2+u_{k+1}^2+ u_k^2 + 2u_{k+1}u_{k+2} \\ &&&= u_{k+2}^2+u_{k+1}^2+ u_k^2 + 2u_{k+1}(u_{k+1}+u_k) \\ &&&= u_{k+2}^2 + u_{k+1}^2+u_k^2+2u_{k+1}^2+2u_{k+1}u_k \\ &&&= u_{k+1}^2+2u_{k+1}^2+ u_{k+1}^2+u_k^2+2u_{k+1}u_k \\ &&&= u_{k+2}^2+2u_{k+1}^2+ (u_{k+1}+u_k)^2 \\ &&&= u_{k+2}^2+2u_{k+1}^2+ u_{k+2}^2 \\ &&&=2(u_{k+2}^2+u_{k+1}^2) \\ &&&= RHS \end{align*} Therefore it is true for \(n = k+1\). Therefore by the principle of mathematical induction it is true for all \(n \geq 1\) Claim: $ u_{2n} = u^2_n + u^2_{n-1} \quad \mbox{ and }\quad u_{2n+1} = u^2_{n+1} - u^2_{n-1} $ Proof: Notice that \(\begin{pmatrix}u_{n+1} \\ u_n \end{pmatrix}= \begin{pmatrix} 1 & 1 \\ 1 & 0 \end{pmatrix}^n \begin{pmatrix}1 \\1 \end{pmatrix}\), in particular \begin{align*} && \begin{pmatrix}u_{n}& u_{n-1} \\ u_{n-1} & u_{n-2} \end{pmatrix}&= \begin{pmatrix} 1 & 1 \\ 1 & 0 \end{pmatrix}^{n} \\ \Rightarrow && \begin{pmatrix}u_{2n}& u_{2n-1} \\ u_{2n-1} & u_{2n-2} \end{pmatrix}&= \begin{pmatrix} 1 & 1 \\ 1 & 0 \end{pmatrix}^{2n} \\ &&&= \begin{pmatrix} 1 & 1 \\ 1 & 0 \end{pmatrix}^{n} \begin{pmatrix} 1 & 1 \\ 1 & 0 \end{pmatrix}^{n} \\ &&&=\begin{pmatrix}u_{n}& u_{n-1} \\ u_{n-1} & u_{n-2} \end{pmatrix}\begin{pmatrix}u_{n}& u_{n-1} \\ u_{n-1} & u_{n-2} \end{pmatrix}\\ &&&= \begin{pmatrix}u_{n}^2+u_{n-1}^2& u_{n-1}(u_n+u_{n-2}) \\ u_{n-1}(u_n+u_{n-2}) & u_{n-1}^2+u_{n-2}^2 \end{pmatrix} \end{align*} Therefore \(u_{2n} = u_{n}^2+u_{n-1}^2\) and \(u_{2n+1} = u_n(u_{n+1}+u_{n-1}) =(u_{n+1}-u_{n-1})(u_{n+1}-u_{n-1}) = u_{n+1}^2-u_{n-1}^2\)
Find constants \(a_{0}\), \(a_{1}\), \(a_{2}\), \(a_{3}\), \(a_{4}\), \(a_{5}\), \(a_{6}\) and \(b\) such that \[x^{4}(1-x)^{4}=(a_{6}x^{6}+a_{5}x^{5}+a_{4}x^{4}+a_{3}x^{3}+ a_{2}x^{2}+a_{1}x+a_{0})(x^{2}+1)+b.\] Hence, or otherwise, prove that \[\int_{0}^{1}\frac{x^{4}(1-x)^{4}}{1+x^{2}}{\rm d}x =\frac{22}{7}-\pi.\] Evaluate \(\displaystyle{\int_{0}^{1}x^{4}(1-x)^{4}{\rm d}x}\) and deduce that \[\frac{22}{7}>\pi>\frac{22}{7}-\frac{1}{630}.\]
Solution: Plugging in \(x = i\) we obtain \((1-i)^4 = (-2i)^2 = -4 \Rightarrow b = -4\). \begin{align*} x^4(1-x)^4 &= x^4(1-4x+6x^2-4x^3+x^4) \\ &= x^8-4x^7+6x^6-4x^5+x^4 \\ &= x^6(x^2+1) - x^6 -4x^7+6x^6-4x^5+x^4 \\ &= x^6(x^2+1) -4x^5(x^2+1)+4x^5 +5x^6-4x^5+x^4 \\ &= (x^6-4x^5)(x^2+1) +5x^4(x^2+1)-5x^4+x^4 \\ &= (x^6-4x^5+5x^4)(x^2+1) -4x^2(x^2+1)+4x^2 \\ &= (x^6-4x^5+5x^4-4x^2)(x^2+1) +4(x^2+1)-4 \\ &= (x^6-4x^5+5x^4-4x^2+4)(x^2+1) -4 \\ \end{align*} So \begin{align*} \int_0^1 \frac{x^4(1-x)^4}{1+x^2} \d x &= \int_0^1 (x^6-4x^5+5x^4-4x^2+4) - \frac{4}{1+x^2} \d x \\ &= \frac17 - \frac46+1-\frac43+4 - \pi \\ &= \frac{22}7 - \pi \end{align*} \begin{align*} \int_0^1 x^4(1-x)^4 \d x &= B(5,5) \\ &= \frac{4!4!}{9!} \\ &= \frac1{630} \end{align*} Therefore since \(0 < \frac{x^4(1-x)^4}{1+x^2} < x^4(1-x)^4\) we must have that \begin{align*} && 0 &< \frac{22}7 - \pi \\ \Rightarrow && \pi & < \frac{22}{7} \\ && \frac{22}{7} - \pi &< \frac1{630} \\ \Rightarrow && \frac{22}{7} - \frac1{630} &< \pi \end{align*} which is what we wanted.
Given that \(b>a>0\), find, by using the binomial theorem, coefficients \(c_{m}\) (\(m=0,1,2,\ldots\)) such that \[ \frac{1}{\left(1-ax\right)\left(1-bx\right)}=c_{0}+c_{1}x+c_{2}x^{2}+\ldots+c_{m}x^{m}+\cdots \] for \(b\left|x\right|<1\). Show that \[ c_{m}^{2}=\frac{a^{2m+2}-2(ab)^{m+1}+b^{2m+2}}{(a-b)^{2}}\,. \] Hence, or otherwise, show that \[ c_{0}^{2}+c_{1}^{2}x+c_{2}^{2}x^{2}+\cdots+c_{m}^{2}x^{m}+\cdots=\frac{1+abx}{\left(1-abx\right)\left(1-a^{2}x\right)\left(1-b^{2}x\right)}\,, \] for \(x\) in a suitable interval which you should determine.
Solution: \begin{align*} \frac{1}{(1-ax)(1-bx)} &=\frac{1}{b-a} \l \frac{b}{1-bx}-\frac{a}{1-ax}\r \\ &= \frac{1}{b-a} \l \sum_{k=0}^{\infty} b(bx)^k-\sum_{k=0}^{\infty} a(ax)^k \r \\ &= \frac{1}{b-a} \sum_{k=0}^{\infty} \l b^{k+1} - a^{k+1} \r x^k \end{align*} Therefore \(\displaystyle c_m = \frac{b^{k+1}-a^{k+1}}{b-a}\). \begin{align*} c_m^2 &= \frac{(b^{m+1}-a^{m+1})^2}{(b-a)^2} \\ &= \frac{a^{2m+2} - 2(ab)^{m+1} + b^{2m+2}}{(b-a)^2} \end{align*} \begin{align*} \sum_{m=0}^{\infty} c_m x^m &= \sum_{m=0}^{\infty} \l \frac{a^{2m+2} - 2(ab)^{m+1} + b^{2m+2}}{(b-a)^2} \r x^m \\ &= \frac{1}{(b-a)^2} \l \sum_{m=0}^{\infty} a^{2m+2} x^m-2\sum_{m=0}^{\infty} (ab)^{m+1} x^m+\sum_{m=0}^{\infty} b^{2m+2} x^m \r \\ &= \frac{1}{(b-a)^2} \l a^2\sum_{m=0}^{\infty} a^{2m} x^m-2ab\sum_{m=0}^{\infty} (ab)^{m} x^m+b^2\sum_{m=0}^{\infty} b^{2m} x^m \r \\ &= \frac{1}{(b-a)^2} \l \frac{a^2}{1-a^2x^2} - \frac{2ab}{1-abx} + \frac{b^2}{1-b^2x^2}\r \\ &= \frac{1+ab}{(1-a^2x)(1-abx)(1-b^2x)} \end{align*} Where geometric series will converge if \(|a^2x| < 1, |b^2x| < 1, |abx| < 1\), ie \(|x| < \min (\frac{1}{a^2}, \frac{1}{b^2} )\)
Prove that:
Solution: