Geometry and trigonometry cheat sheet

BOOKLET given in the examLEARN you must remember it · Each block links to its lesson.

Geometry and trigonometry

IB MATHS AI · HL
pastpaperprep.com/revision-notes

3.13D distance, midpoint and measurement

Distance in 3D: d=(x1−x2)2+(y1−y2)2+(z1−z2)2d = \sqrt{(x_{1} - x_{2})^{2} + (y_{1} - y_{2})^{2} + (z_{1} - z_{2})^{2}}. The midpoint is the mean of each coordinate.BOOKLET
Right pyramid: V=13AhV = \frac{1}{3}Ah. Right cone: V=13πr2hV = \frac{1}{3}\pi r^{2}h and curved area πrl\pi r l. Sphere: V=43πr3V = \frac{4}{3}\pi r^{3} and A=4πr2A = 4\pi r^{2}.BOOKLET
Right cone: slant height l=r2+h2l = \sqrt{r^{2} + h^{2}}. Use hh for the volume and ll for the curved area.LEARN
Hemisphere: V=23πr3V = \frac{2}{3}\pi r^{3}, curved area 2πr22\pi r^{2}, and total area 3πr23\pi r^{2} when solid. Combined solids: add the volumes and count only the outside surfaces.LEARN
A vertical height meets every horizontal line through its foot at 90∘90^{\circ}. In a square-based right pyramid, the centre of the base to a corner is half the diagonal.LEARN
The angle between a line and a plane is the angle between the line and its projection on the plane, found from a perpendicular dropped to the plane.LEARN

3.2Triangle trigonometry

sin⁡θ=OH,cos⁡θ=AH,tan⁡θ=OA\sin\theta = \frac{\text{O}}{\text{H}}, \quad \cos\theta = \frac{\text{A}}{\text{H}}, \quad \tan\theta = \frac{\text{O}}{\text{A}}LEARN
In a right-angled triangle, find an acute angle by undoing the ratio with sin⁡−1\sin^{-1}, cos⁡−1\cos^{-1} or tan⁡−1\tan^{-1}, with the GDC in degree mode.LEARN
asin⁡A=bsin⁡B=csin⁡C\frac{a}{\sin A} = \frac{b}{\sin B} = \frac{c}{\sin C}BOOKLET
c2=a2+b2−2abcos⁡C;cos⁡C=a2+b2−c22abc^{2} = a^{2} + b^{2} - 2ab\cos C; \quad \cos C = \frac{a^{2} + b^{2} - c^{2}}{2ab}BOOKLET
A=12absin⁡CA = \frac{1}{2}ab\sin CBOOKLET
Sine rule: you know a side and the angle facing it, plus one more side or angle. Cosine rule: you know two sides and the angle between them, or all three sides. Area 12absin⁡C\frac{1}{2}ab\sin C: two sides and the angle between them.LEARN
In a triangle, a negative cosine means an obtuse angle, and sin⁡−1\sin^{-1} never gives an obtuse angle. An angle found with the sine rule is acute when the side facing it is shorter than the side facing the known angle.LEARN

3.3Applied triangle trigonometry

a2+b2=c2,sin⁡θ=OH,cos⁡θ=AH,tan⁡θ=OAa^{2} + b^{2} = c^{2}, \qquad \sin\theta = \frac{\text{O}}{\text{H}}, \quad \cos\theta = \frac{\text{A}}{\text{H}}, \quad \tan\theta = \frac{\text{O}}{\text{A}}LEARN
asin⁡A=bsin⁡B=csin⁡C\frac{a}{\sin A} = \frac{b}{\sin B} = \frac{c}{\sin C}BOOKLET
c2=a2+b2−2abcos⁡C;cos⁡C=a2+b2−c22abc^{2} = a^{2} + b^{2} - 2ab\cos C; \quad \cos C = \frac{a^{2} + b^{2} - c^{2}}{2ab}BOOKLET
bearing of A from B=bearing of B from A±180∘\text{bearing of } A \text{ from } B = \text{bearing of } B \text{ from } A \pm 180^{\circ}LEARN
Draw the diagram first: horizontal ground, vertical lines at right angles, every given value and the unknown labelled.LEARN
In a triangle with no right angle: sine rule with a side, its opposite angle and one more side or angle; cosine rule with two sides and the angle between them, or three sides.LEARN
Elevation and depression are measured from the horizontal. Over horizontal ground, the depression of B from A equals the elevation of A from B.LEARN
A bearing is clockwise from north, with three figures before any decimal point. The back bearing is the bearing ±180∘\pm 180^{\circ}.LEARN
Set the GDC to degrees. Store intermediate values and round only the final answer, with its unit.LEARN

