IB Math HL Year Two Nomen___________________________________

Magister Lao Dies___________________________________

IB Math HL Summary

1
2
3
4
5
6
7
8
 Things you should know how to use on the GDC:
Graphing:
 change the window
 zoom in/out/box/trig/standard
 table Setup (table start value)
Graphing Calculate Menu:
 value  intersect
 zero  derivative
 minimum  integral
 maximum  trace
Math Menu:
 typing fractions
 least common
 decimal to
multiple
fraction
 remainder
 roots
 conjugate
 derivative
 real/imaginary
 integral
part
 logarithm of
 angle (argument)
different base
 factorial
 absolute value
 permutations
 greatest
 combinations
common divisor
Matrix Menu:
 edit matrix
 solve system of equations (rref)
Calculator Screen:
 quit
 inserting values
 storing values as letters
 radians/degrees mode
Stat Menu:
 edit lists
 1 variable stats
Distributions Menu:
 NormalCDF
 InvNorm
 BinomPDF
 BinomCDF
 PoissonPDF
 PoissonCDF

9
10
 Useful facts and formulae to memorize that are NOT in the formulae booklet:
Topic 1: Algebra
Product logarithm law log 𝑐 𝑎 + log 𝑐 𝑏 = log 𝑐 𝑎𝑏 Power logarithm law log 𝑐 𝑎𝑟 = 𝑟 log 𝑐 𝑎
𝑎 The process of proof by the principle of mathematical
Quotient logarithm law log 𝑐 𝑎 − log 𝑐 𝑏 = log 𝑐
𝑏 induction
Modulus (length) of a Consider Quadrants
Argument arg(𝑧) = 𝜃 of
complex number √
|𝑧| = 𝑎 + 𝑏 2 2 𝑏
𝑧 = 𝑎 + 𝑏𝑖 a complex number tan(𝜃) =
𝑎
th 𝑛 𝑛 𝜃 2𝜋
𝑛 roots √𝑧 = 𝑧𝑘 of a complex number 𝑧 = 𝑟 cis(𝜃) 𝑧𝑘 = √𝑟 cis (𝑛 + 𝑛 𝑘) for 𝑘 = 0,1,2, … , 𝑛 − 1
Multiplying two complex numbers 𝑧1 𝑧2 = 𝑟1 𝑟2 [cos(𝜃1 + 𝜃2 ) + 𝑖 sin(𝜃1 + 𝜃2 )] = 𝑟1 𝑟2 cis(𝜃1 + 𝜃2 )
𝑧1 𝑟1 𝑟1
Dividing two complex numbers = [cos(𝜃1 − 𝜃2 ) + 𝑖 sin(𝜃1 − 𝜃2 )] = cis(𝜃1 − 𝜃2 )
𝑧2 𝑟2 𝑟2
Topic 2: Functions and Equations
Translate function Translate function
vertically 𝑘 units (+ up, - 𝑓(𝑥) ± 𝑘 horizontally ℎ units (+ 𝑓(𝑥 ± ℎ)
down) left, - right)
Reflect function over 𝑦- Reflect function over 𝑥-
𝑓(−𝑥) −𝑓(𝑥)
axis axis
11
 Useful facts and formulae to memorize that are NOT in the formulae booklet:
Vertical stretch (𝑎 > 0 ) Horizontal stretch (0 < 𝑎 < 1)
𝑎𝑓(𝑥) 𝑓(𝑎𝑥)
or shrink (𝑎 < 0) or shrink (𝑎 > 1)
Interpreting the discriminant Δ of a quadratic How to complete the square of a quadratic
The Remainder Theorem of polynomials: When a
The Factor Theorem of polynomials: A polynomial
polynomial 𝑃(𝑥) is divided by (𝑥 − 𝑐), the remainder
is the value of 𝑃(𝑐). In other words, 𝑃(𝑐) = 𝑅 𝑃(𝑥) has a factor of (𝑥 − 𝑐) if and only if 𝑃(𝑐) = 0
The Conjugate Root Theorem of polynomials: If a
polynomial 𝑃 has real coefficients and if the The Fundamental Theorem of Algebra: If a
complex number 𝑧 = 𝑎 + 𝑏𝑖 is a zero of 𝑃, then polynomial 𝑃(𝑥) has degree 𝑛, then that
the conjugate of 𝑧, written 𝑧 ∗ = 𝑎 − 𝑏𝑖, is also a polynomial will have exactly 𝑛 zeroes.
zero of 𝑃
The Sum and Product of Roots Theorem: For 𝑃(𝑥) of
The Sum and Product of Roots for Quadratics: For degree 𝑛, the sum of the roots is − 𝑎𝑛−1 and the
quadratics of the form 𝑎𝑥 2 + 𝑏𝑥 + 𝑐 = 0, the sum 𝑎𝑛
𝑏 𝑐 (−1)𝑛 𝑎0
of the roots is − 𝑎 and the product of the roots is 𝑎. product of the roots is 𝑎𝑛 .

