Independent study guide

Taylor Approximation: How Accurate Is Your Polynomial?

Build a Taylor polynomial, justify an error bound and choose enough terms for a target accuracy. Two worked examples, a graph and four graduated questions with hints and explained answers.

Nablio · 25 minPublished

Stuck on a step? Text us Email us Request a lesson

For course topics and one-to-one help, see Concordia MATH 205 tutoring.

A polynomial can replace a harder function when you need a quick estimate or a simple local model. But an estimate is more useful when you can say how far it might be from the true value. Here the goal is to produce both: an approximation and a justified maximum error.

You will approximate a logarithm near a known value, choose enough terms for an exponential, then try four questions with separate hints and answers. Be comfortable taking derivatives and working with powers. All inputs and outputs in this lesson are dimensionless; trigonometric inputs are in radians.

This original practice supports the Taylor and Maclaurin topics listed in Concordia MATH 205. It focuses on finite approximations. For the different question of where an infinite power series converges, use power-series intervals and endpoints.

For Fall 2026, Concordia’s MATH 205 outline explicitly omits Taylor Inequality. Treat the error-bound work in this lesson as enrichment unless your instructor includes it; follow your section’s current outline for assessed material.

1. Build a polynomial at a useful centre

Let ff be the function to approximate, aa a fixed centre, and xx the input of interest. Choose a centre where the function and its derivatives are easy to evaluate, preferably close to xx. The distance is ∣x−a∣|x-a|, not necessarily ∣x∣|x|.

The Taylor polynomial of order nn, written PnP_n, uses derivatives through order nn:

Pn(x)=∑k=0nf(k)(a)k!(x−a)k.P_n(x)=\sum_{k=0}^{n}\frac{f^{(k)}(a)}{k!}(x-a)^k.

Here nn is a nonnegative integer. The index kk runs from 0 to nn, so the sum has n+1n+1 terms before any zero coefficients are removed. The notation f(k)f^{(k)} means the kkth derivative, with f(0)=ff^{(0)}=f. The factorial k!k! is the product of the integers from 1 to kk; 0!=10!=1. In particular, 2!=22!=2 and 3!=63!=6.

For order two, write the short form:

P2(x)=f(a)+f′(a)(x−a)+f′′(a)2(x−a)2.\begin{aligned}P_2(x)&=f(a)+f'(a)(x-a)\\&\quad+\frac{f''(a)}{2}(x-a)^2.\end{aligned}

The constant matches the function’s value, the linear term matches its slope, and the quadratic term matches its second derivative at the centre. The division by 2!2! compensates for differentiating a square twice. The same idea explains the other factorials.

Order and degree: PnP_n has degree at most nn. Some coefficients can be zero. When a=0a=0, it is called a Maclaurin polynomial; the method is unchanged.

In the graph, exe^x is the natural exponential, with e≈2.718e\approx2.718.

On the interval from minus one to one, the exponential and its linear and cubic Maclaurin polynomials meet at zero with value one. The cubic curve follows the exponential more closely than the tangent line in this plotted interval; the graph alone does not certify an error bound.
Figure 1. The solid curve is exe^x, the dashed line is the linear polynomial P1P_1, and the dash-dot curve is the cubic polynomial P3P_3. Agreement near the centre motivates the method. The next derivative supplies the guarantee.

2. Turn the next derivative into an error bound

The remainder is the signed difference between the true function and the polynomial:

Rn(x)=f(x)−Pn(x).R_n(x)=f(x)-P_n(x).

A sufficient condition for the bound below is that ff has continuous derivatives through order n+1n+1 on an open interval containing the whole segment from aa to xx. Choose a number M≥0M\ge0 such that

∣f(n+1)(t)∣≤M|f^{(n+1)}(t)|\le M

for every input tt between aa and xx, including the endpoints. The letter tt is a temporary input used to check that segment. Taylor’s theorem then gives

