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
Approximate ∫01 √(1 + x³) dx with Simpson's rule using n = 4 strips. Give S.
f(x) = √(1 + x³)[a, b] = [0, 1]n = 4
S =
2.Numerical methodsHard
Use Euler's method with h = 0.1 for y′ = e−ty, y(0) = 0 to estimate y4 ≈ y(0.4).
y′ = e−tyy(0) = 0h = 0.1
y4 =
3.Sequences & seriesMedium
Exactly one of the four series diverges. Click it.
A: Σ 5/k³B: Σ (1 + 1/k)ᵏC: Σ (−1)ᵏ/√kD: Σ (3/5)ᵏ
1A: Σ 5/k³
2B: Σ (1 + 1/k)ᵏ
3C: Σ (−1)ᵏ/√k
4D: Σ (3/5)ᵏ
4.Sequences & seriesHard
Use the Maclaurin polynomial of degree 4 of f(x) = cos x to approximate f(1.5). Give P₄(1.5).
f(x) = cos xn = 4x = 1.5
P₄(1.5) =
5.Matrices & determinantsMedium
Let C = AB for the matrices shown. Find the entry c11 (row 1, column 1).
A = [3 −5; 1 5]B = [3 −5; 6 0]
c11 =
6.Matrices & determinantsHard
Find the larger eigenvalue λ of the matrix A shown.
A = [−3 3; −5 5]
λ =
7.Differential equationsMedium
A forged steel part at 340 °C is left to cool in a workshop at 27 °C. After 24 min its temperature is 273 °C. It follows Newton's law of cooling, dT/dt = −k·(T − Tₐ). How long after the start, t, does it take to reach 293 °C?
T0 = 340 °CTa = 27 °CT(24) = 273 °CT = 293 °C
t = min
8.Differential equationsHard
Solve y″ + 2y′ + 5y = 0 with y(0) = 10 and y′(0) = 0 (released from rest). Find y(0.75); angles in radians.
y″ + 2y′ + 5y = 0y(0) = 10y′(0) = 0
y(0.75) =
3Solutions
1.Numerical methods
Answer: S = 1.111
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.
This integral has no elementary antiderivative, which is exactly when a numerical rule is needed.
2.Numerical methods
Answer: y4 = 0.3866
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
y₁ = 0 + 0.1·(1) = 0.1
y₂ = 0.1 + 0.1·(0.99005) = 0.199005
y₃ = 0.199005 + 0.1·(0.960981) = 0.295103
y₄ = 0.295103 + 0.1·(0.915275) = 0.386631
Graph
y4 = 0.3866
Answer
y4 = 0.3866
3.Sequences & series
Answer: B: Σ (1 + 1/k)ᵏ
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.
Test each series
A: Σ 5/k³ → p-series with p = 3 > 1: converges.
B: Σ (1 + 1/k)ᵏ → The terms tend to e, not 0: diverges by the n-th term test.
C: Σ (−1)ᵏ/√k → Alternating, with 1/√k decreasing to 0: converges (conditionally).
D: Σ (3/5)ᵏ → Geometric with r = 3/5, |r| < 1: converges.
The answer
B: Σ (1 + 1/k)ᵏ
Answer
B: Σ (1 + 1/k)ᵏ
4.Sequences & series
Answer: P₄(1.5) = 0.08594
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.
Maclaurin polynomial
P₄(x) = 1 − 0.5x² + 0.04167x⁴
Substitute
P₄(1.5) = 1 − 1.125 + 0.210938 = 0.08594
Answer
P₄(1.5) = 0.08594
The exact value is f(1.5) = 0.0707372; the error −0.0152003 shrinks when you take more terms or a point closer to 0.
5.Matrices & determinants
Answer: c11 = −21
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
c11 = 3·3 + (−5)·6 = −21
Answer
c11 = −21
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
λ² − (2)λ + (0) = 0
Solve
λ = (2 ± √(4))/2 → λ = 0, 2
λ = 2
Answer
λ = 2
7.Differential equations
Answer: t = 16.21 min
First-order differential equations: dy/dt = k·y has the solution y = y₀·ekt (growth for k > 0, decay for k < 0); a half-life T gives k = ln 2/T. Newton's law of cooling, dT/dt = −k·(T − Tₐ), gives T(t) = Tₐ + (T₀ − Tₐ)·e−kt. A linear equation y′ + p(x)·y = q(x) is solved with the integrating factor μ = e∫p dx: (μy)′ = μq, so μy = ∫μq dx + C.
Cooling constant
k = ln(313/246)/24 = 0.01004 min⁻¹
Time to reach the target
t = ln(313/266)/0.01004 = 16.21 min
Answer
t = 16.21 min
8.Differential equations
Answer: y(0.75) = 2.69
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.