Skip to main content

IB Math AI SL Revision Notes

Formulas, conditions, key connections and common exam traps across the five AI SL topics. Use it alongside the formula booklet and regular question practice.

Abdulhamid, IB Math tutor

Written by IB Math tutor Abdulhamid

IB Math Master ยท Updated

For the current AI SL syllabus, for exams up to November 2028.

Get the printable PDF

How to use these notes

Each topic is split into short sections. Every section keeps its formulas, conditions and diagrams together.

  • Connection (blue dot): links between formulas that the formula booklet does not state.
  • Exam note (gold diamond): short reminders and common traps.
  • Video: a link to my explanation of the topic.

Topic 1 Number and Algebra

Numbers and Approximation

Standard form and accuracy

NameFormulaCondition
Standard form
aร—10k
1โ‰คa<10, kโˆˆโ„ค
  • Connection: Standard form products: multiply the a parts, add the powers of 10, then rescale to 1โ‰คa<10.
  • Exam note: The GDC shows 4.52Eโˆ’4. Write 4.52ร—10โˆ’4.
  • Exam note: Give answers exactly or to 3 significant figures, unless the question says otherwise.
  • Exam note: Keep full calculator values in your working. Round only the final answer.

Percentage error

NameFormulaCondition
Percentage error
ฮต=|vAโˆ’vEvE|ร—100%
vE = exact value
vA = approximate value
  • Exam note: Percentage error divides by the exact value vE.

Back to topics

Sequences and Series

Arithmetic and geometric sequences

ItemArithmetic common difference dGeometric common ratio r
nth term
un=u1+(nโˆ’1)d
un=u1rnโˆ’1
Sum of n terms
Sn=n2(2u1+(nโˆ’1)d)=n2(u1+un)
Sn=u1(rnโˆ’1)rโˆ’1=u1(1โˆ’rn)1โˆ’r,ย rโ‰ 1
Finding d or r
u2โˆ’u1=u3โˆ’u2=โ‹ฏ=d
u2u1=u3u2=โ‹ฏ=r
  • Exam note: n counts terms, so nโˆˆโ„ค+.

Sums and sigma notation

NameFormulaCondition
Sigma notation
โˆ‘i=1nui=u1+u2+โ‹ฏ+un
i runs through whole numbers
  • Connection: For any sequence:
    S1=u1
    S2=u1+u2
    S3=u1+u2+u3
    un=Snโˆ’Snโˆ’1 for nโ‰ฅ2
  • Exam note: In sigma notation, check the first and last values of i.

Back to topics

Financial Mathematics

Compound interest and depreciation

NameFormulaCondition
Compound interest
FV=PVร—(1+r100k)kn

FV = future value, PV = present value, n = number of years, k = number of compounding periods per year, r% = nominal annual rate of interest

geometric, ratio 1+r100k per period
Depreciation
Vn=V0ร—(1โˆ’r100)n

V0 = starting value, Vn = value after n years, r% = annual rate of depreciation

geometric, ratio 1โˆ’r100 per year
  • Exam note: Number of years to reach a target: the answer is not a whole number. Round up to the next whole compounding period (to whole years when compounding is yearly).

Loans and annuities

TVM solver entryMeaning
N

number of payments

I%

annual interest rate

PV

present value: the amount borrowed or invested at the start

PMT

payment each period

FV

future value: the amount at the end

P/Y

payments per year

C/Y

compounding periods per year

  • Connection: Loan fully repaid: FV=0
  • Connection: Total repaid: add up all the payments. That is the number of payments times the amount of each payment.
  • Connection: Interest paid: the total repaid minus the amount borrowed.
  • Exam note: Money paid out is negative and money received is positive.
  • Exam note: Write down the values you enter in the TVM solver. They earn method marks.
  • Exam note: Monthly payments: P/Y=12. Set C/Y from the question.

Back to topics

Exponents and Logarithms

Exponent laws

NameFormulaCondition
Same base
amร—an=am+naman=amโˆ’n(am)n=amn
Zero and negative
a0=1aโˆ’n=1an
aโ‰ 0

Logarithms

