Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2008/iii/paper-75/3/c/solution
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 75 3 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For each , choose the best uniform approximation . If its error is nonzero, take its alternating extrema. The intermediate value theorem supplies a point strictly between the th and st extrema such that , for . These points are distinct. The polynomial interpolation problem at them has a unique solution of degree at most , so its solution is exactly . This constructs the interpolation nodes from best uniform approximation.
If , then itself belongs to the polynomial space, and any distinct nodes give the same conclusion. In either case, take or the arbitrary nodes just described. ThenThe Weierstrass approximation theorem gives ; alternatively, the bound derived in part 4(b), combined with uniform continuity, gives this convergence directly. ThereforeThe nodes may depend on and on . The conclusion does not assert a universal sequence of interpolation grids working for every continuous target.
New to topics? Read the docs here!