On the remainder in the Taylor theorem
classification
🧮 math.CA
keywords
proofgivetaylortheoremattractiveboundfactimplies
read the original abstract
We give a short straightforward proof for the bound of the reminder term in the Taylor theorem. The proof uses only induction and the fact that $f'\geq 0$ implies the monotonicity of $f$, so it might be an attractive proof to give to undergraduate students.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.