3.4Arc length and sector area

l=θ360×2πrl = \frac{\theta}{360} \times 2\pi rBOOKLET
A=θ360×πr2A = \frac{\theta}{360} \times \pi r^{2}BOOKLET
In both formulas θ\theta is the angle at the centre in degrees and rr is the radius.LEARN
Perimeter of a sector == arc +2r+ 2r: the arc plus the two radii.LEARN
The major sector made by two radii has angle 360∘−θ360^{\circ} - \theta, where θ\theta is the minor sector's angle.LEARN
Segment between a chord and its minor arc == sector −- triangle =θ360×πr2−12r2sin⁡θ= \frac{\theta}{360} \times \pi r^{2} - \frac{1}{2}r^{2}\sin\theta, with θ\theta the angle at the centre in degrees (GDC in degree mode).LEARN

3.5Perpendicular bisectors

The perpendicular bisector of [AB][AB] passes through the midpoint of [AB][AB] at right angles to it. In a plane, a point is on it exactly when it is the same distance from AA as from BB.LEARN
From two points: find the midpoint and the gradient mm of [AB][AB]. If m≠0m \neq 0, the bisector has gradient −1m-\frac{1}{m}; use it with the midpoint in y−y1=m(x−x1)y - y_{1} = m(x - x_{1}).LEARN
From a segment's equation and midpoint: read the segment's gradient mm from the equation (make yy the subject). If m≠0m \neq 0, use −1m-\frac{1}{m} through the midpoint.LEARN
A horizontal segment has a vertical bisector, x=x = the midpoint's xx-coordinate. A vertical segment has a horizontal bisector, y=y = the midpoint's yy-coordinate.LEARN

3.6Voronoi diagrams

Every point inside a site's cell is closer to that site than to any other site.LEARN
An edge lies on the perpendicular bisector of its two sites.LEARN
A vertex is equally far from the sites of all the cells meeting there.LEARN
Edge: through the midpoint of two sites, with gradient −1m-\frac{1}{m} if the segment's gradient is m≠0m \neq 0 (level sites: vertical edge; one above the other: horizontal edge). Vertex: solve two edges simultaneously.LEARN
Adding a site: draw its bisectors with neighbouring sites and erase old edges inside its new cell.LEARN
Nearest neighbour interpolation: every point in a cell gets its site's value.LEARN
Toxic waste dump problem (IB exams): compare each vertex's distance to one of its own sites; the largest wins.LEARN
If 11 unit is kk km on a map, 11 square unit is k2 km2k^2\text{ km}^{2}.LEARN

3.7 ◆Radians, arc length and sector area

π\pi radians =180∘= 180^{\circ}, so a full turn is 2π2\pi radians. Multiply by π180\frac{\pi}{180} to get radians, and by 180π\frac{180}{\pi} to get degrees.LEARN
l=rθl = r\thetaBOOKLET
A=12r2θA = \frac{1}{2}r^{2}\thetaBOOKLET
In l=rθl = r\theta and A=12r2θA = \frac{1}{2}r^{2}\theta, rr is the radius and θ\theta is the angle at the centre in radians.LEARN
Perimeter of a sector =2r+rθ= 2r + r\theta, with θ\theta in radians. The major sector made by two radii has angle 2π−θ2\pi - \theta, where θ\theta is the minor sector's angle.LEARN
Set your GDC to radian mode before finding sin⁡\sin, cos⁡\cos or tan⁡\tan of an angle in radians.LEARN

