For a root: check the sign change for bisection, or compute f and f′ for Newton, and keep six or more digits in a table of iterates.
For a table value: interpolate linearly between the two neighbouring points.
For an integral: find h = (b − a)/n, list f at every node, apply the weights (1, 2, …, 2, 1 for trapezoid; 1, 4, 2, …, 4, 1 for Simpson with even n) and multiply by h/2 or h/3.
For an ODE: step from t₀ with yₙ₊₁ = yₙ + h·f(tₙ, yₙ) (Euler) or the averaged slope (Heun), one row per step, until you reach the requested t.
Sequences & series
Arithmetic sequence
aₙ = a₁ + (n − 1)d, Sₙ = n(a₁ + aₙ)/2
Geometric sequence
aₙ = a₁rⁿ⁻¹, Sₙ = a₁(1 − rⁿ)/(1 − r)
Infinite geometric series
S = a₁/(1 − r), |r| < 1
p-series
Σ1/kᵖ converges only for p > 1
Ratio test
L = lim |ak+1/ak|: L < 1 converges, L > 1 diverges
Radius of convergence
R = lim |ck/ck+1|
Taylor polynomial
Pₙ(x) = Σ f⁽ᵏ⁾(a)(x − a)ᵏ/k!
Maclaurin series
eˣ = Σxᵏ/k!, sin x = x − x³/3! + …, cos x = 1 − x²/2! + …, ln(1 + x) = x − x²/2 + …
Lagrange error bound
|Rₙ| ≤ M·|x − a|ⁿ⁺¹/(n + 1)!
Method
Identify the type: arithmetic (constant difference), geometric (constant ratio), a standard series, a power series or a Taylor polynomial.
For sums use Sₙ = n(a₁ + aₙ)/2, Sₙ = a₁(1 − rⁿ)/(1 − r), or S = a₁/(1 − r) when |r| < 1, with a₁ the first term of the sum.
For convergence: n-th term test first, then compare with Σ1/kᵖ or a geometric series, and use the ratio or root test for factorials and k-th powers.
For Taylor polynomials list f(a), f′(a), f″(a), …, divide the k-th derivative by k!, and bound the error with M·|x − a|ⁿ⁺¹/(n + 1)!.
Matrices & determinants
2×2 determinant
det = ad − bc
2×2 inverse
A⁻¹ = (1/det)·[d −b; −c a]
Product
(AB)ij = Σk AikBkj
Eigenvalues
det(A − λI) = 0
Cramer’s rule
xi = det(Ai)/det(A)
Differential equations
Exponential growth/decay
dy/dt = ky → y = y0ekt
Half-life
k = ln 2 / t½
Newton's law of cooling
T(t) = Ta + (T0 − Ta)e−kt
Integrating factor
y′ + p(x)y = q(x): μ = e∫p dx, (μy)′ = μq
Mixing tank
dm/dt = r·c − (r/V)·m
2Practice problems
1.Numerical methodsMedium
The trapezoid rule is used for ∫12 1/x dx. The error is at most (b − a)³·M/(12n²) with M = max|f″| on [1, 2]. Find the smallest number of strips n that guarantees an error below 1 × 10⁻⁵.
f(x) = 1/x[a, b] = [1, 2]ε = 1 × 10⁻⁵
n =
2.Numerical methodsHard
Solve y′ = y − t², y(0) = 2 with Euler's method and step h = 0.5 up to t = 2. The exact solution is y = t² + 2t + 2 + (y₀ − 2)eᵗ. Find the global error |E| = |y(2) − y4|.
y′ = y − t²y(0) = 2h = 0.5
|E| =
3.Sequences & seriesMedium
Find the sum S = Σk=1∞ 2/(k(k + 3)).
ak = 2/(k(k + 3))
S =
4.Sequences & seriesHard
f(x) = eˣ is approximated at x = 1 by its Maclaurin polynomial of degree n. With the Lagrange bound M·|x|ⁿ⁺¹/(n + 1)! and M = 3, find the smallest degree n that guarantees an error below 0.0005.
f(x) = eˣx = 1M = 3ε = 0.0005
n =
5.Matrices & determinantsMedium
Let C = AB for the matrices shown. Find the entry c21 (row 2, column 1).
A = [3 −5; −2 −6]B = [−4 −1; 4 −3]
c21 =
6.Matrices & determinantsHard
Find the larger eigenvalue λ of the matrix A shown.
A = [6 4; −7 −5]
λ =
7.Differential equationsMedium
Solve y″ + 4y′ + 3y = 0 with y(0) = 5 and y′(0) = -4. Find y(1).
y″ + 4y′ + 3y = 0y(0) = 5y′(0) = -4
y(1) =
8.Differential equationsHard
A system obeys y″ + y′ + 16.25y = 16.25 for t ≥ 0, starting from rest: y(0) = 0, y′(0) = 0. Find the peak value ymax of its step response.
y″ + y′ + 16.25y = 16.25y(0) = 0y′(0) = 0
ymax =
3Solutions
1.Numerical methods
Answer: n = 130
Numerical integration: split [a, b] into n strips of width h = (b − a)/n with nodes x₀ … xₙ. Trapezoid rule: T = (h/2)[f₀ + 2f₁ + 2f₂ + … + 2fn−1 + fₙ]. Simpson's rule (n even): S = (h/3)[f₀ + 4f₁ + 2f₂ + 4f₃ + … + 4fn−1 + fₙ]. The trapezoid error shrinks like h² (bound (b − a)h²·M/12 with M = max|f″|), Simpson's like h⁴, so Simpson is usually far more accurate for the same nodes.
Second derivative bound
M = 2/1³ = 2
Solve for n
n² > 1·2/(12·1 × 10⁻⁵) = 16667
n > 129.1 → n = 130
Answer
n = 130
2.Numerical methods
Answer: |E| = 2.031
Numerical solution of y′ = f(t, y): Euler's method steps along the slope at the start of each step: yn+1 = yₙ + h·f(tₙ, yₙ). Heun's method (improved Euler) averages the slope at the start and at an Euler prediction: k₁ = f(tₙ, yₙ), k₂ = f(tₙ + h, yₙ + h·k₁), yn+1 = yₙ + (h/2)(k₁ + k₂). The classical Runge–Kutta method (RK4) combines four slopes: yn+1 = yₙ + (h/6)(k₁ + 2k₂ + 2k₃ + k₄). The global error of Euler is proportional to h, Heun's to h², RK4's to h⁴.
Euler steps
y4 = 7.96875
Exact value
y(2) = 10
Global error
|E| = |10 − 7.96875| = 2.031
Graph
Answer
|E| = 2.031
Halving h roughly halves the error of Euler's method.
3.Sequences & series
Answer: S = 1.222
Convergence: if the terms do not tend to 0 the series diverges (n-th term test). Σ1/kᵖ converges only for p > 1, and Σrᵏ only for |r| < 1. Compare a series with one of these when its terms behave like them for large k. Ratio test: L = lim |ak+1/ak|; root test: L = lim |ak|1/k. L < 1 converges, L > 1 diverges, L = 1 decides nothing. A power series Σck(x − x₀)ᵏ converges for |x − x₀| < R with R = lim |ck/ck+1|; an alternating series with terms decreasing to 0 converges.
Partial fractions
2/(k(k + 3)) = (2/3)·(1/k − 1/(k + 3))
Cancel
S = (2/3)·(1 + 1/2 + 1/3) = 1.222
Answer
S = 1.222
4.Sequences & series
Answer: n = 7
Taylor polynomials: near x = a a smooth function is approximated by Pₙ(x) = f(a) + f′(a)(x − a) + f″(a)(x − a)²/2! + … + f⁽ⁿ⁾(a)(x − a)ⁿ/n!; for a = 0 this is the Maclaurin polynomial. Standard series: eˣ = Σxᵏ/k!, sin x = x − x³/3! + x⁵/5! − …, cos x = 1 − x²/2! + x⁴/4! − …, ln(1 + x) = x − x²/2 + x³/3 − …, 1/(1 − x) = Σxᵏ. Lagrange error bound: |f(x) − Pₙ(x)| ≤ M·|x − a|ⁿ⁺¹/(n + 1)!, where M is the largest value of |f⁽ⁿ⁺¹⁾| between a and x.
Bounds for increasing n
n = 6: 0.0005952 ≥ 0.0005
n = 7: 7.44 × 10⁻⁵ < 0.0005
Smallest degree
n = 7
Answer
n = 7
5.Matrices & determinants
Answer: c21 = −16
Matrices: the determinant of a 2×2 matrix is ad − bc. For 3×3, expand along a row: each entry times the determinant of the 2×2 matrix left after removing its row and column, with alternating signs + − +. Eigenvalues λ solve det(A − λI) = 0; for 2×2 that is λ² − (trace)·λ + det = 0.
Row times column
c21 = (−2)·(−4) + (−6)·4 = −16
Answer
c21 = −16
6.Matrices & determinants
Answer: λ = 2
Matrices: the determinant of a 2×2 matrix is ad − bc. For 3×3, expand along a row: each entry times the determinant of the 2×2 matrix left after removing its row and column, with alternating signs + − +. Eigenvalues λ solve det(A − λI) = 0; for 2×2 that is λ² − (trace)·λ + det = 0.
Characteristic equation
λ² − (1)λ + (−2) = 0
Solve
λ = (1 ± √(9))/2 → λ = −1, 2
λ = 2
Answer
λ = 2
7.Differential equations
Answer: y(1) = 1.998
Second-order linear equations: for y″ + b·y′ + c·y = 0 try y = ert: this gives the characteristic equation r² + b·r + c = 0. Two real roots r₁ ≠ r₂ give y = A·er₁t + B·er₂t (overdamped); a double root r gives y = (A + Bt)·ert (critically damped); complex roots −α ± jω give y = e−αt(A cos ωt + B sin ωt) (underdamped, oscillating). The initial values y(0) and y′(0) fix A and B. Written as y″ + 2ζωny′ + ωn²y = 0, ωn is the natural frequency and ζ the damping ratio: ζ < 1 oscillates. With a constant input, y″ + by′ + cy = c·K, the solution is the steady value K plus the free response.
Characteristic roots
(r + 1)(r + 3) = 0 → r = −1, −3
Constants from the initial values
A + B = 5, −1A − 3B = -4
A = 5.5, B = −0.5
Evaluate
y(1) = 5.5·e−1 + (−0.5)·e−3 = 1.998
Answer
y(1) = 1.998
8.Differential equations
Answer: ymax = 1.675
Second-order linear equations: for y″ + b·y′ + c·y = 0 try y = ert: this gives the characteristic equation r² + b·r + c = 0. Two real roots r₁ ≠ r₂ give y = A·er₁t + B·er₂t (overdamped); a double root r gives y = (A + Bt)·ert (critically damped); complex roots −α ± jω give y = e−αt(A cos ωt + B sin ωt) (underdamped, oscillating). The initial values y(0) and y′(0) fix A and B. Written as y″ + 2ζωny′ + ωn²y = 0, ωn is the natural frequency and ζ the damping ratio: ζ < 1 oscillates. With a constant input, y″ + by′ + cy = c·K, the solution is the steady value K plus the free response.