NameFormulaCondition
Definition of a log
ax=bโ€…โ€ŠโŸบโ€…โ€Šx=logโกab
a>0, b>0, aโ‰ 1
Base 10 and base e
logโกx=logโก10xlnโกx=logโกex
eโ‰ˆ2.718
  • Connection: logโกa1=0 and logโกaa=1
  • Connection: alogโกax=x and logโกaax=x
  • Exam note: On the GDC, log is base 10 and ln is base e.
  • Exam note: To find an unknown power, use the GDC solver.

Back to topics

Systems of Linear Equations

Systems of linear equations

  • Exam note: Systems of up to 3 equations and polynomial equations: solve on the GDC, but write the equations first.

Back to topics

Topic 2 Functions

Straight Lines

Equations and gradients

NameFormulaCondition
Straight line
y=mx+cax+by+d=0yโˆ’y1=m(xโˆ’x1)
Gradient
m=y2โˆ’y1x2โˆ’x1
x1โ‰ x2
Parallel lines
m1=m2
Perpendicular lines
m1ร—m2=โˆ’1m2=โˆ’1m1
  • Connection: In a linear model, m is the change in y for each unit increase in x and c is the value at x=0.
  • Exam note: ax+by+d=0 usually needs whole numbers a, b and d.
  • Exam note: A vertical line is x=k. Its gradient is undefined.

Back to topics

Functions and Inverses

Functions

NameFormulaCondition
Function

Each x in the domain gives exactly one y

Domain, range

Domain: the allowed inputs. Range: the outputs.

  • Exam note: In a model, the domain comes from the context, for example tโ‰ฅ0.

Inverse functions

  • Connection: The graph of fโˆ’1 is the reflection of f in y=x.
  • Connection: Domain of fโˆ’1 = range of f
    Range of fโˆ’1 = domain of f
  • Exam note: fโˆ’1(x) is not 1f(x).
๐‘ฅ๐‘ฆ๐‘ฆ=๐‘ฅ๐‘“๐‘“โˆ’1
(1,2) on f and (2,1) on fโˆ’1

Back to topics

Polynomial and Variation Models

Quadratic models

FormEquationWhat it shows
Standard
f(x)=ax2+bx+c,
aโ‰ 0
y-intercept (0,c)
axis of symmetry x=โˆ’b2a
vertex (โˆ’b2a,ย f(โˆ’b2a))
Factor
f(x)=a(xโˆ’p)(xโˆ’q)
zeros p and q
axis of symmetry x=p+q2
Vertex
f(x)=a(xโˆ’h)2+k
vertex (h,k)
axis of symmetry x=h
  • Connection: a>0: minimum at the vertex. a<0: maximum at the vertex.
  • Exam note: Check the maximum or minimum lies inside the domain of the model.
๐‘ฅ๐‘ฆaxisofsymmetry๐‘ฅ=30,๐‘=0,5๐‘=1๐‘ž=5โ„Ž,๐‘˜=3,โˆ’4
f(x)=x2โˆ’6x+5=(xโˆ’1)(xโˆ’5)=(xโˆ’3)2โˆ’4

Cubic models

NameFormulaCondition
Cubic
f(x)=ax3+bx2+cx+d,ย aโ‰ 0
At most 2 turning points
๐‘ฅ๐‘ฆ
  • Exam note: Zeros, turning points and intersections: use the GDC.

Direct and inverse variation

NameFormulaCondition
Direct variation

y is directly proportional to xn:

y=axn,ย nโˆˆโ„ค+,ย aโ‰ 0

The graph passes through the origin. With n=1 it is a straight line.

๐‘ฅ๐‘ฆ
y=2x (n=1)
Inverse variation

y is inversely proportional to xn:

y=axn,ย nโˆˆโ„ค+,ย aโ‰ 0

Asymptotes x=0 and y=0.

๐‘ฅ๐‘ฆ
y=4x (n=1)
  • Exam note: โ€œy is proportional to x2โ€ means y=ax2. โ€œy is inversely proportional to xโ€ means y=ax. Find a from one data point.

Back to topics

Exponential Models

Exponential models

NameFormulaCondition
Exponential
f(x)=kax+c,ย a>0,ย aโ‰ 1
f(x)=kerx+c
asymptote y=c
  • Connection: The value at x=0 is k+c.
  • Connection: kerx: r>0 growth and r<0 decay
  • Exam note: In f(t)=kert+c, the initial value is k+c, not k.
  • Exam note: Long-term value: let xโ†’โˆž. Exponential decay tends to c.
