IB Math Revision
Knowledge organisers

Geometry and trigonometry: IB Maths AI HL knowledge organiser

Geometry and trigonometry for IB Maths AI HL, on one page.

Download the A4 sheet (PDF)

Key definitions

Graph
A set of vertices joined by edges; the degree of a vertex is the number of edge ends meeting it.
Eulerian circuit
A closed walk using every edge exactly once; a connected graph has one when every degree is even.
Minimum spanning tree
The cheapest set of edges that joins every vertex with no cycles (Kruskal's or Prim's algorithm).
Adjacency matrix
A table whose entry in row i, column j is the number of edges joining vertex i to vertex j.

Key formulas

Formulas marked with a label are given in the exam (we only say so where our formula sheet confirms it). Learn the rest.

3D distance (Δx=x1−x2, …)In the formula bookletd=Δx2+Δy2+Δz2
3D midpointIn the formula booklet(x1+x22,y1+y22,z1+z22)
Pyramid; cone; sphereIn the formula bookletV=13Ah; V=13πr2h, A=πrl; V=43πr3, A=4πr2
Sine, cosine rules; areaIn the formula bookletasin⁡A=bsin⁡B=csin⁡C, c2=a2+b2−2abcos⁡C, A=12absin⁡C
Arc; sector, degreesIn the formula bookletl=θ3602πr, A=θ360πr2
Arc; sector, radiansIn the formula bookletl=rθ, A=12r2θ
IdentitiesIn the formula bookletcos2⁡θ+sin2⁡θ=1, tan⁡θ=sin⁡θcos⁡θ
Radians; bearingsπ rad=180∘; bearings clockwise from north
Perpendicular bisectors & Voronoi: cell edges on perpendicular bisectors of sites; largest empty circle at a vertex or on the boundary
Reflection in y=(tan⁡θ)xIn the formula booklet(cos⁡2θsin⁡2θsin⁡2θ−cos⁡2θ)
Stretch ×k: horizontal, vertical; enlargementIn the formula booklet(k001), (100k); (k00k)
Rotation about O by θ: anticlockwise; clockwiseIn the formula booklet(cos⁡θ−sin⁡θsin⁡θcos⁡θ); (cos⁡θsin⁡θ−sin⁡θcos⁡θ)
Area of image|detA|×area of object
Composite transformation: B then A is AB
Vector magnitudeIn the formula booklet|v|=v12+v22+v32
Scalar product; angleIn the formula bookletv⋅w=v1w1+v2w2+v3w3=|v||w|cos⁡θ

More formulas are on the full IB Maths AI HL formula sheet.

Worked example

A connected graph has vertex degrees 2, 4, 3, 3 and 2. How many edges does it have, and does it have an Eulerian circuit?

  1. The degrees add to twice the number of edges: 2+4+3+3+2=14
  2. Two vertices have odd degree

Answer: 7 edges. No Eulerian circuit, but there is an Eulerian trail between the two odd vertices

Common mistakes

  • IB notation: AB as a length, vectors in columns, f−1 vs f′, the variables asked for
  • Graph algorithms: Prim vs nearest neighbour, no method shown, bounds mixed up
  • Using the 2D distance formula without the extra z-term in 3D
  • Using the whole circle (not the fraction θ360) when finding an arc length or sector area

More on what examiners see students get wrong: Examiner Insights.

You should be able to…

  • Find the distance between two points and the midpoint of a line segment in three dimensions, using the 3D form of Pythagoras' theorem.
  • Use the cosine rule to find a side from two sides and the included angle, and an angle from three sides.
  • Find the equation of the perpendicular bisector of two points and use bisectors to construct the cells of a Voronoi diagram for a few sites.
  • Use the language of graph theory, find the degree of each vertex and recognise simple, complete and connected graphs.
  • Use the nearest-neighbour algorithm to find an upper bound for the travelling salesman problem, starting from different vertices to improve it.
  • Build a table of least distances and use the nearest-neighbour and deleted-vertex algorithms to bound the best tour.

The printable sheet

Geometry and trigonometry knowledge organiser for IB Maths AI HL: one A4 page of key definitions, formulas, a worked example and common mistakes
Geometry and trigonometry knowledge organiser (IB Maths AI HL), A4. Download the PDF.

Revise it next

Other IB Maths AI HL topics: Number and algebra · Functions · Statistics and probability · Calculus · All IB Maths AI HL organisers