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 √x·e−x dx with the trapezoid rule using n = 6 strips. Give T.
f(x) = √x·e−x[a, b] = [0, 1]n = 6
T =
2.Numerical methodsHard
Solve y′ = t + y, y(0) = 0.5 with Euler's method and step h = 0.1 up to t = 0.4. The exact solution is y = −t − 1 + (y₀ + 1)eᵗ. Find the global error |E| = |y(0.4) − y4|.
y′ = t + yy(0) = 0.5h = 0.1
|E| =
3.Sequences & seriesMedium
Apply the ratio test to Σk=1∞ k!/kᵏ. Find L = lim |ak+1/ak|.
ak = k!/kᵏ
L =
4.Sequences & seriesHard
f(x) = eˣ is approximated at x = 2 by its Maclaurin polynomial of degree n. With the Lagrange bound M·|x|ⁿ⁺¹/(n + 1)! and M = 8, find the smallest degree n that guarantees an error below 0.001.
f(x) = eˣx = 2M = 8ε = 0.001
n =
5.Matrices & determinantsMedium
Find the determinant det A of the 3×3 matrix A shown.
A = [4 5 −4; 0 −3 5; 1 2 −4]
det A =
6.Matrices & determinantsHard
Solve the system −3x − 5y = 11 and −3x + y = 8. Find x.
−3x − 5y = 11−3x + y = 8
x =
7.Differential equationsMedium
A forged steel part at 360 °C is left to cool in a workshop at 28 °C. After 10 min its temperature is 229 °C. It follows Newton's law of cooling, dT/dt = −k·(T − Tₐ). How long after the start, t, does it take to reach 268 °C?
T0 = 360 °CTa = 28 °CT(10) = 229 °CT = 268 °C
t = min
8.Differential equationsHard
Solve the initial value problem y′ + 3y/x = 5x for x > 0, with y(1) = 3. Find y(3).
y′ + 3y/x = 5xy(1) = 3
y(3) =
3Solutions
1.Numerical methods
Answer: T = 0.3647
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: |E| = 0.04159
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 = 0.79615
Exact value
y(0.4) = 0.837737
Global error
|E| = |0.837737 − 0.79615| = 0.04159
Graph
Answer
|E| = 0.04159
Halving h roughly halves the error of Euler's method.
3.Sequences & series
Answer: L = 0.3679
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.
Ratio of consecutive terms
|ak+1/ak| = (k/(k + 1))ᵏ = (1 + 1/k)ᵏ → 1/e
Conclusion
L = 0.3679 < 1
Answer
L = 0.3679
L < 1, so the series converges.
4.Sequences & series
Answer: n = 10
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 = 9: 0.002257 ≥ 0.001
n = 10: 0.0004105 < 0.001
Smallest degree
n = 10
Answer
n = 10
5.Matrices & determinants
Answer: det A = 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.
2×2 minors of the first row
M₁₁ = 2, M₁₂ = −5, M₁₃ = 3
Cofactor expansion
det A = 4·2 − 5·(−5) + (−4)·3 = 21
Answer
det A = 21
6.Matrices & determinants
Answer: x = −2.833
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.
Determinant of the coefficient matrix
det A = (−3)·1 − (−5)·(−3) = −18
Replace the x column
det Aₓ = 11·1 − (−5)·8 = 51
x = 51/(−18) = −2.833
Answer
x = −2.833
y = −0.5
7.Differential equations
Answer: t = 6.466 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(332/201)/10 = 0.05018 min⁻¹
Time to reach the target
t = ln(332/240)/0.05018 = 6.466 min
Answer
t = 6.466 min
8.Differential equations
Answer: y(3) = 9.074
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.