3.8 ◆Unit-circle trigonometry and equations

On the unit circle, the point at angle θ\theta anticlockwise from the positive xx-axis is (cos⁡θ,sin⁡θ)(\cos\theta, \sin\theta). On a circle of radius rr centred at the origin it is (rcos⁡θ,rsin⁡θ)(r\cos\theta, r\sin\theta).LEARN
sin⁡x\sin x and cos⁡x\cos x stay between −1-1 and 11 and repeat every 360∘360^{\circ} (2π2\pi radians).LEARN
cos⁡2θ+sin⁡2θ=1\cos^{2}\theta + \sin^{2}\theta = 1BOOKLET
tan⁡θ=sin⁡θcos⁡θ\tan\theta = \frac{\sin\theta}{\cos\theta}BOOKLET
tan⁡θ\tan\theta is the gradient of OPOP; it is undefined when cos⁡θ=0\cos\theta = 0. After a square root, choose the sign of sin⁡θ\sin\theta or cos⁡θ\cos\theta from where PP lies; in a triangle sin⁡θ>0\sin\theta > 0.LEARN
Ambiguous case (two sides and an angle not between them): if the sine rule gives sin⁡C=k\sin C = k with 0<k<10 < k < 1, test both C1=sin⁡−1kC_{1} = \sin^{-1}k and 180∘−C1180^{\circ} - C_{1}; keep each one whose sum with the known angle is under 180∘180^{\circ}. If k=1k = 1, C=90∘C = 90^{\circ}; if k>1k > 1 there is no triangle.LEARN
Solve a trigonometric equation in an interval by graphing both sides in the right angle mode over the whole interval, then finding every intersection.LEARN

3.9 ◆Matrix transformations

(k001): horizontal stretch, scale factor k\begin{pmatrix}k & 0\\0 & 1\end{pmatrix}:\ \text{horizontal stretch, scale factor } kBOOKLET
(100k): vertical stretch, scale factor k\begin{pmatrix}1 & 0\\0 & k\end{pmatrix}:\ \text{vertical stretch, scale factor } kBOOKLET
(k00k): enlargement, scale factor k, centre (0,0)\begin{pmatrix}k & 0\\0 & k\end{pmatrix}:\ \text{enlargement, scale factor } k,\ \text{centre } (0, 0)BOOKLET
(cos⁡θ−sin⁡θsin⁡θcos⁡θ): anticlockwise rotation of angle θ about the origin (θ>0)\begin{pmatrix}\cos\theta & -\sin\theta\\\sin\theta & \cos\theta\end{pmatrix}:\ \text{anticlockwise rotation of angle } \theta \text{ about the origin } (\theta > 0)BOOKLET
(cos⁡θsin⁡θ−sin⁡θcos⁡θ): clockwise rotation of angle θ about the origin (θ>0)\begin{pmatrix}\cos\theta & \sin\theta\\-\sin\theta & \cos\theta\end{pmatrix}:\ \text{clockwise rotation of angle } \theta \text{ about the origin } (\theta > 0)BOOKLET
(cos⁡2θsin⁡2θsin⁡2θ−cos⁡2θ): reflection in the line y=(tan⁡θ)x\begin{pmatrix}\cos 2\theta & \sin 2\theta\\\sin 2\theta & -\cos 2\theta\end{pmatrix}:\ \text{reflection in the line } y = (\tan\theta)xBOOKLET
x′=Ax+b\boldsymbol{x}' = A\boldsymbol{x} + \boldsymbol{b}: the matrix acts first, then the translation b\boldsymbol{b}. The columns of AA are the images of (1,0)(1, 0) and (0,1)(0, 1) under AA alone, before the translation.LEARN
The booklet's rotations are about the origin, with θ>0\theta > 0. Its reflection matrix uses 2θ2\theta, where the mirror line y=(tan⁡θ)xy = (\tan\theta)x passes through the origin.LEARN
Transformation AA followed by transformation BB has the single matrix BABA: the first one goes on the right.LEARN
With no translation, applying AA nn times gives xn=Anx0\boldsymbol{x}_{n} = A^{n}\boldsymbol{x}_{0}.LEARN
Area of image =∣det⁡A∣×= \lvert\det A\rvert \times area of object for x′=Ax+b\boldsymbol{x}' = A\boldsymbol{x} + \boldsymbol{b}; translations don't change area. For AA then BB, det⁡(BA)=det⁡B×det⁡A\det(BA) = \det B \times \det A.LEARN
A fractal stage making mm non-overlapping copies of each piece, each with area factor ∣det⁡A∣\lvert\det A\rvert, multiplies the area by m∣det⁡A∣m\lvert\det A\rvert: a geometric sequence.LEARN

