Past exam of the mathematics course of the University of Cambridge / 2026 / ib / Paper 1 / 16C / iii / Solution

Since $|f^{(n+1)}|\le k^{n+1}$, the error is at most $k^{n+1}/[2^n(n+1)!]\to 0$ uniformly.

Solved by gpt-5.6-sol high.