Index Ai Academy
Foundation · Transposition of formulas

Sequences and sums: find n, a, d and r

Every letter of the arithmetic and geometric formulas as the subject, and an average's window from its decay.

About 40 minutes · Free lesson

What it covers6

Why it matters

A sequence formula answers "what is the 10th term?" Planning asks the other way around. In which week does the walk reach 21 km? How many steps until a token budget runs out? What decay gives a 50-step average? Each is the same formula with a different letter as the subject, and n must come out a positive whole number.

What you'll be able to do

  • Make n, a or d the subject of an arithmetic term formula, and l or n the subject of its sum
  • Solve an arithmetic sum for n as a quadratic, keeping the positive whole root
  • Free n with logs and r with a root in a geometric sequence, and r from an infinite sum with |r| < 1
  • Check that n is a positive whole number, say what it means when it isn't, and confirm with a loop
  • Turn around an average's window, a discounted return, a step schedule and a growing batch's token budget
Quick check
Have a guess before you start. The trail club's training plan starts with a 3 km walk and adds 2 km each week. In which week is the walk 21 km?
  1. Week 11
  2. Week 10
  3. Week 9
  4. Week 7
Show the answer

Week 10

3 + (n − 1) × 2 = 21, so (n − 1) × 2 = 18, n − 1 = 9 and n = 10. Week 1 has no extra 2 km yet, so 9 steps of 2 km lead to week 10.

The math: peel the term, solve the sum

Purpose. Make any letter of a sequence formula the subject: the position n, the first term a, the step d or the ratio r.