3.10 ◆Vectors in 2D and 3D

∣v∣=v12+v22+v32, where v=(v1v2v3)\lvert\boldsymbol{v}\rvert = \sqrt{v_{1}^{2} + v_{2}^{2} + v_{3}^{2}}, \text{ where } \boldsymbol{v} = \begin{pmatrix}v_{1}\\v_{2}\\v_{3}\end{pmatrix}BOOKLET
v=(v1v2v3)=v1i+v2j+v3k\boldsymbol{v} = \begin{pmatrix}v_{1}\\v_{2}\\v_{3}\end{pmatrix} = v_{1}\boldsymbol{i} + v_{2}\boldsymbol{j} + v_{3}\boldsymbol{k}; a base vector that doesn't appear has component 0.LEARN
The resultant of two or more vectors is their sum: add matching components. Forces whose resultant is 0\boldsymbol{0} balance.LEARN
AB→=b−a\overrightarrow{AB} = \boldsymbol{b} - \boldsymbol{a}: subtract the start from the end. The distance between A and B is ∣b−a∣\lvert\boldsymbol{b} - \boldsymbol{a}\rvert.LEARN
If v\boldsymbol{v} and w\boldsymbol{w} are non-zero, they are parallel exactly when w=kv\boldsymbol{w} = k\boldsymbol{v} for some scalar kk; a negative kk means they point in opposite directions.LEARN
For non-zero v\boldsymbol{v}, the unit vector with the same direction is v∣v∣\frac{\boldsymbol{v}}{\lvert\boldsymbol{v}\rvert}, and the vector of length LL in that direction is Lv∣v∣L\frac{\boldsymbol{v}}{\lvert\boldsymbol{v}\rvert}.LEARN
Velocity = speed ×\times the unit vector in the direction of motion. Speed is the magnitude of velocity, never negative.LEARN

3.11 ◆Vector equations of lines

r=a+λb\boldsymbol{r} = \boldsymbol{a} + \lambda\boldsymbol{b}BOOKLET
In r=a+λb\boldsymbol{r} = \boldsymbol{a} + \lambda\boldsymbol{b}, a\boldsymbol{a} is the position vector of any point on the line and b\boldsymbol{b} is any non-zero vector parallel to it. Through P and Q, use b=PQ→=q−p\boldsymbol{b} = \overrightarrow{\mathrm{PQ}} = \boldsymbol{q} - \boldsymbol{p}.LEARN
For r=OP→+λPQ→\boldsymbol{r} = \overrightarrow{\mathrm{OP}} + \lambda\overrightarrow{\mathrm{PQ}}: λ=0\lambda = 0 is P, λ=1\lambda = 1 is Q, and 0≤λ≤10 \le \lambda \le 1 is the segment PQ. With a different point or direction, λ\lambda means something different.LEARN
A point lies on a line only if one value of λ\lambda gives every one of its coordinates.LEARN
x=x0+λl,y=y0+λm,z=z0+λnx = x_{0} + \lambda l, \quad y = y_{0} + \lambda m, \quad z = z_{0} + \lambda nBOOKLET
From parametric form back to r=a+λb\boldsymbol{r} = \boldsymbol{a} + \lambda\boldsymbol{b}: the constants give the point, the coefficients of λ\lambda give the direction, and a coordinate with no λ\lambda term has direction component 00.LEARN
To find where a line meets a condition such as z=0z = 0: solve that coordinate's equation for λ\lambda, then substitute that λ\lambda into every coordinate. If that coordinate has no λ\lambda term, there is no single meeting point.LEARN