∣Rn(x)∣≤M∣x−a∣n+1(n+1)!.|R_n(x)|\le\frac{M|x-a|^{n+1}}{(n+1)!}.

Call the right-hand side BB. It is an upper bound, not usually the actual error. You do not need the smallest possible MM; any justified upper bound works. The theorem and its hypotheses are reviewed in OpenStax’s section on Taylor approximation.

  1. Build PnP_n using derivatives at the centre.
  2. Find the derivative of order n+1n+1 and bound its magnitude on the entire segment.
  3. Calculate BB and compare it with the allowed error ε\varepsilon, a positive number.

If B≤εB\le\varepsilon, the requested absolute accuracy is certified. If B>εB>\varepsilon, this bound is inconclusive: the approximation might still be accurate enough. Try a tighter derivative bound, a higher order, or a closer convenient centre.

3. Worked example: estimate a logarithm

Approximate ln⁡(1.12)\ln(1.12) using order two at a=1a=1

The natural logarithm ln⁡x\ln x is defined for x>0x>0, and ln⁡1=0\ln1=0. The centre 1 keeps the needed values simple:

f′(t)=1/t,f′′(t)=−1/t2,f′′′(t)=2/t3.\begin{aligned}f'(t)&=1/t,\\f''(t)&=-1/t^2,\\f'''(t)&=2/t^3.\end{aligned}

Thus f′(1)=1f'(1)=1 and f′′(1)=−1f''(1)=-1. Build the polynomial before inserting the target input:

P2(x)=(x−1)−(x−1)22.P_2(x)=(x-1)-\frac{(x-1)^2}{2}.

The displacement is 1.12−1=0.121.12-1=0.12, so

P2(1.12)=0.12−0.1222=0.1128.\begin{aligned}P_2(1.12)&=0.12-\frac{0.12^2}{2}\\&=0.1128.\end{aligned}

Check the error on the correct segment

On [1,1.12][1,1.12], all required derivatives are continuous. Since t≥1t\ge1, the third derivative satisfies 0<2/t3≤20<2/t^3\le2. We can use M=2M=2:

∣R2(1.12)∣≤2(0.12)33!=0.000576.\begin{aligned}|R_2(1.12)|&\le\frac{2(0.12)^3}{3!}\\&=0.000576.\end{aligned}

Result: 0.11280.1128 approximates ln⁡(1.12)\ln(1.12) with absolute error at most 0.0005760.000576. In particular, it meets a tolerance of 0.0010.001. This conclusion uses derivatives, not knowledge of the logarithm’s decimal value.

A later numerical check gives ln⁡(1.12)≈0.113328685\ln(1.12)\approx0.113328685, so the actual error is about 0.0005286850.000528685, below the bound. That comparison illustrates the difference between an error and its upper bound; it is not the proof.

4. Worked example: meet a requested accuracy

Approximate e0.2e^{0.2} with error at most 0.00050.0005

Use centre a=0a=0. Every derivative of f(x)=exf(x)=e^x is exe^x, so every derivative at zero is 1. Here e≈2.718e\approx2.718 is the base of the natural exponential.

On [0,0.2][0,0.2], use the convenient bound et≤e<3e^t\le e<3. Therefore M=3M=3 works for every derivative order. It is deliberately generous, which makes it easy to justify without first calculating e0.2e^{0.2}.

Try order two, then order three:

B2=3(0.2)33!=0.004,B3=3(0.2)44!=0.0002.\begin{aligned}B_2&=\frac{3(0.2)^3}{3!}=0.004,\\B_3&=\frac{3(0.2)^4}{4!}=0.0002.\end{aligned}

The first bound does not certify the target. The second does. This is enough to choose order three; no claim about the best possible degree is needed.

P3(x)=1+x+x22+x36,P3(0.2)=458375=1.221333…\begin{aligned}P_3(x)&=1+x+\frac{x^2}{2}\\&\quad+\frac{x^3}{6},\\P_3(0.2)&=\frac{458}{375}\\&=1.221333\ldots\end{aligned}