๐‘ฅ๐‘ฆ๐‘ฆ=๐‘๐‘˜+๐‘๐‘
y=4eโˆ’0.5x+1: starts at k+c=5 and tends to c=1

Back to topics

Sinusoidal Models

Sinusoidal models

NameFormulaCondition
Sinusoidal
f(x)=asinโก(bx)+df(x)=acosโก(bx)+d
b>0
FeatureFrom the functionFrom the graph
Amplitude
|a|
maxโˆ’min2
Period
360โˆ˜b

from a maximum to the next maximum, or from a minimum to the next minimum

then b=360โˆ˜period

Principal axis
y=d
y=max+min2
Maximum, minimum
d+|a|,ย dโˆ’|a|

the highest and lowest y-values

  • Exam note: Set the GDC to degrees.

Back to topics

Modelling

Choosing and using a model

  • Exam note: Choose a model from the shape of the data and the context. Give a reasonable domain.
  • Exam note: Predictions far outside the data are not reliable.
  • Exam note: โ€œSketchโ€: show the shape and key features. โ€œDrawโ€: plot accurately to scale.
  • Exam note: Label intercepts, turning points, asymptotes and end points of the domain.

Back to topics

Topic 3 Geometry and Trigonometry

3D Geometry and Triangles

Points in 3D

NameFormulaCondition
Distance
d=(x1โˆ’x2)2+(y1โˆ’y2)2+(z1โˆ’z2)2
Midpoint
(x1+x22,ย y1+y22,ย z1+z22)

Solids

NameFormulaCondition
Right pyramid
V=13Ah, A = area of base, h = height
Right cone
V=13ฯ€r2h curved surface A=ฯ€rl
total surface =ฯ€rl+ฯ€r2 l2=r2+h2, l = slant height
Sphere
V=43ฯ€r3A=4ฯ€r2
Hemisphere
V=23ฯ€r3 curved surface 2ฯ€r2
โ„Ž๐‘Ÿ๐‘™

Right-angled triangles

NameFormulaCondition
Ratios
sinโกฮธ=opphypcosโกฮธ=adjhyptanโกฮธ=oppadj
Pythagoras
a2+b2=c2, c = hypotenuse
๐œƒadjacentoppositehypotenuse
Opposite and adjacent are named from ฮธ.

Angle between a line and a plane

  • Connection: Drop a perpendicular from a point on the line to the plane. This gives the projection of the line on the plane.
  • Connection: ฮธ is the angle between the line and its projection. Find it in that right-angled triangle.
๐œƒ
ฮธ is measured to the projection on the plane.

Any triangle

NameFormulaCondition
Sine rule
asinโกA=bsinโกB=csinโกC
Cosine rule
c2=a2+b2โˆ’2abcosโกC
cosโกC=a2+b2โˆ’c22ab
Area
A=12absinโกC
๐ด๐ต๐ถ๐‘๐‘Ž๐‘
Side a is opposite angle A, and so on.
Use the sine rule when you knowUse the cosine rule when you know
  • two angles and one side
  • two sides and the angle between them
  • two sides and an angle not between them
  • all three sides
  • Exam note: Draw and label a diagram from the words first.

Elevation, depression and bearings

NameFormulaCondition
Elevation, depression

Measured from the horizontal

๐ด๐ตelevationdepression
Bearings

Measured clockwise from north, with three figures, for example 065โˆ˜

N065โˆ˜

Back to topics

Circles

Arcs and sectors

NameFormulaCondition
Arc length
l=ฮธ360ร—2ฯ€r
degrees
Sector area
A=ฮธ360ร—ฯ€r2
degrees
๐‘Ÿ๐‘™๐œƒ๐ด

Back to topics

Voronoi Diagrams

Perpendicular bisectors

NameFormulaCondition
Perpendicular bisector of AB

Through the midpoint M of AB, gradient โˆ’1mAB

Every point on it is equidistant from A and B.

  • Connection: Equation: yโˆ’yM=โˆ’1mAB(xโˆ’xM)
  • Connection: AB horizontal: the bisector is x=xM. AB vertical: the bisector is y=yM.
๐ด๐ต๐‘€๐‘ƒ
Any point P on the bisector: PA=PB.

Voronoi diagrams

NameFormulaCondition
Cell

All points closer to its site than to any other site

Edge

Part of the perpendicular bisector of two sites

Vertex

