Problems

Filters
Clear Filters

11 problems found

2025 Paper 3 Q6
D: 1500.0 B: 1500.0
roots of polynomials symmetric functions Newton's sums complex numbers modulus proof by contradiction power sums inequality

  1. Let \(a\), \(b\) and \(c\) be three non-zero complex numbers with the properties \(a + b + c = 0\) and \(a^2 + b^2 + c^2 = 0\). Show that \(a\), \(b\) and \(c\) cannot all be real. Show further that \(a\), \(b\) and \(c\) all have the same modulus.
  2. Show that it is not possible to find three non-zero complex numbers \(a\), \(b\) and \(c\) with the properties \(a + b + c = 0\) and \(a^3 + b^3 + c^3 = 0\).
  3. Show that if any four non-zero complex numbers \(a\), \(b\), \(c\) and \(d\) have the properties \(a + b + c + d = 0\) and \(a^3 + b^3 + c^3 + d^3 = 0\), then at least two of them must have the same modulus.
  4. Show, by taking \(c = 1\), \(d = -2\) and \(e = 3\) that it is possible to find five real numbers \(a\), \(b\), \(c\), \(d\) and \(e\) with distinct magnitudes and with the properties \(a + b + c + d + e = 0\) and \(a^3 + b^3 + c^3 + d^3 + e^3 = 0\).

Solution:

  1. If \(a,b,c\) were all real then \(a^2+b^2+c^2 = 0 \Rightarrow a,b,c = 0\) but they are non-zero. Therefore they cannot all be real. Since \((a+b+c)^2 = 0\) we must have \(ab+bc+ca = 0\). Therefore \(a,b,c\) must satisfy \(x^3 -abc = 0 \Rightarrow\) they all have the same modulus, since they are all cube roots of the same number.
  2. Notice that \(a^3+b^3+c^3 - 3abc = (a+b+c)(a^2+b^2+c^2 - ab-bc-ca) \Rightarrow abc = 0\) but therefore they cannot all be non-zero.
  3. Suppose \(a+b+c+d = 0\) then note that \(\displaystyle a^2+b^2+c^2+d^2 = (a+b+c+d)^2 - 2\sum_{sym} ab\) and \(\displaystyle a^3+b^3+c^3+d^3 = (a+b+c+d)^3 - 3(a+b+c+d)(ab+ac+ad+bc+bd+cd) + 3(abc+abd+acd+bcd) \Rightarrow abc+abd+acd+bcd = 0\). Therefore \(a,b,c,d\) are roots of a polynomial of the form \(x^4 -kx^2 + l = 0\), but this means they must come in pairs with the same modulus.
  4. Suppose \(c = 1, d = -2, e = 3\) so \(c+d+e = 2\) and \(c^3 + d^3 + e^3 = 1 - 8 + 27 = 20\), so we need to find \(a,b\) satisfying \(a+b = -2, a^2+b^2 = -20\), ie \(4 = (a+b)^2 = -20 + 2ab \Rightarrow ab = 12\), so we need the roots of \(x^2 +2x + 12= 0\) which clearly have different modulus.

View
2021 Paper 2 Q2
D: 1500.0 B: 1500.0
polynomials complex numbers symmetric functions power sums newton's identities roots of equations algebraic manipulation