Result: the exact polynomial value 458/375458/375 has absolute error at most 0.00020.0002, safely below 0.00050.0005. If you report the rounded value 1.221331.22133, its rounding error is less than 0.0000050.000005. Adding that allowance still keeps the total error below 0.0002050.000205.

5. Avoid three false guarantees

  • “The derivative’s magnitude at the centre is my bound.” Only if that value bounds ∣f(n+1)(t)∣|f^{(n+1)}(t)| everywhere between centre and target. Nor can you always check only the endpoints: an interior maximum is possible. Check where the derivative’s magnitude increases or decreases, use a known bound that applies throughout the interval, or justify another estimate.
  • “The first omitted term is always the error bound.” A Taylor coefficient uses a derivative at the centre. The bound above needs a derivative bound over a segment. For an alternating series, the magnitude of the first omitted term bounds the absolute error relative to the series sum when the omitted terms alternate, their magnitudes are nonincreasing, and they tend to zero. To use that rule for f(x)f(x), you must also know that the series sums to f(x)f(x).
  • “The curves look close, so the required accuracy holds.” A plot cannot certify a tiny numerical tolerance. Keep the interval, derivative bound and final error comparison in your written answer. If your final decimal is rounded, include that extra error too.

6. Four questions, from guided to independent

Try each question before opening its hint. An answer should include the centre, the polynomial, the segment used for MM, and the error conclusion.

1. Guided: a square root near a perfect square

Use the order-one Taylor polynomial of f(x)=xf(x)=\sqrt{x} at a=9a=9 to estimate 9.3\sqrt{9.3}. Find a valid bound for the second derivative on [9,9.3][9,9.3]. Is the absolute error at most 0.00050.0005?

Hint for question 1

Use f(9)=3f(9)=3, f′(9)=1/6f'(9)=1/6, and f′′(t)=−1/(4t3/2)f''(t)=-1/(4t^{3/2}). Its magnitude decreases as tt increases through positive values.

Answer and reasoning for question 1

The linear polynomial and its value are

P1(x)=3+x−96,P1(9.3)=3.05.\begin{aligned}P_1(x)&=3+\frac{x-9}{6},\\P_1(9.3)&=3.05.\end{aligned}

The whole segment is positive. Its smallest input is 9, so ∣f′′(t)∣≤1/108|f''(t)|\le1/108. Taking M=1/108M=1/108 gives

∣R1(9.3)∣≤(1/108)(0.3)22!=12400≈0.000416667.\begin{aligned}|R_1(9.3)|&\le\frac{(1/108)(0.3)^2}{2!}\\&=\frac1{2400}\\&\approx0.000416667.\end{aligned}

Yes: 1/2400<0.00051/2400<0.0005, so the bound certifies the requested accuracy of the exact value 3.053.05.

2. Diagnose: the target moves to the other side