3.12 ◆Kinematics with vectors

r=r0+vt\boldsymbol{r} = \boldsymbol{r}_{0} + \boldsymbol{v}tLEARN
For constant velocity v\boldsymbol{v}: r0\boldsymbol{r}_{0} is the position at t=0t = 0, the speed is ∣v∣\lvert\boldsymbol{v}\rvert, and the distance travelled in time tt is ∣v∣t\lvert\boldsymbol{v}\rvert t.LEARN
Relative position of B from A at time tt: AB→=rB(t)−rA(t)\overrightarrow{\mathrm{AB}} = \boldsymbol{r}_{\mathrm{B}}(t) - \boldsymbol{r}_{\mathrm{A}}(t), B's position minus A's at the same tt. Its magnitude is the distance between them, and the objects meet only if it is 0\boldsymbol{0} at some time.LEARN
Closest approach: minimise d(t)=∣rB(t)−rA(t)∣d(t) = \lvert\boldsymbol{r}_{\mathrm{B}}(t) - \boldsymbol{r}_{\mathrm{A}}(t)\rvert over the allowed times with the GDC. For constant velocities, d(t)2d(t)^{2} is a quadratic (or constant, if the velocities are equal): the minimum is at its vertex when that is an allowed time, otherwise at an end of the allowed times. Give the time and the distance.LEARN
If r=f(t)\boldsymbol{r} = f(t) is a motion that starts at t=0t = 0, the same motion starting at t=at = a is r=f(t−a)\boldsymbol{r} = f(t - a), for t≥at \ge a.LEARN
v=drdt\boldsymbol{v} = \frac{\mathrm{d}\boldsymbol{r}}{\mathrm{d}t} and a=dvdt\boldsymbol{a} = \frac{\mathrm{d}\boldsymbol{v}}{\mathrm{d}t}, component by component. Integrating back needs one constant per component, fixed by a known position or velocity.LEARN
Projectile launched from (x0,y0)(x_{0}, y_{0}) with velocity (uxuy)\begin{pmatrix}u_{x}\\u_{y}\end{pmatrix} at t=0t = 0, ignoring air resistance, with yy up and units of metres and seconds: a=(0−9.8)\boldsymbol{a} = \begin{pmatrix}0\\-9.8\end{pmatrix}, so r=(x0+uxty0+uyt−4.9t2)\boldsymbol{r} = \begin{pmatrix}x_{0} + u_{x}t\\y_{0} + u_{y}t - 4.9t^{2}\end{pmatrix}. For uy>0u_{y} > 0, the highest point is where vy=0v_{y} = 0.LEARN
r=(Rcos⁡(ωt)Rsin⁡(ωt))\boldsymbol{r} = \begin{pmatrix}R\cos(\omega t)\\R\sin(\omega t)\end{pmatrix} (R>0R > 0, ω>0\omega > 0, ωt\omega t in radians) is motion on a circle of radius RR about the origin, with speed RωR\omega and period 2πω\frac{2\pi}{\omega}.LEARN

3.13 ◆Scalar and vector products