Topic 3: Circular functions and trigonometry

Trigonometric ratios of special angles (multiples of 30° and 45°) i.e., the Unit Circle
Converting between degrees and radians Range restrictions on inverse trigonometric functions
Topic 4: Vectors
Vector addition/subtraction/negation/scaling Vector between two
terminal minus initial
geometrically with arrow drawings points
Volume of a
Area of parallelogram
|𝑣⃗ × 𝑤
⃗⃗⃗| parallelepiped spanned |𝑢
⃗⃗ ∙ (𝑣⃗ × 𝑤
⃗⃗⃗)|
spanned by vectors 𝑣⃗ and 𝑤 ⃗⃗⃗
by vectors 𝑢 ⃗⃗, 𝑣⃗ and 𝑤⃗⃗⃗
Angle between a line with Complement of angle
Angle between two planes with Dot product with 𝑛⃗⃗1 ⃗ and a found with dot product
normal vectors 𝑛⃗⃗1 and 𝑛⃗⃗2 and 𝑛⃗⃗2 direction vector 𝑑
plane with normal vector 𝑛⃗⃗ with 𝑑⃗ and 𝑛⃗⃗
Direction vector of line is cross product of the two
Equation of line formed by two intersecting planes normal vectors. Guess a point that lies on the line for
the initial position vectors of the line.
Topic 5: Statistics and probability
It’s all in your formulae book for probability. It’s all in your GDC for statistics
Topic 6: Calculus
Drawing and interpreting sign diagrams for Interpreting signs of velocity and acceleration to determine
both first and second derivatives speed (increasing if both same sign; decreasing if opposite signs)
Process of implicit differentiation Integration with substitution
Topic 10: Discrete Mathematics
The process of proof by the principle of strong
The pigeonhole principle
mathematical induction
The Euclidean algorithm for finding the greatest
The division algorithm for integers
common divisor of two numbers 𝑎 and 𝑏, gcd(𝑎, 𝑏)
Using the Euclidean algorithm for gcd(𝐴, 𝐵) but backwards to find a particular solution to the Diophantine
equation 𝐴𝑥 + 𝐵𝑦 = gcd(𝐴, 𝐵)
General solution to the Diophantine equation 𝑏 𝑎
𝑎𝑥 + 𝑏𝑦 = 𝑐 where (𝑥0 , 𝑦0 ) is a particular 𝑥 = 𝑥0 + ( ) 𝑘 and 𝑦 = 𝑦0 − ( )𝑘
solution, where 𝑘 ∈ ℤ gcd(𝑎, 𝑏) gcd(𝑎, 𝑏)
Changing between number bases Modular arithmetic rules (division is tricky)
Identifying when a linear congruence has a solution, and if it does, how many unique mutually incongruent
solutions modulo 𝑚 it has
Chinese remainder theorem and solving systems of linear congruences
Fermat’s Little Theorem: If 𝑝 is prime and 𝑝 doesn’t divide 𝑎, then 𝑎𝑝−1 ≡ 1(mod 𝑝)
To solve the first order recurrence relation To solve the second order recurrence relations of the
𝑢𝑛+1 = 𝑎𝑢𝑛 + 𝑏 form 𝑢𝑛+2 = 𝑎𝑢𝑛+1 + 𝑏𝑢𝑛 find the two solutions 𝑘1
𝑛
 set 𝑢𝑛 = 𝑐 × 𝑎 + 𝑑 and 𝑘2 to the quadratic auxiliary equation 𝑘 2 = 𝑎𝑘 +
 substitute into the recurrence relation to find 𝑑 𝑏. General solution is of the form
 substitute in the value of the first term to find 𝑐  𝑢𝑛 = 𝑐1 (𝑘1 )𝑛 + 𝑐2 (𝑘2 )𝑛 (for 𝑘1 ≠ 𝑘2 )
 𝑢𝑛 = (𝑐 + 𝑑𝑛)𝑘 𝑛 (for 𝑘1 = 𝑘2 )
Kruskal’s algorithm for finding a minimum spanning
Graph theory vocabulary
tree for a graph
Chinese Postman Problem (travel all edges at least
Dijkstra’s algorithm for the shortest path between two
once and return to start with minimum weight) for
vertices
graphs with two or four vertices of odd degree
Travelling Salesman Problem (visit all vertices exactly once) and Nearest Neighbor Algorithm for upper bound
and Deleted Vertex Algorithm for lower bound to the solution

12