Where at least three edges meet.
Equidistant from 3 or more sites.

Nearest neighbour interpolation

A point takes the value of the site whose cell contains it

  • Connection: Adding a site: draw the bisectors between the new site and its neighbours, then remove the old edges inside the new cell.
  • Connection: The bisectors of AB and BC meet at a point equidistant from A, B and C, so the bisector of AC passes through it too.
๐ด๐ต๐ถ๐ท
Sites in blue, vertices in gold.

Back to topics

Topic 4 Statistics and Probability

Sampling and Data

Data and sampling methods

NameFormulaCondition
Types of data

Discrete data is counted. Continuous data is measured.

Simple random

Every possible sample of that size is equally likely

Systematic

Every kth member from a list

k=populationsampleย size
Stratified
Each group in proportion: groupย sizepopulationร—sampleย size
Quota

A fixed number from each group, not chosen at random

Convenience

The members easiest to reach

  • Connection: Random sampling reduces bias. Quota and convenience samples are not random.

Back to topics

Descriptive Statistics

Mean and spread

NameFormulaCondition
Mean
xยฏ=โˆ‘fixin
n=โˆ‘fi
Grouped data

Mid-interval values as xi. Modal class: highest frequency.

gives an estimate
Standard deviation

ฯƒ from the GDC. Variance =ฯƒ2

  • Connection: Add k to every value: mean+k. ฯƒ and IQR unchanged.
  • Connection: Multiply every value by k: meanร—k, ฯƒร—|k|, ฯƒ2ร—k2
  • Exam note: Use ฯƒx from the GDC for the standard deviation of the data.

Quartiles, box plots and histograms

NameFormulaCondition
Interquartile range
IQR=Q3โˆ’Q1
Outlier

below Q1โˆ’1.5ร—IQR or above Q3+1.5ร—IQR

Cumulative frequency

read across at n4 for Q1, n2 for the median, 3n4 for Q3

  • Exam note: Remove an outlier only if it is an error.
  • Exam note: Histograms of continuous data have no gaps between bars.
0123456789101112131415161718min=1๐‘„1=4median=8๐‘„3=13max=16IQR=13โˆ’4=9
Box plot data: 1, 3, 4, 6, 7, 8, 10, 11, 13, 14, 16. Read each value from the scale.

Back to topics

Correlation and Regression

Correlation

NameFormulaCondition
Pearsonโ€™s r
โˆ’1โ‰คrโ‰ค1
linear correlation
Spearmanโ€™s rs

First rank the data for each variable. Then find Pearsonโ€™s r of the ranks.

tied ranks: use the average
  • Connection: r close to ยฑ1: strong linear correlation. r close to 0: weak or no linear correlation.
  • Connection: rs=1: always increasing, not always linear. rs is less affected by outliers than r.
  • Connection: Scatter diagram: plot each pair (x,y) as a point. A line of best fit drawn by eye passes through the mean point (xยฏ,yยฏ).
  • Exam note: Use r for linear data and rs for non-linear but monotonic data.
  • Exam note: Correlation does not mean causation.
๐‘ฅ๐‘ฆ
r close to 1: strong positive
๐‘ฅ๐‘ฆ
r close to 0: no linear correlation
๐‘ฅ๐‘ฆ
rs=1: always increasing, r<1

Regression line

NameFormulaCondition
Regression line of y on x

y=ax+b: predicts y from x

  • Connection: For each increase of 1 in x, y changes by a.
    When x=0, y=b.
  • Connection: The line passes through (xยฏ,yยฏ).
  • Exam note: Interpolation is reliable when the correlation is strong (r is close to ยฑ1). Extrapolation is not reliable.
๐‘ฅ๐‘ฆ๐‘ฆon๐‘ฅ๐‘ฅฬ„๐‘ฆฬ„
The line passes through (xยฏ,yยฏ).

Back to topics

Probability

Basic rules

NameFormulaCondition
Probability of A

P(A)=n(A)n(U), equally likely outcomes

Complementary events
P(A)+P(Aโ€ฒ)=1
Combined events
P(AโˆชB)=P(A)+P(B)โˆ’P(AโˆฉB)
Mutually exclusive
P(AโˆฉB)=0
Expected number
np for n trials with probability p
  • Connection: P(A)=P(AโˆฉB)+P(AโˆฉBโ€ฒ)