cos⁡θ=v1w1+v2w2+v3w3∣v∣∣w∣\cos\theta = \frac{v_{1}w_{1} + v_{2}w_{2} + v_{3}w_{3}}{\lvert\boldsymbol{v}\rvert\lvert\boldsymbol{w}\rvert}BOOKLET
For non-zero vectors, v⋅w=0\boldsymbol{v} \cdot \boldsymbol{w} = 0 exactly when they are perpendicular. A positive scalar product means θ<90∘\theta < 90^{\circ}, and a negative one means θ>90∘\theta > 90^{\circ}.LEARN
The angle between two lines is the angle between their direction vectors, taken as acute or right: if you get θ>90∘\theta > 90^{\circ}, use 180∘−θ180^{\circ} - \theta.LEARN
v×w=(v2w3−v3w2v3w1−v1w3v1w2−v2w1), where v=(v1v2v3),  w=(w1w2w3)\boldsymbol{v}\times\boldsymbol{w} = \begin{pmatrix}v_{2}w_{3} - v_{3}w_{2}\\v_{3}w_{1} - v_{1}w_{3}\\v_{1}w_{2} - v_{2}w_{1}\end{pmatrix}, \text{ where } \boldsymbol{v} = \begin{pmatrix}v_{1}\\v_{2}\\v_{3}\end{pmatrix}, \; \boldsymbol{w} = \begin{pmatrix}w_{1}\\w_{2}\\w_{3}\end{pmatrix}BOOKLET
v×w=∣v∣∣w∣sin⁡θ n\boldsymbol{v} \times \boldsymbol{w} = \lvert\boldsymbol{v}\rvert\lvert\boldsymbol{w}\rvert\sin\theta\,\boldsymbol{n} with θ\theta the angle between v\boldsymbol{v} and w\boldsymbol{w}. It is perpendicular to both, since n\boldsymbol{n} is a unit vector at right angles to each, pointing the way the right-hand screw rule gives; it is 0\boldsymbol{0} when they are parallel. Order matters: w×v=−(v×w)\boldsymbol{w} \times \boldsymbol{v} = -(\boldsymbol{v} \times \boldsymbol{w}).LEARN
A=∣v×w∣, where v and w form two adjacent sides of a parallelogramA = \lvert \boldsymbol{v} \times \boldsymbol{w} \rvert, \text{ where } \boldsymbol{v} \text{ and } \boldsymbol{w} \text{ form two adjacent sides of a parallelogram}BOOKLET
A=12∣v×w∣, where v and w are two sides of a triangle from the same vertexA = \frac{1}{2}\lvert \boldsymbol{v} \times \boldsymbol{w} \rvert, \text{ where } \boldsymbol{v} \text{ and } \boldsymbol{w} \text{ are two sides of a triangle from the same vertex}LEARN
along b: a⋅b∣b∣=∣a∣cos⁡θperpendicular to b: ∣a×b∣∣b∣=∣a∣sin⁡θ\text{along } \boldsymbol{b}: \ \frac{\boldsymbol{a} \cdot \boldsymbol{b}}{\lvert\boldsymbol{b}\rvert} = \lvert\boldsymbol{a}\rvert\cos\theta \qquad \text{perpendicular to } \boldsymbol{b}: \ \frac{\lvert \boldsymbol{a} \times \boldsymbol{b} \rvert}{\lvert\boldsymbol{b}\rvert} = \lvert\boldsymbol{a}\rvert\sin\thetaLEARN

3.14 ◆Graph theory basics

∑deg⁡(V)=2×number of edges\sum \deg(V) = 2 \times \text{number of edges}LEARN
Degree counts edge ends at a vertex: a loop adds 22, and each of several edges between the same two vertices counts.LEARN
Weighted graph: each edge carries a distance, time or cost. The drawing is not to scale, so read the weights.LEARN
Simple: no loops and no multiple edges. Complete KnK_n: simple, with every pair of its nn vertices joined, so it has n(n−1)2\frac{n(n-1)}{2} edges.LEARN
Connected: you can travel along edges between any two vertices. Strongly connected (directed graph): you can travel from any vertex to any other following the arrows.LEARN
In a directed graph, the in-degrees add up to the number of edges, and so do the out-degrees.LEARN
Subgraph: vertices and edges taken from GG, with both ends of every kept edge also kept.LEARN
Tree: connected with no cycles. A tree with nn vertices has n−1n - 1 edges, and a connected graph with nn vertices and n−1n - 1 edges is a tree.LEARN

3.15 ◆Adjacency matrices and walks