From lesson 26: an arithmetic sequence starts at a and adds the same step d each time, so its nth term is a + (n − 1)d. Here that term gets a name, uₙ ("u sub n"), with a subscript for its position: uₙ = a + (n − 1)d. Some books write aₙ, and call d the common difference (and a geometric sequence's r the common ratio).

Read it as a machine on n: take 1 away, multiply by d, add a. To free n, undo those in reverse: take a away, divide by d, add 1. So n = (uₙ − a)/d + 1. The other letters take fewer moves: d = (uₙ − a)/(n − 1) and a = uₙ − (n − 1)d.

Conditions. d can't be 0, or every term is the same. When you solve for d, n can't be 1. And n counts terms, so it must be a positive whole number.

Quick check
From an earlier lesson: what is the 20th term of 3, 7, 11, 15, …?
  1. 80
  2. 79
  3. 76
  4. 83
Show the answer

79

a + (n − 1)d = 3 + 19 × 4 = 79. From term 1 to term 20 there are 19 steps of 4.

Watch the club's plan built from week n = 10 and then peeled back. Each rule has an opposite, run right to left.

Try it now

Change the week and press Use these numbers: the way back always lands on the week you started from.

Symbols and formula. The sum of the first n terms is Sₙ, and l (for "last") is the last term, uₙ. Why the formula holds: write the sum forwards, then backwards under it. Each column adds to a + l, since one row goes up by d as the other goes down by d. There are n columns, so twice the sum is n(a + l). It's the pairing trick behind 1 + 2 + … + n = n(n + 1)/2, and it works for odd n too:

Sn=n(a+l)2  ⇒  l=2Snn−a,n=2Sna+lS_n = \frac{n(a + l)}{2} \;\Rightarrow\; l = \frac{2S_n}{n} - a, \qquad n = \frac{2S_n}{a + l}

In plain words: the sum is the number of terms times the average of the first and last. To undo it, double the sum, then divide by n and take a away for l, or divide by a + l for n. Neither n nor a + l can be 0.

Named mistakes. Dividing by n instead of n − 1 when you find d: from term 1 to term n there are only n − 1 steps. Forgetting the + 1 when you find n. And dropping the 2 when you undo the halving in Sₙ.

Quick check
uₙ = a + (n − 1)d. Make d the subject.
  1. d = (uₙ + a)/(n − 1)
  2. d = (uₙ − a)/(n − 1)
  3. d = (uₙ − a)/n
  4. d = uₙ/(n − 1) − a
Show the answer

d = (uₙ − a)/(n − 1)

Take a away: uₙ − a = (n − 1)d. Divide by (n − 1): d = (uₙ − a)/(n − 1). Check with the club: (21 − 3)/9 = 2.

When n appears twice. Put l = a + (n − 1)d into Sₙ = n(a + l)/2 and you get the other sum formula, which uses d instead of the last term:

Sn=n2(2a+(n−1)d)  ⇒  d⋅n2+(2a−d) n−2Sn=0S_n = \frac{n}{2}\left(2a + (n - 1)d\right) \;\Rightarrow\; d \cdot n^2 + (2a - d)\,n - 2S_n = 0

a and d come out with the usual moves: a = Sₙ/n − (n − 1)d/2 and d = 2(Sₙ/n − a)/(n − 1). But n sits both outside and inside the bracket, so peeling can't free it. Multiplied out, it's a quadratic in n, as in lesson 34. The club wants 120 km in total, walking 3 km and adding 2 km a week. So 2n² + 4n − 240 = 0, or n² + 2n − 120 = 0. When d and Sₙ are above 0, one root is negative and one is positive.

Geometric sequences. uₙ = a·rⁿ⁻¹ multiplies by r each step. n sits in a power, so it needs logs (lesson 35). r sits in the base, so it needs a root:

n=log⁡(un/a)log⁡r+1,r=(una)1/(n−1)n = \frac{\log(u_n / a)}{\log r} + 1, \qquad r = \left(\frac{u_n}{a}\right)^{1/(n - 1)}

In plain words: divide by a, ask "r to what power?", then add 1. For r, take the (n − 1)th root of uₙ ÷ a.

Conditions. uₙ/a must be above 0 for the log, and r must be above 0 and not 1. For r, n can't be 1. When n − 1 is even, −r works too: r⁴ = 81 gives r = 3 or −3.

When n isn't whole. The club's newsletter has 40 readers in month 1 and 1.5 times as many each month. When does it reach 1,000? n = log 25 ÷ log 1.5 + 1 ≈ 8.94. Month 8 has 40 × 1.5⁷ ≈ 683 readers and month 9 has 40 × 1.5⁸ ≈ 1,025. So 1,000 falls between two terms, and the answer is month 9, the first at or above it.

Quick check
A geometric sequence starts at 2, and its 5th term is 162. Which values of r work?
  1. 4
  2. 3 only
  3. 20.25
  4. 3 or −3
Show the answer

3 or −3

2r⁴ = 162, so r⁴ = 81. Both 3⁴ and (−3)⁴ are 81. With r = −3 the terms are 2, −6, 18, −54, 162.

In your own words
Why does n in uₙ = a + (n − 1)d need only peeling, but n in Sₙ = n/2·(2a + (n − 1)d) needs the quadratic formula?

Write a sentence or two, then compare it with a good answer in the lesson.

In Python: solve, then build the sequence to check

Purpose. A rearranged formula can be checked by brute force: build the sequence with a loop and see where the target lands.

import math

def n_arith(u, a, d):
    return (u - a) / d + 1

def term(a, d, n):
    return a + (n - 1) * d

n = n_arith(21, 3, 2)
print(n, term(3, 2, n))
print(n_arith(50, 3, 2), term(3, 2, 24), term(3, 2, 25))
m = math.log(1000 / 40) / math.log(1.5) + 1
print(round(m, 2), round(40 * 1.5 ** 7), round(40 * 1.5 ** 8))
It runs right here in your browser, with nothing to install.

The first line is a round trip: week 10 gives back 21. The second asks whether 50 is a term of 3, 5, 7, … It isn't: n = 24.5. 50 falls between term 24, which is 49, and term 25, which is 51. The third checks the newsletter.

Testing for whole. n == round(n) is true for 10.0 and false for 24.5. When n comes from logs, allow for tiny rounding errors: abs(n - round(n)) < 1e-9.

Worked example

Worked example: weeks to reach a sign-up total

In the club's sign-up drive, 5 people join in week 1, and each week twice as many join as the week before. A geometric sum adds them: Sₙ = a + ar + … + arⁿ⁻¹. Multiply every term by r and the list shifts one place: rSₙ = ar + ar² + … + arⁿ. Take that from Sₙ and all but two terms cancel: Sₙ − rSₙ = a − arⁿ. So Sₙ(1 − r) = a(1 − rⁿ), and Sₙ = a(1 − rⁿ)/(1 − r), for r not 1.

To free n, multiply by (1 − r) and divide by a: 1 − rⁿ = Sₙ(1 − r)/a. Then rⁿ = 1 − Sₙ(1 − r)/a, and logs free n. For a, divide instead: a = Sₙ(1 − r)/(1 − rⁿ).

import math

def n_geo_sum(s, a, r):
    inside = 1 - s * (1 - r) / a
    if r <= 0 or r == 1 or inside <= 0:
        return None
    return math.log(inside) / math.log(r)

def a_geo_sum(s, r, n):
    return s * (1 - r) / (1 - r ** n)

n = n_geo_sum(600, 5, 2)
print(round(n, 4), math.ceil(n), round(a_geo_sum(1000, 2, 6), 2))

totals = []
total = 0
for week in range(1, 9):
    total = total + 5 * 2 ** (week - 1)
    totals.append(total)
print(totals)
In the lesson you can change this and run it.

n ≈ 6.92, so the drive passes 600 during week 7. The loop agrees: after week 6 the total is 315, and after week 7 it's 635. The condition guards the log: the number inside must be above 0, and r must be above 0 and not 1. With r = 1 every week adds a, so Sₙ = na and n = Sₙ/a, no logs needed. For a total of 1,000 in 6 weeks, a ≈ 15.87: 16 people must join in week 1, since 15 falls short.

Quick check
What does this print?
def n_arith(u, a, d):
    return (u - a) / d + 1

n1 = n_arith(40, 4, 3)
n2 = n_arith(41, 4, 3)
print(n1, n1 == round(n1), round(n2, 2), n2 == round(n2))
  1. 13 True 13.33 False
  2. 12.0 True 12.33 False
  3. 13.0 True 13.33 False
  4. 13.0 True 13.33 True
Show the answer

13.0 True 13.33 False

(40 − 4)/3 + 1 = 13.0, a whole number, so 40 is term 13. (41 − 4)/3 + 1 ≈ 13.33, not whole, so 41 isn't a term of 4, 7, 10, …

Quick check
For which of these does n = log(uₙ/a)/log r + 1 have no answer?
  1. a = 5, r = 2, uₙ = 40
  2. a = −5, r = 2, uₙ = −40
  3. a = 5, r = 0.5, uₙ = 0.625
  4. a = 5, r = 2, uₙ = −40
Show the answer

a = 5, r = 2, uₙ = −40

−40/5 = −8, and logs exist only for numbers above 0. A sequence that starts at 5 with r = 2 stays positive, so it never reaches −40.

Drill

Fix the arithmetic solvers

Each function has one slip from this lesson's named mistakes. Fix n_arith, d_arith and l_from_sum.

def n_arith(u, a, d):
    return (u - a) / d

def d_arith(u, a, n):
    return (u - a) / n

def l_from_sum(s, a, n):
    return s / n - a

print(n_arith(21, 3, 2), d_arith(28, 4, 9), l_from_sum(150, 5, 12))
In the lesson, your code is checked as you write it.
In your own words
Why is building the sequence with a loop a good check on a rearranged formula?

Write a sentence or two, then compare it with a good answer in the lesson.

In AI and ML: windows, horizons, schedules and budgets

Purpose. Four planning questions in training are sequence formulas turned around.

An infinite sum. In the geometric sum a(1 − rⁿ)/(1 − r), when r is between −1 and 1, rⁿ shrinks toward 0 as n grows (0.5¹⁰ is under 0.001). So adding forever gives a finite total, S∞ = a/(1 − r). Turned around, r = 1 − a/S∞. Check |r| < 1 afterward: it holds only when S∞ has the same sign as a and is more than half its size.

Moving averages. An exponential moving average (EMA) updates v = βv + (1 − β)x at every step. Optimizers like Adam use one to smooth their gradients. Next to the newest step, the steps before it count β, β², β³, … times as much, and adding them is S∞ with a = 1 and r = β: 1 + β + β² + … = 1/(1 − β). That total is the effective window, N = 1/(1 − β): roughly how many recent steps the average leans on. So β = 1 − 1/N.

A discounted return. In reinforcement learning, a steady reward r per step (here r is the reward; the ratio is γ), discounted by γ each step, is worth G = r + γr + γ²r + … = r/(1 − γ). So γ = 1 − r/G, for G not 0.

Counting decays. A step schedule, like PyTorch's StepLR, multiplies the learning rate by a factor (also called γ) every few epochs. After m decays, lr = lr₀·γᵐ, so m = log(lr/lr₀)/log γ, rounded up. Round away float dust first.

A token budget. Some large runs start with small batches and grow them. GPT-3 ramped its batch linearly from 32,000 tokens up to full size over its first 4 to 12 billion tokens. Here is a simplified model with invented, much smaller numbers: step 1 takes a tokens, and each step's batch is d tokens bigger than the last. The tokens after n steps are then an arithmetic sum, and n is its quadratic's positive root, rounded up. GPT-3's ramp wasn't set as a fixed number of tokens per step; the model keeps only the idea.

import math

def gamma_for(reward, total):
    return 1 - reward / total

def decays_needed(lr, lr0, gamma):
    m = math.log(lr / lr0) / math.log(gamma)
    return math.ceil(round(m, 9))

def steps_for_tokens(budget, a, d):
    b = 2 * a - d
    n = (-b + math.sqrt(b ** 2 + 8 * d * budget)) / (2 * d)
    return math.ceil(round(n, 9))

print(gamma_for(1, 100))
print(math.log(0.0729 / 0.1) / math.log(0.9), decays_needed(0.0729, 0.1, 0.9))
print(steps_for_tokens(5000000, 32000, 1000))

total = 0
for step in range(1, 75):
    total = total + 32000 + (step - 1) * 1000
    if step >= 73:
        print(step, total)

A reward of 1 per step worth 100 in total needs γ = 0.99. Going from 0.1 to 0.0729 with γ = 0.9 gives m a speck above 3, which math.ceil alone would turn into 4; rounded first, it's 3 decays. And a 5,000,000-token budget takes 74 steps: the loop shows 73 steps fall short.

Quick check
You want an EMA that leans on about the last 20 steps. Which β?
  1. 0.98
  2. 0.05
  3. 0.95
  4. 0.8
Show the answer

0.95

β = 1 − 1/N = 1 − 1/20 = 0.95. Check: 1/(1 − 0.95) = 20.

Quick check
What does this print?
def r_from_sum(a, s_inf):
    return 1 - a / s_inf

print(r_from_sum(6, 10), r_from_sum(6, 2), r_from_sum(1, 4))
  1. 0.6 3.0 0.25
  2. 0.4 -2.0 -3.0
  3. 0.4 2.0 0.75
  4. 0.4 -2.0 0.75
Show the answer

0.4 -2.0 0.75

1 − 6/10 = 0.4, 1 − 6/2 = −2.0 and 1 − 1/4 = 0.75. The −2.0 fails |r| < 1: no geometric series starting at 6 adds up to 2, so that answer must be rejected.

Drill

Plan the run

Fix beta_for_window(n), which should give β = 1 − 1/N, and steps_for_tokens(budget, a, d), which should give the first whole step at which the growing batches have used the budget.

import math

def beta_for_window(n):
    return 1 / n

def steps_for_tokens(budget, a, d):
    b = 2 * a - d
    n = (-b - math.sqrt(b ** 2 + 8 * d * budget)) / (2 * d)
    return round(n)

print(beta_for_window(20), steps_for_tokens(5000000, 32000, 1000))
In the lesson, your code is checked as you write it.
In your own words
Why must r = 1 − a/S∞ be checked for |r| < 1, and what does a failed check mean?

Write a sentence or two, then compare it with a good answer in the lesson.

Goes deeper in

Practice what you just read

  • 3 code examples you can edit and run
  • a practice exercise that checks your code
  • a 5-question quiz
  • 9 review cards for spaced repetition

Try a quiz question

Make n the subject of Sₙ = n(a + l)/2.

  1. n = 2Sₙ/(a + l)
  2. n = Sₙ/(2(a + l))
  3. n = 2Sₙ − a − l
  4. n = 2Sₙ/a + l

Answer it at the end of the lesson to see if you're right, and why.

Before this lesson

Keep learning

Where this lesson leads.

575 lessons in thirteen phases. 176 are free without an account, and a free account opens the rest. See every lesson.

Foundation · about 96 hours of study

Foundation math

From whole numbers to the math inside a neural network: each idea by hand, in Python, and in AI 118 lessons All free
  1. Numbers and place value FreeWhat a digit's place is worth, the number line, and Python as a calculator that never tires.36 min
  2. Multiplying and dividing: groups FreeEqual groups, quotient and remainder, and cutting training data into batches.35 min
  3. Order of operations, and names for numbers FreeBrackets, powers, then multiply and divide, then add and subtract; variables hold numbers.36 min
  4. Numbers below zero FreeThe number line through zero, sign rules, distance from zero, and an error's direction and size.37 min
  5. Fractions: equal parts, equal fractions, adding FreePieces of a whole, equal fractions, and re-cutting to add; accuracy as a fraction.45 min
  6. Multiplying and dividing fractions FreeA share of a share, dividing by flipping, and why chances in a row get small.35 min
  7. Decimals and rounding FreeFractions in place value, rounding, and why 0.1 + 0.2 isn't exactly 0.3.36 min
  8. Percentages FreePer hundred, percent change, percentage points, and the accuracy and error rates of models.35 min
  9. Ratios, rates and proportion FreeSharing in a ratio, rates per unit, scaling, and splitting data 80/10/10.35 min
  10. Powers and roots FreeRepeated multiplying, the laws of exponents, square roots, and squared error.43 min
  11. Very big and very small numbers FreePowers of ten, e-notation like 3e-4, orders of magnitude, and a model's size in memory.36 min
  12. Bits, bytes and floats: how numbers are stored FreeBase 2, what n bits can hold, a float as sign, power and digits, and a tensor's memory.35 min
  13. Review: find the slip (numbers) FreeBroken calculations to fix, mixed practice from the whole module, and its formula sheet.34 min
  14. Letters for numbers FreeVariables, terms and like terms, substitution, and a model's formula as a Python function.41 min
  15. Expanding and factoring FreeBrackets as areas, pulling out common factors, and a squared error expanded into a bowl.41 min
  16. Solving equations: keep the balance FreeThe same move on both sides, undoing steps in reverse, and running a model's formula backward.41 min
  17. Rearranging a formula FreeMaking any letter the subject, round-trip checks, and planning a training run.36 min
  18. Inequalities and true-or-false FreeRanges, flipping the sign, if and elif, and the thresholds, clips and ReLU inside a model.42 min
  19. Functions: a rule from input to output Freef(x) notation, tables and graphs, domain and range, loops over lists, and loss as a function.42 min
  20. Chaining and undoing functions Freeg(f(x)), inverses that undo, scaling and unscaling, and a network as a chain.42 min
  21. Straight lines: slope and intercept FreeRise over run, the line through two points, and a model's weight and bias as slope and intercept.42 min
  22. Two equations, two unknowns FreeSubstitution and elimination, where lines cross, and why models are fitted, not solved.42 min
  23. Quadratics: bowls and their lowest point FreeRoots by factoring and by formula, the discriminant, the vertex, and the best weight of a model.42 min
  24. Exponentials: growth and decay FreeThe same factor each step, the number e, and decaying learning rates.43 min
  25. Logarithms: the power question FreeTo what power?, the laws of logs, and adding log-probabilities instead of multiplying.45 min
  26. Sequences and Σ FreeArithmetic and geometric sequences, Σ as a loop that adds, and mean squared error.40 min
  27. Weighted and moving averages FreeWeights that add to 1, a window average, the exponential moving average, and smoothing a loss curve.35 min
  28. Sets, and reading the symbols FreeSets, union and intersection, ℝⁿ and f : ℝⁿ → ℝᵐ, and reading a paper's first equation.41 min
  29. Review: find the slip (algebra) FreeBroken algebra and code to fix, mixed practice from the whole module, and its formula sheet.34 min
  30. Transposing step by step: undo in reverse order FreeA formula's layers, the opposite of each, peeling from the outside in, conditions, and round-trip checks.35 min
  31. Formulas with fractions: clear them first FreeClearing denominators, cross-multiplying, a letter in the bottom, and reciprocal formulas like 1/R = 1/R₁ + 1/R₂.35 min
  32. When the letter appears twice: collect and factor FreeGathering the letter on one side, factoring it out, dividing by the bracket, and rearranging precision and F1.35 min
  33. Squares, roots and powers FreeSquare roots with ±, squaring to undo a root, cube and nth roots, and the √d inside attention.40 min
  34. When the letter is squared and plain: quadratics FreeRearranging into ax² + bx + c = 0, the formula, completing the square, and choosing the root that fits.35 min
  35. Letters in the power: exponentials and logarithms FreeTaking logs to bring a power down, exponentiating to free a letter, and the logit that undoes the sigmoid.40 min
  36. Rearranging inequalities: when the sign flips FreeThe four moves on an inequality, negatives and reciprocals that flip it, logs below 1, and sample sizes.35 min
  37. Inverse functions, lines and scaling FreeUndoing a function by making x the subject, domains that allow it, line forms, and unscaling predictions.40 min
  38. Sequences and sums: find n, a, d and r FreeEvery letter of the arithmetic and geometric formulas as the subject, and an average's window from its decay.40 min
  39. Combining formulas: substitute and eliminate FreePutting one formula inside another to remove a letter, and sizing a training run from a time or money budget.35 min
  40. Review: rearrange anything (algebra) FreeBroken rearrangements to fix, mixed practice from the whole algebra block, a strategy chart, and its formula sheet.35 min
  41. Coordinates and distance FreePoints as (x, y), Pythagoras, distance in any number of coordinates, and nearest neighbors.42 min
  42. Angles, degrees and radians FreeMeasuring a turn, converting units, arcs, and the angle between two arrows.36 min
  43. Sine and cosine FreeAcross and up: right triangles, the unit circle, and directions and rotations.42 min
  44. Waves: height, speed and shift FreeAmplitude, period and phase, sampling a wave, and position codes in transformers.37 min
  45. Review: find the slip (shapes and waves) FreeBroken geometry and code to fix, mixed practice from the module, and its formula sheet.29 min
  46. Angles, triangles and waves: rearranging with sin, cos and tan FreeSides and angles from SOH CAH TOA, principal values, arcs, polar coordinates, and a wave's time and period.45 min
  47. Vectors: lists of numbers that point FreeA list, a point and an arrow; components, dimension, NumPy arrays, and data as vectors.42 min
  48. Adding and scaling vectors FreeComponent-wise sums, scalar multiples, mixes, and the weight update w − ηg.43 min
  49. Length and distance: norms FreeL2, L1 and max norms, unit vectors, distance, and the norms inside losses and clipping.42 min
  50. The dot product FreeMultiply in pairs and add; a·a as squared length; a @ b; one neuron as a dot product.43 min
  51. Angle, cosine similarity and projection FreeDirection without length, perpendicular vectors, shadows, and search by meaning.45 min
  52. Perpendicular directions: bases and coordinates FreeOrthonormal directions, coordinates as dot products, rebuilding a vector, and taking a direction out.35 min
  53. Matrices: tables of numbers FreeRows, columns and entries; two-dimensional arrays and slices; a data set as a matrix.41 min
  54. Adding, scaling and transposing matrices FreeEntry-by-entry sums and scalings, the transpose, mean images, and tables turned around.36 min
  55. A matrix times a vector FreeEach row dotted with the vector, the size rule, A @ x, and a layer acting on one example.42 min
  56. Matrix multiplication FreeRow meets column, the size rule, order matters, and a batch through a layer: X W + b.45 min
  57. Identity, diagonal, triangular and symmetric FreeFour patterns and their jobs: rescaling, distance tables, and the causal mask.37 min
  58. Matrices as movements of space FreeStretches, flips, shears and rotations; columns as landing spots; chaining; a layer moving data.42 min
  59. Determinant and inverse FreeThe area factor ad − bc, singular matrices, undoing a matrix, and redundant features.42 min
  60. Solving systems by elimination FreeAugmented matrices, row moves, back-substitution, the three outcomes, and fitting weights.45 min
  61. Independence, span and rank FreeRedundant vectors, span, rank, outer products, and low-rank updates like LoRA.42 min
  62. Eigenvectors: directions that only stretch FreeAv = λv, checking candidates, np.linalg.eig, and the main direction of a data cloud.41 min
  63. SVD and PCA: the important directions first FreeA matrix as pieces by size, the best rank-k copy, compression, and PCA maps of data.45 min
  64. Tensors, shapes and broadcasting FreeAxes and shapes, reshape, axis=, broadcasting, and shapes through a small model.43 min
  65. One-hot vectors and lookup tables: embeddings FreeA one-hot row picks a table's row, a sentence looked up as vectors, and a score for every word.35 min
  66. Sliding dot products: convolution FreeA small pattern slid along a list and over a grid, output sizes, stride and padding, and shared weights.40 min
  67. Review: find the slip (vectors and matrices) FreeShape slips to fix, mixed practice from the module, and its formula sheet with shapes.36 min
  68. Vector equations: rearranging with arrows FreeSolving for a vector or a scale, recovering a gradient from two weight snapshots, and an angle from a dot product.40 min
  69. Matrix equations: multiply by the inverse, on the correct side FreeNo dividing by a matrix: inverses from the left or right, order, transposes, and the normal equations.40 min
  70. Rates of change FreeChange over change, secants, rates from readings with np.diff, and reading a loss curve.41 min
  71. Limits: what a value heads toward FreeApproaching from both sides, holes, corners and jumps, epsilon, and judging activations.37 min
  72. The derivative: slope at a point FreeShrinking secants, f′(x) and dy/dx, Δy ≈ f′Δx, and which way a weight should move.45 min
  73. Derivative rules FreeConstants, powers, multiples, sums, eˣ and ln x, checked numerically, and a squared error's slope.41 min
  74. The product rule and the chain rule FreeProducts and chains of functions, forward then backward, and one neuron's dL/dw.45 min
  75. Lowest points and curvature Freef′ = 0, the second-derivative test, tables, local and global minima, and convex losses.43 min
  76. Standing in for a curve near a point FreeTangent lines, a curvature term, growing error, and why learning rates must be small.37 min
  77. Partial derivatives FreeOne input at a time, ∂, nudging in Python, and the two slopes of a line's loss.41 min
  78. The gradient FreeAll the slopes as a vector, steepest climb and descent, a numerical gradient, and the loss gradient.42 min
  79. Gradient descent FreeStepping against the gradient, the learning rate, a training loop, and fitting a line.45 min
  80. Faster descent: momentum and Adam FreeMomentum and Adam by hand, the bias correction, and three optimizers down one narrow valley.40 min
  81. The chain rule with many paths: backpropagation by hand FreeGraphs, multiply along paths and add across them, gradient checks, and a 2-2-1 network by hand.45 min
  82. Automatic differentiation: how PyTorch finds every slope FreeA tape of steps walked backward, and requires_grad, backward(), .grad, zero_grad() and no_grad().40 min
  83. Jacobians and Hessians FreeSlopes of vector functions, a layer's Jacobian, second partials, and bowls, domes and saddles.42 min
  84. Integrals: adding up thin slices FreeStrip and trapezoid sums, summing undoes differencing, probability as area, and AUC.43 min
  85. Review: find the slip (calculus) FreeCalculus slips to fix, mixed practice from the module, and its formula sheet.36 min
  86. Rearranging in calculus: slopes, steps and constants FreeSetting a slope to zero, Newton's step, the chain rule turned around, constants from a point, and learning rates.45 min
  87. Counting: choices, orders and groups FreeThe counting principle, factorials, ordered picks and groups, and why attention's cost grows with the square of the length.43 min
  88. Probability: from counts to chances FreeEqually likely outcomes, the complement, distributions, seeded simulation, and a next-word model.43 min
  89. Combining events: and, or, independent FreeThe or rule, independence, probability trees, drawing with and without replacement, and chains of steps.42 min
  90. Conditional probability and Bayes' rule FreeConditionals from tables, why P(A | B) isn't P(B | A), Bayes' rule, and precision and recall.45 min
  91. Random variables and distributions FreeUncertain numbers, the probability of a range, sampling by slices, and sampling versus argmax.42 min
  92. Expected value, variance and standard deviation FreeProbability-weighted averages, spread in the data's own units, and a training loss as an expected value.42 min
  93. Bernoulli, binomial, uniform and normal FreeYes-or-no trials, counts of yeses, the 68-95-99.7 rule, z-scores, and an accuracy's error bar.45 min
  94. Two variables at once: covariance and correlation FreeJoint tables and marginals, covariance, correlation, the covariance matrix, and features that carry the same information.45 min
  95. Review: find the slip (probability) FreeProbability slips to fix, mixed practice from the module, and its formula sheet.36 min
  96. Probability formulas: solve for the missing chance FreeConditionals, Bayes' rule for the prior, the or rule, expected values, variance, and z-scores turned around.45 min
  97. Describing data: center, spread and scale FreeMean, median and mode, variance and standard deviation, percentiles, outliers, and standardizing features.42 min
  98. Samples, the law of large numbers and the central limit theorem FreeSamples and populations, the standard error σ/√n, the bell of averages, and error bars on test scores.43 min
  99. Is the difference real? Comparing two models FreePaired differences, a bootstrap interval, what a p-value is and isn't, and why many tries make lucky wins.40 min
  100. Maximum likelihood FreeLikelihoods as products, log-likelihoods as sums, grid search, underflow, and the negative log-likelihood loss.45 min
  101. Linear regression: the best line FreeResiduals, least squares by formula, three roads to one line, the matrix form, and train versus test error.45 min
  102. Logistic regression: a line that answers yes or no FreeThe sigmoid, the log loss, its slope p − y, a training loop, and choosing a threshold.45 min
  103. Scoring a classifier: confusion table, precision, recall, F1 FreeThe four cells, accuracy, precision, recall and F1, and what moving a threshold does to each.35 min
  104. Softmax: scores into probabilities FreeExponentiate and share out, shifting and temperature, the safe softmax, and a classifier's last step.43 min
  105. Surprise, entropy and cross-entropy FreeSurprise in bits, entropy, cross-entropy and KL divergence, perplexity, and a language model's loss.45 min
  106. KL divergence: how far one distribution is from another FreeKL by hand, cross-entropy as entropy plus KL, why it isn't symmetric, and a soft-target loss.35 min
  107. Review: find the slip (statistics and information) FreeStatistics slips to fix, mixed practice from the module, and its formula sheet.38 min
  108. Statistics and information: n, z, logits and bits FreeSample sizes from error bars, inputs from probabilities, logit gaps from softmax, and chances from bits and losses.40 min
  109. One neuron, start to finish FreeWeighted sum, activation, loss, slopes and update, by hand and in code, and what one straight line can and can't split.45 min
  110. A layer and a small network as matrices FreeTwo layers on a batch, the shape of every matrix, adding a hidden unit, and XOR solved.45 min
  111. Training a small network FreeThe backward pass in matrix form, gradient checks, a full training loop, and reading loss curves.45 min
  112. The same network in PyTorch Freenn.Sequential with the NumPy weights loaded, the same loss and slopes, then SGD and mini-batches.45 min
  113. Attention as matrix math FreeScaled dot-product scores, the causal mask, a row-by-row softmax, and blending value vectors.45 min
  114. Residual connections and layer norm FreeAdding the input back and why its slope keeps learning alive, layer norm by hand, and add and norm.40 min
  115. A transformer block, start to finish FreeA sentence through embeddings, attention, add and norm, a small network and next-word scores, every shape named.45 min
  116. Planning a model: rearranging the formulas of a working network FreeLayer widths from parameter counts, sizes from memory and compute, the attention scale, and a training plan.40 min
  117. Final test: transpose any formula FreeSlips to fix from every topic, mixed practice of every kind of rearranging, the strategy chart and the full sheet.45 min
  118. Capstone: a sign reader from the formulas FreeBuild, train and test a trail-sign classifier with NumPy alone, and report its accuracy with an error bar.45 min
Part of a free course 118 lessons

The Foundation Math For Ai & ML: from arithmetic to attention

Learn the math behind AI from arithmetic up: numbers, algebra, vectors and matrices, calculus, probability and statistics, each shown as numbers moving and checked in Python, ending with a network you build and train from the formulas.

Part of a free course 19 lessons

Transposition of Formulas: algebraic manipulation in every topic

Learn to make any letter of any formula the subject: layers undone in reverse order, fractions, a letter that appears twice, powers, roots, quadratics, logs, inequalities, trigonometry, vectors, matrices, calculus, probability, statistics and the formulas inside AI models, each checked in Python.

Never trained an AI? Teach a small one to write, right in your browser. It takes about 20 seconds and needs no account. Teach it to write