Matpic
mathematics, in pictures
Concept

Asymptotic series

A series whose partial sums approximate a function better and better as a parameter grows, even though the series itself may diverge. Its truncation is useful up to a best stopping point, as in Stirling's formula and the Euler–Maclaurin corrections.

Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.

A series that gets better, then worse. The error of Euler's series against the number of terms kept, at x = 0.05 and 0.1 and 0.2. At 0.05 the error falls to 1.1e-8 at 20 terms and then climbs without limit. At 0.1 the error falls to 1.8e-4 at 10 terms and then climbs without limit. At 0.2 the error falls to 1.8e-2 at 5 terms and then climbs without limit.

A series that converges nowhere

Expand Euler's integral in powers of x and the coefficients are the factorials, so the series converges at no x but nought. Stopped at its smallest term it still computes the integral to within about e^(−1/x) — and every term added after that makes the answer worse.

analysis · Taylor series The sum of the first 6 squares, as a staircase over a curve. Bars of height k^2 for k from 1 to 6, totalling 91, drawn over the curve y = x^2, whose area up to 6 is 72.00. The slivers between staircase and curve hold 19.00, close to half the last bar.

Sums of powers, read off a staircase

Add the first n squares, or cubes, or seventh powers, and the answer is always a polynomial in n. Its first term is the area under a curve, its second is half of the last step, and every term after that is a correction for the corners of a staircase — which is where the Bernoulli numbers come from, and why they eventually grow without bound.

geometry · Figurate numbers

Named alongside it

The objects these essays reach for when they reach for this one.

ApproximationBoundConvergenceError analysisError termFigurate numbersIntegralPade approximantPolynomialRadius of convergenceRemainderRiemann sum

All concepts