Geometry and trigonometry
16 lessons · 10 HL only · 138 past-paper questions in the AI HL bank
● SL AND HL
6 lessonsDistance in 3D is Pythagoras with a third coordinate, and the midpoint averages each coordinate. You'll find volumes and surface areas of pyramids, cones, spheres, hemispheres and solids built from them. Then you'll find lengths and angles inside real objects by spotting right-angled triangles.
Trigonometry finds lengths and angles you can't measure directly. Right-angled triangles use sine, cosine and tangent. Any other triangle uses the sine rule, the cosine rule and 1/2absin C for the area.
A beach rescue, a kite, a mast or a drone route becomes a triangle problem once you draw it. Turn the words into a labelled diagram, then solve it with Pythagoras, right-angled trigonometry, the sine rule and the cosine rule. You also use angles of elevation and depression, and bearings.
A sector is a slice of a circle, and its arc is the curved edge. With the angle at the centre in degrees, both are a fraction θ/360 of the whole circle: of the circumference for the arc, of the area for the sector. Exams set them in real shapes, often inside a shaded region.
The perpendicular bisector of a segment is the line through its midpoint at right angles to it. Every point on it is equally far from the two ends, which is why Voronoi diagrams are built from these lines. You find its equation from the two end points, or from the segment's equation and its midpoint.
A Voronoi diagram splits a map into cells, one per site, so each point belongs to its nearest site. You find edges as perpendicular bisectors, add sites, estimate values from the nearest site, and find the point furthest from all sites.
◆ HL ONLY
10 lessonsA radian measures an angle by the arc it cuts off: an angle of one radian has an arc exactly as long as the radius. With the angle in radians, the arc and the sector of lesson 3.4 have short formulas, l = rθ and A = 1/2r²θ. The trigonometric models of lesson 2.9 use radians too.
The unit circle defines sine and cosine for any angle, which explains the graphs of sin x and cos x, the Pythagorean identity and tan θ = (sin θ)/(cos θ). It also explains the ambiguous case of the sine rule, where two triangles can fit the same data. You solve trigonometric equations by finding where graphs cross on your GDC.
A transformation matrix moves every point of a shape at once: x' = Ax + b can stretch, enlarge, rotate, reflect and translate. Multiplying matrices combines moves, repeating them builds fractals, and |det A| scales areas.
Vectors describe anything that has a size and points somewhere: a walk across a map, a pull on a rope, a drone's flight. This lesson writes them as columns or with i, j and k, combines them into a resultant, measures their length, and turns a speed plus a direction into a velocity.
A straight line is fixed by one point on it and one direction. The vector equation of a line, r = a + λb, gives every point on it, one for each value of λ. Split into parametric form, it gives each coordinate on its own, which is how you find where a path meets the ground, a wall or a given point.
When something moves, its position vector changes with time. With constant velocity, r = r₀ + vt tells you where it is at any moment, so you can find when two objects meet and when they are closest. When the velocity changes, you differentiate or integrate each component, which covers projectiles and circular motion.
There are two ways to multiply vectors. The scalar product v · w gives a number, which finds angles and tests for right angles. The vector product v × w gives a vector at right angles to both, and its length is an area. Together they split a wind or a force into the part along a direction and the part across it.
A graph is a set of points, called vertices, joined by lines, called edges. It records only what is linked to what, so it can model road maps, circuits, networks and one-way streets. Here you learn the words for describing graphs and how to turn a real situation into one.
An adjacency matrix stores a graph as a grid of numbers, and its powers count walks: entry (i, j) of A^k is the number of walks of length k from i to j. You also use weighted adjacency tables and build the transition matrix behind Google's PageRank.
Graph algorithms answer route questions: can you cover every road once, how cheaply can you connect every site, and what is the shortest round trip along every road or through every place? You name routes, find minimum spanning trees, and solve the Chinese postman and travelling salesman problems.