∫Calc Practice

The Lagrange error bound

Problem 7.264 · 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}{10000} \) at \( \displaystyle x = \frac{1}{2} \)?
  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
  2. \[ 1 \cdot \frac{1}{15360} = \frac{1}{15360} \]
    n = 5: the bound is 1/15360 < 1/10000.✓ Proved
  3. \[ 1 \cdot \frac{1}{1280} = \frac{1}{1280} \]
    n = 4: the bound is 1/1280, not below 1/10000.✓ Proved
Answer \( n = 5 \)

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
LineStatusChecked byDetail
1Reviewedreviewers: gpt-oss:20b, qwen3.6:27b-mlxa sentence; read, not computed
2✓ Provedsympy 1.14.0simplify(lhs - rhs) reduced to 0
3✓ Provedsympy 1.14.0simplify(lhs - rhs) reduced to 0
answer, a second way✓ Checked independentlysympy 1.14.0 + mpmath 1.3.0the bound recomputed at n and n − 1

Reviewers

  • gpt-oss:20b: pass
  • qwen3.6:27b-mlx: pass — The solution correctly applies the Lagrange error bound formula with a valid upper bound M=3 for the derivative on the interval [0, 1/2]. The calculations for n=4 and n=5 are correct, leading to the right conclusion.
Every verdict on record (4)
  • qwen3.6:27b-mlx: pass 2026-10-04 — The solution correctly applies the Lagrange error bound formula with a valid upper bound M=3 for the derivative on the interval [0, 1/2]. The calculations for n=4 and n=5 are correct, leading to the right conclusion.
  • gpt-oss:20b: pass 2026-10-04
  • qwen3.6:27b-mlx: fail (error) 2026-10-04 — The solution claims the bound for n=5 is 1/15360, but using M=3 and x=1/2, the actual Lagrange bound is 3*(1/2)^6 / 6! = 3/3840 = 1/1280, which is not less than 1/10000. The calculation is incorrect, leading to a wrong conclusion.
  • gpt-oss:20b: pass 2026-10-04

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-04 with SymPy 1.14.0.