Adjacency matrix: entry (i,j)(i, j) is the number of edges directly from ii to jj. Symmetric for an undirected graph; for a directed graph, rows are “from”.LEARN
A walk is a sequence of edges, each starting where the last ended; vertices and edges may repeat. Its length is its number of edges.LEARN
entry (i,j) of Ak=number of walks of length k from i to j\text{entry } (i, j) \text{ of } A^{k} = \text{number of walks of length } k \text{ from } i \text{ to } jLEARN
walks of length 1 to k from i to j=entry (i,j) of A+A2+⋯+Ak\text{walks of length } 1 \text{ to } k \text{ from } i \text{ to } j = \text{entry } (i, j) \text{ of } A + A^{2} + \dots + A^{k}LEARN
The leading diagonal of AkA^{k} counts closed walks of length kk. No zero off the diagonal of A+⋯+AkA + \dots + A^{k} means every vertex reaches every other in at most kk steps.LEARN
Weighted adjacency table: entries are weights of direct edges; blank (not 00) means no direct edge.LEARN
Transition matrix of a strongly connected directed graph, or a connected undirected one: TijT_{ij} is the probability of moving from jj to ii, so columns add to 11. With equally likely edges in a simple graph, Tij=1out-degree of jT_{ij} = \frac{1}{\text{out-degree of } j} when j→ij \to i is an edge, and 00 otherwise.LEARN

3.16 ◆Spanning trees, postman and salesman problems

Trail: no repeated edge. Path: no repeated vertex. Circuit: a closed trail. Cycle: a circuit with no repeated vertex except the start, which is also the end.LEARN
Connected graph: all vertices even gives an Eulerian circuit; exactly two odd vertices gives an Eulerian trail between them, but no circuit; more than two odd gives no Eulerian trail.LEARN
Hamiltonian path or cycle: every vertex exactly once. No degree test; find one by trying, or give a reason none exists (a vertex of degree 11 rules out a cycle).LEARN
An MST of a connected weighted graph with nn vertices has n−1n - 1 edges. Kruskal's: cheapest edges first, rejecting cycles. Prim's: grow from one vertex by the cheapest edge to a new vertex; it runs on a table.LEARN
Chinese postman (closed route, every edge, connected graph): least weight == total edge weight ++ least total of shortest routes over the pairings of the odd vertices.LEARN
Travelling salesman: use the table of least distances. Nearest neighbour gives an upper bound; deleted vertex (MST of the rest plus the two lightest edges at the deleted vertex) gives a lower bound. Keep the largest lower and smallest upper bound.LEARN

Which method when