For ln⁡(0.9)\ln(0.9), a student reuses the order-two polynomial centred at 1 and gets P2(0.9)=−0.105P_2(0.9)=-0.105. They reuse M=2M=2 because f′′′(1)=2f'''(1)=2. What is wrong with that justification? Repair the bound.

Hint for question 2

The segment is now [0.9,1][0.9,1]. Where does 2/t32/t^3 have its largest value on that segment?

Answer and reasoning for question 2

The polynomial value is correct, but the derivative bound is not. For inputs below 1, 2/t32/t^3 exceeds 2. Its maximum on this segment is at t=0.9t=0.9, so use

M=2(0.9)3.M=\frac{2}{(0.9)^3}.

All required derivatives remain continuous because the segment stays above zero. With distance ∣0.9−1∣=0.1|0.9-1|=0.1,

∣R2(0.9)∣≤2(0.1)36(0.9)3=12187≈0.000457247.\begin{aligned}|R_2(0.9)|&\le\frac{2(0.1)^3}{6(0.9)^3}\\&=\frac1{2187}\\&\approx0.000457247.\end{aligned}

A later numerical check gives an actual error of about 0.0003605160.000360516. That is below the repaired bound but above the student’s unjustified value 0.001/30.001/3. Moving the target can change MM, even when the polynomial stays the same.

3. Extend: a zero coefficient can help

Let P(x)=1−x2/2P(x)=1-x^2/2, and use P(0.3)P(0.3) to approximate cos⁡(0.3)\cos(0.3). Show that PP, although it has degree two, is also the order-three Maclaurin polynomial for cosine. Use a fourth-derivative bound to certify absolute error at most 0.00040.0004.

Hint for question 3

The first four derivatives of cosine are −sin⁡x-\sin x, −cos⁡x-\cos x, sin⁡x\sin x, and cos⁡x\cos x. The coefficient of x3x^3 is zero.

Answer and reasoning for question 3

At zero the function and first three derivatives are 1,0,−1,01,0,-1,0. Consequently

P3(x)=1−x22,P_3(x)=1-\frac{x^2}{2},

which has degree two. On [0,0.3][0,0.3], the fourth derivative is cosine and its magnitude is at most 1. Thus

∣R3(0.3)∣≤(0.3)44!=0.0003375<0.0004.\begin{aligned}|R_3(0.3)|&\le\frac{(0.3)^4}{4!}\\&=0.0003375\\<0.0004.\end{aligned}

The value P3(0.3)=0.955P_3(0.3)=0.955 meets the target. We used order three in the theorem even though no cubic term appears. Order describes the derivatives matched, not necessarily the highest nonzero power.

4. Independent: one approximation over a whole interval

Approximate exe^x for every xx in [−0.4,0.4][-0.4,0.4], using Maclaurin polynomials and the bound M=3M=3. Compare orders three and four. Which one does this bound certify for absolute error at most 0.0010.001 throughout the interval? State the chosen polynomial.

Hint for question 4

Every segment from 0 to an allowed target lies inside [−0.4,0.4][-0.4,0.4], where et<3e^t<3. The greatest distance from the centre is 0.4. Use that distance in each bound.

Answer and reasoning for question 4

The derivative bound applies across the entire interval, and ∣x∣≤0.4|x|\le0.4. Therefore the following bounds hold for every allowed target:

B3=3(0.4)44!=0.0032,B4=3(0.4)55!=0.000256.\begin{aligned}B_3&=\frac{3(0.4)^4}{4!}=0.0032,\\B_4&=\frac{3(0.4)^5}{5!}=0.000256.\end{aligned}

Order four is certified; the order-three bound is inconclusive. Use

P4(x)=1+x+x22+x36+x424.\begin{aligned}P_4(x)&=1+x+\frac{x^2}{2}\\&\quad+\frac{x^3}{6}+\frac{x^4}{24}.\end{aligned}

The absolute error is at most 0.0002560.000256 everywhere on the stated interval. This is a single guarantee for many inputs, rather than a calculation for just one input.

7. Check your method and choose a next step

Can you explain why your centre is convenient, why your MM covers every input between centre and target, and whether your final bound meets the requested tolerance? If one answer is missing, fix that step before adding more terms.

Try the Taylor error check on the McGill MATH 262 page to compare a certified approximation with one whose error exceeds the tolerance.

If your difficulty is deciding whether an infinite sum converges, revisit three convergence decisions to explain. If it is finding all inputs that make a power series converge, continue with intervals and endpoint tests. Those questions do not replace the finite-error check taught here.

Course context: Concordia’s official MATH 205 description includes Taylor and Maclaurin series. These are original study examples, not course assessments. Your current course outline determines the methods and scope required in your class.

Useful for

Work on the step you’re missing.

Tell us the subject and your preferred time. Nablio confirms the details by text or email.

Request a lesson