The Lagrange error bound
Problem 7.477 · easy
What degree \( \displaystyle n \) of Maclaurin polynomial for \( \displaystyle e^{x} \) guarantees, by the Lagrange error bound, an error less than \( \displaystyle \frac{1}{1000} \) at \( \displaystyle x = 1 \)?
- |Rₙ(x)| ≤ M|x|ⁿ⁺¹/(n + 1)!, where M bounds |f⁽ⁿ⁺¹⁾|; here M = 3 because on [0, 1] every derivative of eˣ is at most e < 3.Reviewed
- \[ 1 \cdot \frac{1}{1680} = \frac{1}{1680} \]n = 6: the bound is 1/1680 < 1/1000.✓ Proved
- \[ 1 \cdot \frac{1}{240} = \frac{1}{240} \]n = 5: the bound is 1/240, not below 1/1000.✓ Proved
Answer \( n = 6 \)
Lines: 2 proved, 1 reviewed. The answer was also checked a second way, without looking at the solution. The reviewers disagree about how one step is explained; every verdict is in the receipt.
The full receipt
| Line | Status | Checked by | Detail |
|---|---|---|---|
| 1 | Reviewed | reviewers: gpt-oss:20b, qwen3.6:27b-mlx | a sentence; read, not computed |
| 2 | ✓ Proved | sympy 1.14.0 | simplify(lhs - rhs) reduced to 0 |
| 3 | ✓ Proved | sympy 1.14.0 | simplify(lhs - rhs) reduced to 0 |
| answer, a second way | ✓ Checked independently | sympy 1.14.0 + mpmath 1.3.0 | the bound recomputed at n and n − 1 |
Reviewers
gpt-oss:20b: passqwen3.6:27b-mlx: pass — The solution correctly applies the Lagrange error bound formula, justifies the choice of M, and verifies the inequality for n=6 and n=5 to determine the minimal degree.
Every verdict on record (4)
gpt-oss:20b: pass 2026-10-10qwen3.6:27b-mlx: pass 2026-10-10 — The solution correctly applies the Lagrange error bound formula, justifies the choice of M, and verifies the inequality for n=6 and n=5 to determine the minimal degree.qwen3.6:27b-mlx: inconclusive 2026-10-10 — reviewer response could not be parsed: { "verdict": "fail", "severity": "error", "notes": "The Lagrange error bound formula is incorrect; it should be M|x|^(n+1)/(n+1)!, but the solution uses M|x|^(n+1)/(n+1)! which is correct in form butgpt-oss:20b: pass 2026-10-10
Proved: SymPy reduced the difference between the two sides to zero. Checked independently: a separate
method, named above, confirmed it. Checked numerically: the two sides agree at every sampled point, which is evidence,
not proof. Reviewed: a model or a person read it; that is all a sentence can have. Solution by
generator:structured/lagrange_error, checked 2026-10-10 with SymPy 1.14.0.