BOOKLET given in the examLEARN you must remember it · Each block links to its lesson.
Geometry and trigonometry
IB MATHS AI · HLpastpaperprep.com/revision-notes
3.13D distance, midpoint and measurement
Distance in 3D: . The midpoint is the mean of each coordinate.BOOKLET
Right pyramid: . Right cone: and curved area . Sphere: and .BOOKLET
Right cone: slant height . Use for the volume and for the curved area.LEARN
Hemisphere: , curved area , and total area 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 . 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
LEARN
In a right-angled triangle, find an acute angle by undoing the ratio with , or , with the GDC in degree mode.LEARN
BOOKLET
BOOKLET
BOOKLET
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 : two sides and the angle between them.LEARN
In a triangle, a negative cosine means an obtuse angle, and 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
LEARN
BOOKLET
BOOKLET
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 .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
BOOKLET
BOOKLET
In both formulas is the angle at the centre in degrees and is the radius.LEARN
Perimeter of a sector arc : the arc plus the two radii.LEARN
The major sector made by two radii has angle , where is the minor sector's angle.LEARN
Segment between a chord and its minor arc sector triangle , with the angle at the centre in degrees (GDC in degree mode).LEARN
3.5Perpendicular bisectors
The perpendicular bisector of passes through the midpoint of at right angles to it. In a plane, a point is on it exactly when it is the same distance from as from .LEARN
From two points: find the midpoint and the gradient of . If , the bisector has gradient ; use it with the midpoint in .LEARN
From a segment's equation and midpoint: read the segment's gradient from the equation (make the subject). If , use through the midpoint.LEARN
A horizontal segment has a vertical bisector, the midpoint's -coordinate. A vertical segment has a horizontal bisector, the midpoint's -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 if the segment's gradient is (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 unit is km on a map, square unit is .LEARN
3.7 ◆Radians, arc length and sector area
radians , so a full turn is radians. Multiply by to get radians, and by to get degrees.LEARN
BOOKLET
BOOKLET
In and , is the radius and is the angle at the centre in radians.LEARN
Perimeter of a sector , with in radians. The major sector made by two radii has angle , where is the minor sector's angle.LEARN
Set your GDC to radian mode before finding , or of an angle in radians.LEARN
3.8 ◆Unit-circle trigonometry and equations
On the unit circle, the point at angle anticlockwise from the positive -axis is . On a circle of radius centred at the origin it is .LEARN
and stay between and and repeat every ( radians).LEARN
BOOKLET
BOOKLET
is the gradient of ; it is undefined when . After a square root, choose the sign of or from where lies; in a triangle .LEARN
Ambiguous case (two sides and an angle not between them): if the sine rule gives with , test both and ; keep each one whose sum with the known angle is under . If , ; if 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
BOOKLET
BOOKLET
BOOKLET
BOOKLET
BOOKLET
BOOKLET
: the matrix acts first, then the translation . The columns of are the images of and under alone, before the translation.LEARN
The booklet's rotations are about the origin, with . Its reflection matrix uses , where the mirror line passes through the origin.LEARN
Transformation followed by transformation has the single matrix : the first one goes on the right.LEARN
With no translation, applying times gives .LEARN
Area of image area of object for ; translations don't change area. For then , .LEARN
A fractal stage making non-overlapping copies of each piece, each with area factor , multiplies the area by : a geometric sequence.LEARN
3.10 ◆Vectors in 2D and 3D
BOOKLET
; 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 balance.LEARN
: subtract the start from the end. The distance between A and B is .LEARN
If and are non-zero, they are parallel exactly when for some scalar ; a negative means they point in opposite directions.LEARN
For non-zero , the unit vector with the same direction is , and the vector of length in that direction is .LEARN
Velocity = speed the unit vector in the direction of motion. Speed is the magnitude of velocity, never negative.LEARN
3.11 ◆Vector equations of lines
BOOKLET
In , is the position vector of any point on the line and is any non-zero vector parallel to it. Through P and Q, use .LEARN
For : is P, is Q, and is the segment PQ. With a different point or direction, means something different.LEARN
A point lies on a line only if one value of gives every one of its coordinates.LEARN
BOOKLET
From parametric form back to : the constants give the point, the coefficients of give the direction, and a coordinate with no term has direction component .LEARN
To find where a line meets a condition such as : solve that coordinate's equation for , then substitute that into every coordinate. If that coordinate has no term, there is no single meeting point.LEARN
3.12 ◆Kinematics with vectors
LEARN
For constant velocity : is the position at , the speed is , and the distance travelled in time is .LEARN
Relative position of B from A at time : , B's position minus A's at the same . Its magnitude is the distance between them, and the objects meet only if it is at some time.LEARN
Closest approach: minimise over the allowed times with the GDC. For constant velocities, 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 is a motion that starts at , the same motion starting at is , for .LEARN
and , component by component. Integrating back needs one constant per component, fixed by a known position or velocity.LEARN
Projectile launched from with velocity at , ignoring air resistance, with up and units of metres and seconds: , so . For , the highest point is where .LEARN
(, , in radians) is motion on a circle of radius about the origin, with speed and period .LEARN
3.13 ◆Scalar and vector products
BOOKLET
For non-zero vectors, exactly when they are perpendicular. A positive scalar product means , and a negative one means .LEARN
The angle between two lines is the angle between their direction vectors, taken as acute or right: if you get , use .LEARN
BOOKLET
with the angle between and . It is perpendicular to both, since is a unit vector at right angles to each, pointing the way the right-hand screw rule gives; it is when they are parallel. Order matters: .LEARN
BOOKLET
LEARN
LEARN
3.14 ◆Graph theory basics
LEARN
Degree counts edge ends at a vertex: a loop adds , 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 : simple, with every pair of its vertices joined, so it has 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 , with both ends of every kept edge also kept.LEARN
Tree: connected with no cycles. A tree with vertices has edges, and a connected graph with vertices and edges is a tree.LEARN
3.15 ◆Adjacency matrices and walks
Adjacency matrix: entry is the number of edges directly from to . 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
LEARN
LEARN
The leading diagonal of counts closed walks of length . No zero off the diagonal of means every vertex reaches every other in at most steps.LEARN
Weighted adjacency table: entries are weights of direct edges; blank (not ) means no direct edge.LEARN
Transition matrix of a strongly connected directed graph, or a connected undirected one: is the probability of moving from to , so columns add to . With equally likely edges in a simple graph, when is an edge, and 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 rules out a cycle).LEARN
An MST of a connected weighted graph with vertices has 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 → 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 → (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 , 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 , sector , perimeter = arc ; minor segment = sector in degree mode (3.4)LEARN
◆Which method when
Angle in radians (no degree sign) → arc , sector with in radians; radian mode before any , or (3.7)LEARN
Two sides and an angle not between them, 'find the two possible values' → ambiguous case: sine rule gives ; test and , keeping each whose sum with the known angle is under ; 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 ; followed by is the single matrix ; 'area of the image' → area of object (3.9)LEARN
Line through a point in a given direction, or through P and Q → with ; 'where does it meet the ground' → parametric form: solve for , then substitute into every coordinate (3.11)LEARN
Constant velocity, 'where is it at time ' → , speed ; 'do they meet' → one for every component; 'closest approach' → minimise over the allowed times on the GDC; velocity in terms of → differentiate or integrate each component, one constant each (3.12)LEARN
Angle between two vectors, or 'show that they are perpendicular' → scalar product: , with both vectors leaving the same point; non-zero vectors are perpendicular exactly when ; 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 , triangle ; part of along → (3.13)LEARN
'Number of walks of length from to ' → entry of on the GDC, rows 'from'; 'at most ' → ; random surfer or PageRank → transition matrix with columns 'from', each adding to (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 ( 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.