๐ด๐ต๐‘ˆ๐ดโˆฉ๐ต:inboth๐ดand๐ต๐ด๐ต๐‘ˆ๐ดโˆช๐ต:in๐ดor๐ตorboth
P(A)+P(B) counts AโˆฉB twice, so subtract P(AโˆฉB) once.

Conditional probability and independence

NameFormulaCondition
Conditional
P(AโˆฃB)=P(AโˆฉB)P(B)
Independent
P(AโˆฉB)=P(A)โ€‰P(B)
  • Connection: Independent โ€…โ€ŠโŸบโ€…โ€ŠP(AโˆฃB)=P(A)
  • Connection: Mutually exclusive events with non-zero probabilities are never independent.
  • Exam note: โ€œGiven thatโ€ means conditional: divide by the probability of the given event.

Tree diagrams

  • Connection: Multiply along branches and add the end results.
  • Connection: A conditional probability from a tree: the branch you want over all branches that give the condition.
  • Exam note: Without replacement, the second-stage probabilities change.
0.010.990.950.050.080.92๐ต๐ต๐ด0.01ร—0.95๐ด๐ด0.99ร—0.08๐ด
P(BโˆฃA)=0.01ร—0.950.01ร—0.95+0.99ร—0.08

Back to topics

Binomial Distribution

Discrete random variables

NameFormulaCondition
Discrete distribution
โˆ‘P(X=x)=1E(X)=โˆ‘xโ€‰P(X=x)
  • Connection: Fair game: E(gain)=0

Binomial distribution

NameFormulaCondition
Binomial
XโˆผB(n,p)E(X)=npVarโก(X)=np(1โˆ’p)
  • Connection: Conditions: fixed n, two outcomes, constant p, independent trials
  • Connection: P(Xโ‰ฅk)=1โˆ’P(Xโ‰คkโˆ’1)
    P(X>k)=1โˆ’P(Xโ‰คk)
  • Exam note: GDC: pdf for P(X=x) and cdf for P(Xโ‰คx).
  • Exam note: โ€œAt leastโ€, โ€œmore thanโ€ and โ€œfewer thanโ€: rewrite with โ‰ค before using the cdf.
0123456P๐‘‹โ‰ค2P๐‘‹โ‰ฅ3
XโˆผB(6,0.4): P(Xโ‰ฅ3)=1โˆ’P(Xโ‰ค2)

Back to topics

Normal Distribution

The normal distribution

NameFormulaCondition
Normal

XโˆผN(ฮผ,ฯƒ2), ฯƒ2= variance

  • Exam note: N(ฮผ,ฯƒ2) gives the variance. Take the square root for ฯƒ.
  • Exam note: Inverse normal: check which tail the GDC uses.
๐œ‡โˆ’2๐œŽ๐œ‡โˆ’๐œŽ๐œ‡๐œ‡+๐œŽ๐œ‡+2๐œŽ68%
Within 1ฯƒ: about 68%. Within 2ฯƒ: about 95%. Within 3ฯƒ: about 99.7%.

Back to topics

Hypothesis Tests

Setting up a test

NameFormulaCondition
Hypotheses

H0: no effect or no change. H1: what you are testing for.

One-tailed, two-tailed

One-tailed: H1 uses < or >. Two-tailed: H1 uses โ‰ .

Decision

p-value < significance level: reject H0

  • Exam note: Conclude in context: โ€œThere is sufficient evidence at the 5% level thatโ€ฆโ€
  • Exam note: Never say H0 is proved. Say โ€œdo not reject H0โ€.

Choosing the test

You are testingTestH0H1Use when
two means
two-sample t-test
ฮผ1=ฮผ2
ฮผ1โ‰ ฮผ2
independent samples from normal populations. Pooled: equal variances.
independence
ฯ‡2 test for independence
independent
not independent
a contingency table
a distribution
ฯ‡2 goodness of fit
the data fit
the data do not fit
frequencies in classes

Back to topics

ฯ‡2 Tests

ฯ‡2 tests