Length or angle inside a solid, or between a line and the ground → find a right-angled triangle (a vertical height, or the line's projection on the plane), then Pythagoras or SOH CAH TOA; two points given as (x,y,z)(x, y, z) → the 3D distance formula, midpoint = mean of each coordinate (3.1)LEARN
Triangle with no right angle: a side and the angle facing it known → sine rule; two sides and the angle between them, or all three sides → cosine rule; area from two sides and the angle between them → 12absin⁡C\frac{1}{2}ab\sin C (3.2)LEARN
'Bearing', 'angle of elevation' or 'depression' in words → sketch first: north lines at every point, bearings clockwise from north, back bearing = bearing ±180∘\pm 180^{\circ}, elevation and depression from the horizontal; then the triangle rules, GDC in degree mode (3.3)LEARN
Slice of a circle with the angle at the centre in degrees → arc θ360×2πr\frac{\theta}{360} \times 2\pi r, sector θ360×πr2\frac{\theta}{360} \times \pi r^{2}, perimeter = arc +2r+ 2r; minor segment = sector −12r2sin⁡θ- \frac{1}{2}r^{2}\sin\theta in degree mode (3.4)LEARN
'Equally far from two places', a Voronoi edge or 'which site is nearest' → perpendicular bisector: through the midpoint, gradient −1m-\frac{1}{m} if m≠0m \neq 0; a vertex: solve two edges on the GDC; 'as far as possible from the nearest site' → in IB exams, the vertex furthest from its own three sites (3.5, 3.6)LEARN

◆Which method when

Angle in radians (no degree sign) → arc l=rθl = r\theta, sector A=12r2θA = \frac{1}{2}r^{2}\theta with θ\theta in radians; radian mode before any sin⁡\sin, cos⁡\cos or tan⁡\tan (3.7)LEARN
Two sides and an angle not between them, 'find the two possible values' → ambiguous case: sine rule gives sin⁡C=k\sin C = k; test sin⁡−1k\sin^{-1}k and 180∘−sin⁡−1k180^{\circ} - \sin^{-1}k, keeping each whose sum with the known angle is under 180∘180^{\circ}; k>1k > 1 means no triangle (3.8)LEARN
'Solve' a trigonometric equation in an interval → graph both sides on the GDC in the matching angle mode, with a window covering the whole interval, and find every intersection (3.8)LEARN
Stretch, enlargement, rotation or reflection of points → the booklet matrix in x′=Ax+b\boldsymbol{x}' = A\boldsymbol{x} + \boldsymbol{b}; AA followed by BB is the single matrix BABA; 'area of the image' → area of object ×∣det⁡A∣\times \lvert\det A\rvert (3.9)LEARN
Line through a point in a given direction, or through P and Q → r=a+λb\boldsymbol{r} = \boldsymbol{a} + \lambda\boldsymbol{b} with b=q−p\boldsymbol{b} = \boldsymbol{q} - \boldsymbol{p}; 'where does it meet the ground' → parametric form: solve z=0z = 0 for λ\lambda, then substitute into every coordinate (3.11)LEARN
Constant velocity, 'where is it at time tt' → r=r0+vt\boldsymbol{r} = \boldsymbol{r}_{0} + \boldsymbol{v}t, speed ∣v∣\lvert\boldsymbol{v}\rvert; 'do they meet' → one tt for every component; 'closest approach' → minimise ∣rB(t)−rA(t)∣\lvert\boldsymbol{r}_{\mathrm{B}}(t) - \boldsymbol{r}_{\mathrm{A}}(t)\rvert over the allowed times on the GDC; velocity in terms of tt → differentiate or integrate each component, one constant each (3.12)LEARN
Angle between two vectors, or 'show that they are perpendicular' → scalar product: cos⁡θ=v⋅w∣v∣∣w∣\cos\theta = \frac{\boldsymbol{v} \cdot \boldsymbol{w}}{\lvert\boldsymbol{v}\rvert\lvert\boldsymbol{w}\rvert}, with both vectors leaving the same point; non-zero vectors are perpendicular exactly when v⋅w=0\boldsymbol{v} \cdot \boldsymbol{w} = 0; between two lines take the acute (or right) angle (3.13)LEARN
Area of a triangle or parallelogram from 3D points, or a direction perpendicular to two non-parallel vectors → vector product of two sides from the same vertex: parallelogram ∣v×w∣\lvert\boldsymbol{v} \times \boldsymbol{w}\rvert, triangle 12∣v×w∣\frac{1}{2}\lvert\boldsymbol{v} \times \boldsymbol{w}\rvert; part of a\boldsymbol{a} along b\boldsymbol{b} → a⋅b∣b∣\frac{\boldsymbol{a} \cdot \boldsymbol{b}}{\lvert\boldsymbol{b}\rvert} (3.13)LEARN
'Number of walks of length kk from ii to jj' → entry (i,j)(i, j) of AkA^{k} on the GDC, rows 'from'; 'at most kk' → A+A2+⋯+AkA + A^{2} + \dots + A^{k}; random surfer or PageRank → transition matrix with columns 'from', each adding to 11 (3.15)LEARN
'Travel every edge exactly once' in a connected graph → count odd vertices: none gives an Eulerian circuit, two give a trail between them, more give neither; 'every edge at least once and back to the start' → Chinese postman: total weight + least-weight pairing of the odd vertices (3.16)LEARN
'Connect every site as cheaply as possible' → minimum spanning tree by Kruskal's or Prim's (n−1n - 1 edges; Prim's runs on a table); 'visit every place and return' → travelling salesman on a table of least distances: nearest neighbour gives an upper bound, deleted vertex a lower bound (3.16)LEARN
Follows the IB Maths AI guide (first assessment 2021). Not affiliated with the IB.