PastPaper.workedSolution
(a) Since \(x = \cos\theta\), for \(n = 0\), we have \(T_0(\cos\theta) = \cos(0) = 1\), which gives \(T_0(x) = 1\). For \(n = 1\), we have \(T_1(\cos\theta) = \cos\theta\), which gives \(T_1(x) = x\).
(b) Starting with the trigonometric identity:
\(\cos((n+1)\theta) + \cos((n-1)\theta) = 2\cos\theta\cos(n\theta)\)
By definition, \(T_k(\cos\theta) = \cos(k\theta)\), so we can substitute this to get:
\(T_{n+1}(\cos\theta) + T_{n-1}(\cos\theta) = 2\cos\theta T_n(\cos\theta)\)
Substituting \(x = \cos\theta\) yields:
\(T_{n+1}(x) + T_{n-1}(x) = 2xT_n(x)\)
Rearranging this gives:
\(T_{n+1}(x) = 2xT_n(x) - T_{n-1}(x)\).
(c) Using the recurrence relation:
\(T_2(x) = 2xT_1(x) - T_0(x) = 2x(x) - 1 = 2x^2 - 1\)
\(T_3(x) = 2xT_2(x) - T_1(x) = 2x(2x^2 - 1) - x = 4x^3 - 3x\)
\(T_4(x) = 2xT_3(x) - T_2(x) = 2x(4x^3 - 3x) - (2x^2 - 1) = 8x^4 - 8x^2 + 1\).
(d) Let \(P(n)\) be the statement: 'The leading coefficient of \(T_n(x)\) is \(2^{n-1}\)'.
For \(n=1\), \(T_1(x) = x\), which has leading coefficient \(1 = 2^0\). So \(P(1)\) is true.
For \(n=2\), \(T_2(x) = 2x^2 - 1\), which has leading coefficient \(2 = 2^1\). So \(P(2)\) is true.
Assume \(P(k-1)\) and \(P(k)\) are true for some integer \(k \ge 2\). This means the leading term of \(T_k(x)\) is \(2^{k-1}x^k\) and the leading term of \(T_{k-1}(x)\) is \(2^{k-2}x^{k-1}\).
Using the recurrence relation:
\(T_{k+1}(x) = 2xT_k(x) - T_{k-1}(x)\)
The leading term of \(2xT_k(x)\) is \(2x \cdot (2^{k-1}x^k) = 2^k x^{k+1}\). Since the degree of \(T_{k-1}(x)\) is \(k-1\), which is strictly less than \(k+1\), it does not affect the highest degree term of \(T_{k+1}(x)\).
Thus, the leading term of \(T_{k+1}(x)\) is \(2^k x^{k+1}\), which means its leading coefficient is \(2^k = 2^{(k+1)-1}\). Therefore, \(P(k+1)\) is true.
By the principle of mathematical induction, \(P(n)\) is true for all integers \(n \ge 1\).
(e) Set \(T_n(x) = 0\), which means \(\cos(n\theta) = 0\).
Thus, \(n\theta = \frac{\pi}{2} + k\pi = \frac{(2k+1)\pi}{2}\) for \(k \in \mathbb{Z}\).
So \(\theta_k = \frac{(2k+1)\pi}{2n}\).
To obtain unique values of \(x = \cos\theta\) in \([-1, 1]\), we choose \(\theta \in [0, \pi]\), which corresponds to \(k = 0, 1, \dots, n-1\).
Thus, the roots are \(x_k = \cos\left(\frac{(2k+1)\pi}{2n}\right)\) for \(k = 0, 1, \dots, n-1\).
(f) The absolute maximum value of \(|T_n(x)|\) on \([-1, 1]\) is \(1\). These occur when \(\cos(n\theta) = \pm 1\).
This gives \(n\theta = k\pi\), so \(\theta_k = \frac{k\pi}{n}\).
To restrict \(\theta \in [0, \pi]\), we choose \(k = 0, 1, \dots, n\).
The \(x\)-coordinates of the extrema are \(x_k = \cos\left(\frac{k\pi}{n}\right)\).
The corresponding \(y\)-coordinates are \(T_n(x_k) = \cos(k\pi) = (-1)^k\).
Thus, the coordinates of the local extrema on \([-1, 1]\) are \(\left(\cos\left(\frac{k\pi}{n}\right), (-1)^k\right)\) for \(k = 0, 1, \dots, n\).
(g) (i) The leading coefficient of \(T_n(x)\) is \(2^{n-1}\). Thus, the leading coefficient of \(P_n(x) = 2^{1-n}T_n(x)\) is \(2^{1-n} \cdot 2^{n-1} = 2^0 = 1\). Since its leading coefficient is \(1\), \(P_n(x)\) is monic.
(ii) Since the maximum value of \(|T_n(x)|\) on \([-1, 1]\) is \(1\), the maximum value of \(|P_n(x)|\) is \(2^{1-n} \cdot 1 = 2^{1-n}\).
(h) (i) Since both \(P_n(x)\) and \(Q_n(x)\) are monic polynomials of degree \(n\), their leading terms \(x^n\) cancel when subtracted. Thus, the maximum possible degree of \(F(x) = P_n(x) - Q_n(x)\) is \(n-1\).
(ii) At the points \(x_k = \cos\left(\frac{k\pi}{n}\right)\) (where \(k = 0, 1, \dots, n\)), we have \(P_n(x_k) = 2^{1-n}(-1)^k\). By assumption, \(|Q_n(x_k)| < 2^{1-n}\).
If \(k\) is even, \(P_n(x_k) = 2^{1-n}\), so \(F(x_k) = 2^{1-n} - Q_n(x_k) > 0\).
If \(k\) is odd, \(P_n(x_k) = -2^{1-n}\), so \(F(x_k) = -2^{1-n} - Q_n(x_k) < 0\).
Thus, the sign of \(F(x_k)\) is positive for even \(k\) and negative for odd \(k\). Since \(F(x)\) is continuous and changes sign between each consecutive pair of points \(x_k\) and \(x_{k+1}\), the Intermediate Value Theorem guarantees that \(F(x)\) must have at least one root in each of the \(n\) intervals between these points. Hence, \(F(x)\) has at least \(n\) distinct roots.
(iii) A non-zero polynomial of degree at most \(n-1\) can have at most \(n-1\) roots. Since \(F(x)\) has at least \(n\) roots, \(F(x)\) must be the zero polynomial. However, \(F(x_k) \neq 0\) for all \(k\), so \(F(x)\) is not the zero polynomial, which is a contradiction. Thus, no such monic polynomial \(Q_n(x)\) exists, proving that the maximum absolute value of any monic polynomial of degree \(n\) on \([-1, 1]\) is at least \(2^{1-n}\).
PastPaper.markingScheme
(a) [2 marks]
M1 for substituting \(n=0, 1\) into the definition.
A1 for correctly showing \(T_0(x) = 1\) and \(T_1(x) = x\).
(b) [3 marks]
M1 for substituting \(T_k(\cos\theta) = \cos(k\theta)\) into the trigonometric identity.
M1 for replacing \(\cos\theta\) with \(x\).
A1 for completing the proof of the recurrence relation.
(c) [3 marks]
A1 for \(T_2(x) = 2x^2 - 1\).
A1 for \(T_3(x) = 4x^3 - 3x\).
A1 for \(T_4(x) = 8x^4 - 8x^2 + 1\).
(d) [3 marks]
M1 for establishing base cases \(n=1, 2\).
M1 for stating induction hypothesis and substituting into recurrence relation.
A1 for demonstrating the leading coefficient is \(2^k\) for \(T_{k+1}(x)\) and completing the induction step.
(e) [3 marks]
M1 for setting \(\cos(n\theta) = 0\).
M1 for finding \(\theta_k = \frac{(2k+1)\pi}{2n}\).
A1 for writing \(x_k = \cos\left(\frac{(2k+1)\pi}{2n}\right)\) for \(k=0, 1, \dots, n-1\).
(f) [4 marks]
M1 for identifying that extrema occur where \(T_n(x) = \pm 1\).
A1 for finding \(\theta_k = \frac{k\pi}{n}\).
A1 for obtaining \(x_k = \cos\left(\frac{k\pi}{n}\right)\).
A1 for obtaining \(y_k = (-1)^k\) and writing the complete coordinates.
(g) [3 marks]
(i) A1 for showing that the leading coefficient of \(P_n(x)\) is \(2^{1-n} \cdot 2^{n-1} = 1\).
(ii) M1 for relating the maximum of \(|P_n(x)|\) to that of \(|T_n(x)|\).
A1 for concluding that the maximum absolute value is \(2^{1-n}\).
(h) [6.5 marks]
(i) A1 for stating the maximum possible degree of \(F(x)\) is \(n-1\).
(ii) M1 for finding the value of \(P_n(x_k)\).
M1 for determining that \(F(x_k) > 0\) for even \(k\) and \(F(x_k) < 0\) for odd \(k\).
M1 for applying the Intermediate Value Theorem to show a root exists in each interval.
A1.5 for concluding there are at least \(n\) distinct roots.
(iii) A1 for explaining the contradiction: a non-zero polynomial of degree at most \(n-1\) cannot have \(n\) roots unless it is identically zero, which contradicts \(F(x_k) \neq 0\).