TestH0Expected frequency feDegrees of freedom ฮฝ
Independence
the two variables are independent
fe=rowย totalร—columnย totalgrandย total
ฮฝ=(rโˆ’1)(cโˆ’1)
r rows, c columns
Goodness of fit
the data fit the given distribution
fe= total frequency ร— probability of the class
ฮฝ= number of classes โˆ’1
  • Connection: fo= observed frequency: the counts in the data. fe= expected frequency: the counts you would expect if H0 were true.
  • Connection: The GDC gives ฯ‡calc2 and the p-value. Reject H0 when the p-value < significance level.
  • Exam note: Every expected frequency must be at least 5. If not, combine classes and reduce ฮฝ.

Back to topics

Topic 5 Calculus

Derivatives, Tangents and Normals

The derivative

NameFormulaCondition
Derivative
dydx=fโ€ฒ(x): the gradient function and the rate of change of y with respect to x
Power rule
f(x)=axnย โ‡’ย fโ€ฒ(x)=anxnโˆ’1
  • Connection: The derivative is the limit of the gradient of a chord as the chord shrinks.
  • Connection: Rewrite first: 1x2=xโˆ’2
๐‘ฅ๐‘ฆ๐‘ฅ๐‘ฅ+โ„Žchordtangent
As hโ†’0 the chord turns into the tangent.

Tangents and normals

NameFormulaCondition
Tangent at (x1,y1)
yโˆ’y1=m(xโˆ’x1),m=fโ€ฒ(x1)
Normal at (x1,y1)
yโˆ’y1=โˆ’1m(xโˆ’x1),mโ‰ 0
  • Connection: The normal is perpendicular to the tangent.
  • Exam note: Find y1 from f(x1), not from fโ€ฒ(x1).
  • Exam note: GDC: the derivative at a point and the tangent line can be checked.
๐‘ฅ๐‘ฆtangentnormal๐‘ฆ=๐‘“๐‘ฅ
y=x3โˆ’2x at (1,โˆ’1)
tangent y=xโˆ’2, normal y=โˆ’x

Back to topics

Stationary Points and Optimisation

Shape of a graph

IfThen

fโ€ฒ(x)>0

f is increasing

fโ€ฒ(x)<0

f is decreasing

fโ€ฒ(a)=0

stationary point at x=a

  • Connection: f turns where fโ€ฒ=0 and fโ€ฒ changes sign.
๐‘ฅ๐‘“๐‘ฅ๐‘Ž=โˆ’1:๐‘“๐‘Ž=0max๐‘Ž=1:๐‘“๐‘Ž=0min๐‘ฅ๐‘“๐‘ฅ
f(x)=x3โˆ’3x. fโ€ฒ(x)=3x2โˆ’3=0 gives the turning points a=โˆ’1 and a=1.

Optimisation

  • Connection: Write the quantity in one variable, set the derivative to 0, then confirm max or min.
  • Exam note: Check the end points of the domain too.
  • Exam note: Give the value of the quantity as well as the x where it occurs, if asked.

Back to topics

Integration

Standard integrals

โˆซxnโ€‰dx=xn+1n+1+C,nโ‰ โˆ’1
  • Connection: A boundary condition finds C.
  • Connection: Integration reverses differentiation: check by differentiating.
  • Exam note: Add +C to every indefinite integral.

Definite integrals

NameFormulaCondition
Definite integral
โˆซabf(x)โ€‰dx
the GDC gives the value

Back to topics

Areas and the Trapezoidal Rule

Areas

NameFormulaCondition
With the x-axis
A=โˆซabyโ€‰dx when y>0

Trapezoidal rule

NameFormulaCondition
Trapezoidal rule
โˆซabyโ€‰dxโ‰ˆ12h((y0+yn)+2(y1+y2+โ‹ฏ+ynโˆ’1))
h=bโˆ’an
  • Connection: More strips give a better estimate.
  • Exam note: n strips need n+1 values of y.
๐‘ฅ๐‘ฆ0.511.52๐‘ฆ=๐‘ฅ2+1
h=0.5: estimate 4.75, exact 143โ‰ˆ4.67.

Back to topics

Cover of the AI SL Revision Notes PDF, updated November 2026

Prefer a printable copy?

Receive the AI SL Revision Notes as a PDF, ready to print or keep offline. Free to share, unchanged.

19 pages ยท 5 topics ยท 26 sections

Unsubscribe anytime. Privacy policy

Need help applying these ideas?

These notes show the formulas and their conditions. One-to-one tutoring looks at your own work, finds what is limiting your grade, chooses the right practice, and gives feedback on your reasoning.

Related pages and updates

Scroll to Top