In this question, the numbers \(a\), \(b\) and \(c\) may be complex.

  1. Let \(p\), \(q\) and \(r\) be real numbers. Given that there are numbers \(a\) and \(b\) such that \[ a + b = p, \quad a^2 + b^2 = q \quad \text{and} \quad a^3 + b^3 = r, \qquad (*) \] show that \(3pq - p^3 = 2r\).
  2. Conversely, you are given that the real numbers \(p\), \(q\) and \(r\) satisfy \(3pq - p^3 = 2r\). By considering the equation \(2x^2 - 2px + (p^2 - q) = 0\), show that there exist numbers \(a\) and \(b\) such that the three equations \((*)\) hold.
  3. Let \(s\), \(t\), \(u\) and \(v\) be real numbers. Given that there are distinct numbers \(a\), \(b\) and \(c\) such that \[ a + b + c = s, \quad a^2 + b^2 + c^2 = t, \quad a^3 + b^3 + c^3 = u \quad \text{and} \quad abc = v, \] show, using part~(i), that \(c\) is a root of the equation \[ 6x^3 - 6sx^2 + 3(s^2 - t)x + 3st - s^3 - 2u = 0 \] and write down the other two roots. Deduce that \(s^3 - 3st + 2u = 6v\).
  4. Find numbers \(a\), \(b\) and \(c\) such that \[ a + b + c = 3, \quad a^2 + b^2 + c^2 = 1, \quad a^3 + b^3 + c^3 = -3 \quad \text{and} \quad abc = 2, \qquad (**) \] and verify that your solution satisfies the four equations \((**)\).

View
2014 Paper 3 Q1
D: 1700.0 B: 1542.2
roots of polynomials symmetric functions Newton's sums logarithmic series power sums series expansion proof by counterexample

Let \(a\), \(b\) and \(c\) be real numbers such that \(a+b+c=0\) and let \[(1+ax)(1+bx)(1+cx) = 1+qx^2 +rx^3\,\] for all real \(x\). Show that \(q = bc+ca+ab\) and \(r= abc\).

  1. Show that the coefficient of \(x^n\) in the series expansion (in ascending powers of \(x\)) of \(\ln (1+qx^2+rx^3)\) is \((-1)^{n+1} S_n\) where \[S_n = \frac{a^n+b^n+c^n}{n} \,, \ \ \ \ \ \ \ \ (n\ge1).\]
  2. Find, in terms of \(q\) and \(r\), the coefficients of \(x^2\), \(x^3\) and \(x^5\) in the series expansion (in ascending powers of \(x\)) of \(\ln (1+qx^2+rx^3)\) and hence show that \(S_2S_3 =S_5\).
  3. Show that \(S_2S_5 =S_7\).
  4. Give a proof of, or find a counterexample to, the claim that \(S_2S_7=S_9\).

Solution: \begin{align*} (1+ax)(1+bx)(1+cx) &= (1+(a+b)x+abx^2)(1+cx) \\ &= 1+(a+b+c)x+(ab+bc+ca)x^2+abcx^3 \end{align*} Therefore by comparing coefficients, \(q = bc + ca + ab\) and \(r = abc\) as required.

  1. \begin{align*} \ln (1+qx^2 + rx^3) &= \ln(1+ax) + \ln(1+bx)+\ln(1+cx) \\ &= -\sum_{n=1}^{\infty} \frac{(-ax)^n}{n}-\sum_{n=1}^{\infty} \frac{(-bx)^n}{n}-\sum_{n=1}^{\infty} \frac{(-cx)^n}{n} \\ &= \sum_{n=1}^{\infty} \frac{(-1)^{n+1}(a^n+b^n+c^n)}{n} x^n \\ &= \sum_{n=1}^{\infty} (-1)^{n+1} S_n x^n \\ \end{align*}
  2. \begin{align*} \ln (1 + qx^2 + rx^3) &= (qx^2+rx^3) -\frac{(qx^2+rx^3)^2}{2} + O(x^6) \\ &= qx^2 + rx^3 - \frac12 q^2 x^4 - qr x^5 + O(x^6) \\ \end{align*} Comparing coefficients we see that \(S_2 = -q\) and \(S_3 = r\), we also must have \(S_5 = -qr = S_2S_3\) as required.
  3. \begin{align*} \ln (1 + qx^2 + rx^3) &= (qx^2+rx^3) -\frac{(qx^2+rx^3)^2}{2} +\frac{(qx^2+rx^3)^3}{3}+ O(x^8) \\ &= qx^2 + rx^3 - \frac12 q^2 x^4 - qr x^5 + \frac12 rx^6 + \frac13 q^3 x^6 + q^2r x^7 + O(x^8) \\ &= qx^2 + rx^3 - \frac12 q^2 x^4 - qr x^5 + \left ( \frac12 r+ \frac13 q^3 \right)x^6 + q^2r x^7 \end{align*} Comparing coefficients we see that \(S_2 = -q\) and \(S_5 =-qr\), we also must have \(S_7 = q^2r = S_2S_5\) as required.
  4. Let \(a = b = 1, c = -2\), then \(S_2 = \frac{1^2+1^2 + (-2)^2}{2} = 3, S_7 = \frac{1^2+1^2+(-2)^7}{7} = -18, S_9 = \frac{1^1+1^2+(-2)^9}{9} = \frac{2 - 512}{9} \neq 3 \cdot (-18)\)

View
2009 Paper 3 Q5
D: 1700.0 B: 1516.0
roots of polynomials symmetric functions Newton's sums recurrence relation power sums elementary symmetric polynomials cubic

The numbers \(x\), \(y\) and \(z\) satisfy \begin{align*} x+y+z&= 1\\ x^2+y^2+z^2&=2\\ x^3+y^3+z^3&=3\,. \end{align*} Show that \[ yz+zx+xy=-\frac12 \,.\] Show also that \(x^2y+x^2z+y^2z+y^2x+z^2x+z^2y=-1\,\), and hence that \[ xyz=\frac16 \,.\] Let \(S_n=x^n+y^n+z^n\,\). Use the above results to find numbers \(a\), \(b\) and \(c\) such that the relation \[ S_{n+1}=aS_{n}+bS_{n-1}+cS_{n-2}\,, \] holds for all \(n\).

Solution: \begin{align*} && (x+y+z)^2 &= x^2 + y^2 + z^2 + 2(xy+yz+zx) \\ \Rightarrow && 1^2 &= 2 + 2(xy+yz+zx) \\ \Rightarrow && xy+yz+zx &= -\frac12 \end{align*} \begin{align*} && 1 \cdot 2 &= (x+y+z)(x^2+y^2+z^2) \\ &&&= x^3 + y^3 + z^3 + x^2y+x^2z+y^2z+y^2x+z^2x+z^2y \\ &&&= 3 + x^2y+x^2z+y^2z+y^2x+z^2x+z^2y\\ \Rightarrow && -1 &= x^2y+x^2z+y^2z+y^2x+z^2x+z^2y \end{align*} \begin{align*} && (x+y+z)^3 &= x^3 + y^3 + z^3 + \\ &&&\quad \quad 3xy^2 + 3xz^2 + \cdots + 3zx^2 + 3zy^2 + \\ &&&\quad \quad \quad 6xyz \\ \Rightarrow && 1 &= 3 + 3(-1) + 6xyz \\ \Rightarrow && xyz &= \frac16 \end{align*} Since we have \(f(t) = (t-x)(t-y)(t-z) = t^3-t^2-\frac12 t - \frac16\) is zero for \(x,y,z\) we can notice that: \(t^{n+1} = t^n +\frac12 t^{n-1} + \frac16 t^{n-2}\) is also true for \(x,y,z\) (by multiplying by \(t^{n-2}\). Therefore: \(S_{n+1} = S_n + \frac12 S_{n-1} + \frac16 S_{n-2}\)

View
2008 Paper 3 Q1
D: 1700.0 B: 1516.0
roots of polynomials simultaneous equations symmetric functions recurrence relation power sums Newton's sums

Find all values of \(a\), \(b\), \(x\) and \(y\) that satisfy the simultaneous equations \begin{alignat*}{3} a&+b & &=1 &\\ ax&+by & &= \tfrac13& \\ ax^2&+by^2& &=\tfrac15& \\ ax^3 &+by^3& &=\tfrac17\,.& \end{alignat*} \noindent{\bf [} {\bf Hint}: you may wish to start by multiplying the second equation by \(x+y\). {\bf ]}

Solution: This is a second order recurrence relation, so we need to find \(m\) and \(n\) such that; \begin{align*} &&\frac15 &= m\frac13 + n \\ &&\frac17 &= m \frac15 + n\frac13 \\ \Rightarrow && m,n &= \frac67, - \frac{3}{35} \end{align*} So we now need to solve the characteristic equation: \(\lambda^2 - \frac67 \lambda + \frac{3}{35} = 0\) So \(x,y = \frac{15 \pm 2 \sqrt{30}}{35}\). We need, \begin{align*} && 1 &= a+ b \\ && \frac13 &= a \frac{15 + 2 \sqrt{30}}{35} + b \frac{15 - 2 \sqrt{30}}{35} \\ && \frac13 &= \frac{15}{35} + \frac{2 \sqrt{30}}{35}(a-b) \\ \Rightarrow && -\frac{\sqrt{30}}{18} &= a-b \\ \Rightarrow && a &= \frac{18-\sqrt{30}}{36} \\ && b &= \frac{18+\sqrt{30}}{38} \end{align*} So our two answers are: \[ (a,b,x,y) = \left (\frac{18\pm\sqrt{30}}{36} ,\frac{18\mp\sqrt{30}}{36},\frac{15 \pm 2 \sqrt{30}}{35},\frac{15 \mp 2 \sqrt{30}}{35}, \right)\]

View
2008 Paper 3 Q2
D: 1700.0 B: 1555.2
sequences summation binomial theorem recurrence relation proof by induction polynomial power sums

Let \(S_k(n) \equiv \sum\limits_{r=0}^n r^k\,\), where \(k\) is a positive integer, so that \[ S_1(n) \equiv \tfrac12 n(n+1) \text{ and } S_2(n) \equiv \tfrac16 n(n+1)(2n+1)\,. \]

  1. By considering \(\sum\limits_{r=0}^n \left[ (r+1)^k-r^k\right]\, \), show that \[ kS_{k-1}(n)=(n+1)^k -(n+1) - \binom{k}{2} S_{k-2}(n) - \binom {k}{3} S_{k-3}(n) - \cdots - \binom{k}{k-1} S_{1}(n) \;. \tag{\(*\)} \] Obtain simplified expressions for \(S_3(n)\) and \(S_4(n)\).
  2. Explain, using \((*)\), why \(S_k(n)\) is a polynomial of degree \(k+1\) in \(n\). Show that in this polynomial the constant term is zero and the sum of the coefficients is 1.

Solution:

  1. \begin{align*} &&(n+1)^k &= \sum_{r=0}^n \left [ (r+1)^k - r^k \right] \\ &&&= \sum_{r=0}^n \left [ \left ( \binom{k}{0}r^k+\binom{k}1r^{k-1} + \binom{k}{2}r^{k-2} + \cdots + \binom{k}{k} 1 \right) - r^k\right] \\ &&&= \sum_{r=0}^n \left ( \binom{k}1r^{k-1} + \binom{k}{2}r^{k-2} + \cdots + \binom{k}{k} 1 \right) \\ &&&=k \sum_{r=0}^n r^{k-1} + \binom{k}{2}\sum_{r=0}^nr^{k-2} + \cdots + \binom{k}{k} \sum_{r=0}^n 1 \\ &&&= kS_{k-1}(n) + \binom{k}2 S_{k-2}(n) + \cdots +\binom{k}{k-1}S_1(n) + (n+1) \\ \Rightarrow && k S_{k-1}(n) &= (n+1)^k -(n+1) -\binom{k}2 S_{k-2}(n) - \cdots -\binom{k}{k-1}S_1(n) \\ && 4S_3(n) &= (n+1)^4-(n+1) - \binom{4}{2} \frac{n(n+1)(2n+1)}{6} - \binom{4}{3} \frac{n(n+1)}{2} \\ &&&= (n+1) \left ( (n+1)^3-1 - n(2n+1)-2n \right) \\ &&&= (n+1) \left ( n^3+3n^2+3n+1-1 - 2n^2-3n \right) \\ &&&= (n+1) \left ( n^3+n^2 \right) \\ &&&= n^2(n+1)^2 \\ \Rightarrow && S_3(n) &= \frac{n^2(n+1)^2}{4} \\ \\ &&5S_4(n) &=(n+1)^5-(n+1) - \binom{5}{2} \frac{n^2(n+1)^2}4 - \binom{5}{3} \frac{n(n+1)(2n+1)}{6} - \binom{5}{4} \frac{n(n+1)}{2} \\ &&&= (n+1) \left ((n+1)^4 - 1-\frac{5n^2(n+1)}{2} - \frac{5n(2n+1)}{3} -\frac{5n}{2}\right)\\ &&&= \frac{n+1}{6} \left (6(n+1)^4-6-15n^2(n+1)-10n(2n+1)-15n \right) \\ &&&= \frac{n+1}{6} \left (6n^4+24n^3+36n^2+24n+6 -6-15n^3-15n^2-20n^2-10n-15n\right) \\ &&&= \frac{n+1}{6} \left (6n^4+9n^3+n^2-n\right) \\ &&&= \frac{(n+1)n(2n+1)(3n^2+3n-1)}{6} \\ \Rightarrow && S_4(n) &= \frac{(n+1)n(2n+1)(3n^2+3n-1)}{30} \end{align*}
  2. Proceeding by induction, since \(S_k(n)\) is a polynomial of degree \(k+1\) for small \(k\), we can see that \[ (k+1)S_k(n) = \underbrace{(n+1)^{k+1}}_{\text{poly deg }=k+1} - \underbrace{(n+1)}_{\text{poly deg}=1} - \underbrace{\binom{k+1}{2}S_{k-1}(n)}_{\text{poly deg}=k} - \underbrace{\cdots}_{\text{polys deg}< k} - \underbrace{\binom{k+1}{k} S_1(n)}_{\text{poly deg}=1}\] therefore \(S_k(n)\) is a polynomial of degree \(k+1\) (in fact with leading coefficient \(\frac{1}{k+1}\). Since \(S_k(0) = \sum_{r=0}^{0} r^k = 0\) there is no constant term, and since \(S_k(1) = \sum_{r=0}^1 r^k = 1\) the sum of the coefficients is \(1\)

View
1998 Paper 1 Q4
D: 1500.0 B: 1533.8
optimisation circle rectangle inequality calculus maximisation power sums geometric proof

Prove that the rectangle of greatest perimeter which can be inscribed in a given circle is a square. The result changes if, instead of maximising the sum of lengths of sides of the rectangle, we seek to maximise the sum of \(n\)th powers of the lengths of those sides for \(n\geqslant 2\). What happens if \(n=2\)? What happens if \(n=3\)? Justify your answers.

Solution: We can always rotate the circle so that sides are parallel to the \(x\) and \(y\) axes. Therefore if one corner is \((a,b)\) the other coordinates are \((-a,b), (a,-b), (-a,-b)\) and the perimeter will be \(4(a+b)\). Therefore we wish to maximise \(4(a+b)\) subject to \(a^2+b^2 = \text{some constant}\). Notice that \(\frac{a+b}{2} \leq \sqrt{\frac{a^2+b^2}{2}}\) with equality when \(a = b\), therefore the maximum is a square. If \(n = 2\) then we are looking at \(2((2a)^2+(2b)^2) = 8(a^2+b^2)\) which is constant for all rectangles. If \(n=3\) we are maximising \(16(a^3+b^3) = 16(a^3+(c^2-a^2)^{3/2})\) which is maximised when \(a = 0, c\)

View
1996 Paper 3 Q7
D: 1700.0 B: 1515.1
roots of polynomials symmetric functions Newton's sums Vieta's formulas power sums simultaneous equations Heron's formula cubic

  1. If \(x+y+z=\alpha,\) \(xy+yz+zx=\beta\) and \(xyz=\gamma,\) find numbers \(A,B\) and \(C\) such that \[ x^{3}+y^{3}+z^{3}=A\alpha^{3}+B\alpha\beta+C\gamma. \] Solve the equations \begin{alignat*}{1} x+y+z & =1\\ x^{2}+y^{2}+z^{2} & =3\\ x^{3}+y^{3}+z^{3} & =4. \end{alignat*}
  2. The area of a triangle whose sides are \(a,b\) and \(c\) is given by the formula \[ \mathrm{area}=\sqrt{s(s-a)(s-b)(s-c)} \] where \(s\) is the semi-perimeter \(\frac{1}{2}(a+b+c).\) If \(a,b\) and \(c\) are the roots of the equation \[ x^{3}-16x^{2}+81x-128=0, \] find the area of the triangle.

Solution:

  1. \begin{align*} (x+y+z)^3 &= x^3+y^3+z^3+ \\ &\quad 3xy^2 + 3xz^2 + 3yx^2 + \cdots + 3zy^2 \\ &\quad\quad + 6xyz \\ (x+y+z)(xy+yz+zx) &= x^2y+x^2z + \cdots + z^2 x + 3xyz \\ x^3+y^3+z^3 &= (x+y+z)^3 - 3(xy^2 + \cdots + zy^2) - 6xyz \\ &= \alpha^3 - 3(\alpha \beta - 3\gamma)-6\gamma \\ &= \alpha^3-3\alpha \beta+3\gamma \end{align*} Since \(4 = 1^3-3\cdot1\cdot(-1) + 3 \gamma \Rightarrow \gamma = 0\), therefore one of \(x,y,z = 0\). WLOG \(x = 0\), so \(y+z = 1, y^2 + z^2 = 3 \Rightarrow y^2 + (1-y)^2 = 3 \Rightarrow y^2 -y -1 = 0 \Rightarrow y = \frac{1 \pm \sqrt{5}}{2}\), so we have \((x,y,z) = (0, \frac{1 +\sqrt{5}}{2}, \frac{1 - \sqrt{5}}{2})\) and permutations.
  2. \begin{align*} A^2 &= s(s-a)(s-b)(s-c) \\ \end{align*} Notice the second part is the same as plugging \(s= 16/2 = 8\) into our polynomial Therefore \begin{align*} A^2 &= 8 \cdot (8^3 - 16 \cdot 8^2 + 81 \cdot 8 - 128) \\ &= 8 \cdot 8 (8^2 - 16 \cdot 8 + 81- 16) \\ &= 64 (-64+81-16) \\ &= 64 \end{align*} Therefore \(A = 8\)

View
1992 Paper 1 Q5
D: 1484.0 B: 1500.0
polynomials factorization differentiation power sums product expansion combinatorial identity proof

Let \(\mathrm{p}_{0}(x)=(1-x)(1-x^{2})(1-x^{4}).\) Show that \((1-x)^{3}\) is a factor of \(\mathrm{p}_{0}(x).\) If \(\mathrm{p}_{1}(x)=x\mathrm{p}_{0}'(x)\) show, by considering factors of the polynomials involved, that \(\mathrm{p}_{0}'(1)=0\) and \(\mathrm{p}_{1}'(1)=0.\) By writing \(\mathrm{p}_{0}(x)\) in the form \[ \mathrm{p}_{0}(x)=c_{0}+c_{1}x+c_{2}x^{2}+c_{3}x^{3}+c_{4}x^{4}+c_{5}x^{5}+c_{6}x^{6}+c_{7}x^{7}, \] deduce that \begin{alignat*}{2} 1+2+4+7 & \quad=\quad & & 3+5+6\\ 1^{2}+2^{2}+4^{2}+7^{2} & \quad=\quad & & 3^{2}+5^{2}+6^{2}. \end{alignat*} Show that we can write the integers \(1,2,\ldots,15\) in some order as \(a_{1},a_{2},\ldots,a_{15}\) in such a way that \[ a_{1}^{r}+a_{2}^{r}+\cdots+a_{8}^{r}=a_{9}^{r}+a_{10}^{r}+\cdots+a_{15}^{r} \] for \(r=1,2,3.\)

Solution: \begin{align*} && p_0(x) &= (1-x)(1-x^2)(1-x^4) \\ &&&= (1-x)(1-x)(1+x)(1-x^2)(1+x^2) \\ &&&= (1-x)^2 (1+x)(1-x)(1+x)(1+x^2) \\ &&&= (1-x)^3 (1+x)^2 (1+x^2) \end{align*} \begin{align*} && p_0'(x) &= 3(1-x)^2(1+x)^2(1+x^2) + (1-x)^3 q(x) \\ \Rightarrow && p_0'(1) &= 3 \cdot 0 \cdots + 0 \cdots \\ &&&= 0 \\ && p_1'(x) &= p_0(x) + xp'_0(x) \\ \Rightarrow && p_1'(1) &= p_0(1) + 1\cdot p_0'(1) \\ &&&= 0 + 1 \cdot 0 \\ &&&= 0 \end{align*} Notice that \(p_0(x) = (1-x-x^2+x^3)(1-x^4) = 1-x-x^2+x^3-x^4+x^5+x^6-x^7\), so: \(p'_0(x) = -1-2x+3x^2-4x^3+5x^4+6x^5-7x^6 \Rightarrow p'_0(1) = 0 = -1 -2 -4 -7 + 3 + 5+6\). \((xp'_1(1))' = 0 = -1^2-2^2-4^2-7^2 + 3^2 + 5^2 + 6^2\). Consider \(q_0(x) = (1-x)(1-x^2)(1-x^4)(1-x^8)\), then \((1-x)^4\) is a factor, so in particular we know \(q_0(1), (xq_0(x))'|_{x=1} = 0,(x(xq_0(x))')'|_{x=1} = 0\), and so: \(q_0(x) = 1-x-x^2+x^3-x^4+x^5+x^6-x^7 - x^8+x^9+x^{10}-x^{11}+x^{12}-x^{13}-x^{14}+x^{15}\), and so: \(1^r+2^r+4^r+7^r+8^r+11^r+13^r+14^r = 3^r+5^r+6^r+9^r+10^r+12^r+15^r\) for \(r = 1,2,3\)

View
1991 Paper 3 Q10
D: 1700.0 B: 1516.0
roots of polynomials symmetric functions Newton's sums proof by induction power sums Vieta's formulas recurrence relation

The equation \[ x^{n}-qx^{n-1}+r=0, \] where \(n\geqslant5\) and \(q\) and \(r\) are real constants, has roots \(\alpha_{1},\alpha_{2},\ldots,\alpha_{n}.\) The sum of the products of \(m\) distinct roots is denoted by \(\Sigma_{m}\) (so that, for example, \(\Sigma_{3}=\sum\alpha_{i}\alpha_{j}\alpha_{k}\) where the sum runs over the values of \(i,j\) and \(k\) with \(n\geqslant i>j>k\geqslant1\)). The sum of \(m\)th powers of the roots is denoted by \(S_{m}\) (so that, for example, \(S_{3}=\sum\limits_{i=1}^{n}\alpha_{i}^{3}\)). Prove that \(S_{p}=q^{p}\) for \(1\leqslant p\leqslant n-1.\) You may assume that for any \(n\)th degree equation and \(1\leqslant p\leqslant n\) \[ S_{p}-S_{p-1}\Sigma_{1}+S_{p-2}\Sigma_{2}-\cdots+(-1)^{p-1}S_{1}\Sigma_{p-1}+(-1)^{p}p\Sigma_{p}=0.] \] Find expressions for \(S_{n},\) \(S_{n+1}\) and \(S_{n+2}\) in terms of \(q,r\) and \(n\). Suggest an expression for \(S_{n+m},\) where \(m < n\), and prove its validity by induction.

Solution: Claim: \(S_p = q^p\) for \(1 \leq p \leq n-1\) Proof: When \(p = 1\), \(S_p = \Sigma_1 = q\) as expected. Note that \(\Sigma_i = 0\) for \(i = 2, \cdots, n-1\). Using \(S_p = S_{p-1}\Sigma_{1}-S_{p-2}\Sigma_{2}+\cdots+(-1)^{p-1+1}S_{1}\Sigma_{p-1}+(-1)^{p+1}p\Sigma_{p}\), we can see that \(S_p = qS_{p-q}\) when \(1 \leq p \leq n-1\), ie \(S_p = q^p\). Note that \begin{align*} S_n &= \sum \alpha_i^n \\ &= q\sum \alpha_i^{n-1} - \sum r \\ &= qS_{n-1} - nr \\ &= q^n - nr \\ \\ S_{n+1} &= \sum \alpha_i^{n+1} \\ &= q \sum \alpha_i^{n} - r \sum \alpha_i \\ &= q^{n+1} - rq \\ \\ S_{n+2} &= \sum \alpha_i^{n+2} \\ &= q \sum \alpha_i^{n+1} - r \sum \alpha_i^2 \\ &= q^{n+2} - rq^2 \\ \end{align*} Claim: \(S_{n+m} = q^{n+m} - rq^{m}\) Proof: The obvious

View
1987 Paper 3 Q10
D: 1500.0 B: 1500.0
proof by induction Bernoulli polynomials integration differentiation summation telescoping polynomial recurrence power sums

The Bernoulli polynomials \(P_{n}(x)\), where \(n\) is a non-negative integer, are defined by \(P_{0}(x)=1\) and, for \(n\geqslant1\), \[ \frac{\mathrm{d}P_{n}}{\mathrm{d}x}=nP_{n-1}(x),\qquad\int_{0}^{1}P_{n}(x)\,\mathrm{d}x=0 \] Show by induction or otherwise, that \[ P_{n}(x+1)-P_{n}(x)=nx^{n-1},\quad\mbox{ for }n\geqslant1. \] Deduce that \[ n\sum_{m=0}^{k}m^{n-1}=P_{n}(k+1)-P_{n}(0) \] Hence show that \({\displaystyle \sum_{m=0}^{1000}m^{3}=(500500)^{2}}\)

Solution: \(\displaystyle \int_x^{x+1} nP_{n-1}(x) \, dx = P_n(x+1) - P_n(x)\) Claim: \(P_{n}(x+1)-P_{n}(x)=nx^{n-1},\) for \(n \geq 1\) Proof: (By induction). (Base case, \(n=1\)). \(P_1(x) = x - \frac12\), \(P_1(x+1) - P_1(x) = 1 x^{0}\) as required. Assume the equation is true for \(n = k\). So \(P_k(x+1) - P_k(x) = kx^{k-1}\) now consider \begin{align*} P_{k+1}(x+1) - P_{k+1}(x) &= \int_0^{x+1} (k+1) P_k(t) \d t + P_{k+1}(0)- \int_0^{x} (k+1) P_k(t) \d t - P_{k+1}(0) \\ &= \int_0^x (k+1)(P_k(t+1)-P_k(t)) \d t + \int_0^1 (k+1)P_k(t) \d t \\ &= (k+1)x^{k} + 0 \end{align*} So by induction we are done. \begin{align*} n\sum_{m=0}^{k}m^{n-1} &= \sum_{m=0}^{k}n \cdot m^{n-1} \\ &= \sum_{m=0}^{k}\l P_n(m+1)-P_n(m) \r \\ &= P_n(k+1) - P_n(0) \end{align*} We need to find \(P_4\) \begin{align*} P_0(x) &= 1 \\ P_1(x) &= x - \frac12 \\ P_2(x) &= x^2 -x - \int_0^1 \l x^2 - x \r \d x \\ &= x^2 - x + \frac16 \\ P_3(x) &= x^3 -\frac{3}{2}x^2 + \frac12x - \int_0^1 \l x^3 -\frac{3}{2}x^2 + \frac12x \r \d x \\ &= x^3 -\frac{3}{2}x^2 + \frac12x \\ P_4(x) &= x^4 - 2x^3 + x^2 + c \end{align*} Therefore the sum we are interested in is \(\frac14 \l P_4(1001) - P_4(0) \r = \frac14 (1001)^2 (1001-1)^2 = (1001 \cdot 500)^2 = (500500)^2\)

View