IB Math IA ideas: number and algebra

Number and algebra ideas are the purest on this list: number theory, sequences, proof, cryptography, graphs and finance. Most need no data at all, so the marks depend on whether you prove something yourself rather than describe a famous result.

By Pietro Meloni, PhD · Updated on

28 of 28 ideas

Criteria referred to in each idea: A Presentation, B Mathematical communication, C Personal engagement, D Reflection, E Use of mathematics. What each criterion rewards.

Topic 1, number and algebra: 28 ideas

Building and breaking a small RSA system

Aim. How does the difficulty of factorising the modulus grow with its size, and at what modulus size does a brute-force factoring attack stop being feasible on a school laptop?

  • AA and AI · SL and HL
  • Easy to start
  • Simulation
  • Common: on 2 sites

My take. Very common topic, so it only works with your own experiment on factoring times and a discussion of a bad choice such as p and q close together. Otherwise choose something else.

Mathematics, first steps and where marks are lost+
Mathematics
Prime factorisation, modular arithmetic and congruences, Euler's totient φ(pq)=(p−1)(q−1), extended Euclidean algorithm for the private exponent, fast modular exponentiation by repeated squaring. Beyond syllabus: Fermat's little theorem as the proof that decryption returns the message.
How to start
Choose p=61, q=53, e=17, compute n, φ(n) and d, then encrypt and decrypt a short number by hand. Next write a trial-division factoriser and time it on moduli of 10, 20, 30 digits.
SL and HL
An SL student can carry out the worked example and the timing study. HL depth comes from proving why decryption works with Fermat or Euler, and from analysing how trial division cost scales with √(n).
Where marks are lost
E: a worked example alone is a demonstration, not exploration. C: RSA is very common, so a generic account feels copied. D: little evaluation of the model's limits, such as key size and weak prime choices.
Data
Easy to run with a short script, but the timing data need repeated trials to be credible.

Hanoi with four pegs: how much time does a spare peg save?

Aim. How many moves does an optimal transfer of a tower of n discs need with three pegs, and by how much does a fourth peg reduce that count as n grows?

  • AA and AI · SL and HL
  • Easy to start
  • Simulation
  • Common: on 2 sites

My take. The three-peg version alone is overdone and thin, but the four-peg comparison gives it a real question and room for computation. Worth choosing if you write the search program yourself; otherwise it reads as a textbook exercise.

Mathematics, first steps and where marks are lost+
Mathematics
Recurrence relations T(n) = 2T(n-1) + 1 with T(1) = 1; solving by iteration and by adding 1 to both sides to get a geometric sequence; closed form 2n - 1 and geometric series sums. Four pegs: splitting the tower into a top group of k discs and the rest, giving F(n) = min over k of [2F(k) + 2n-k - 1]; triangular numbers to explain why the best k follows a pattern. HL extension: proof by induction of the three-peg formula, and comparing growth rates using limits or logarithms. Beyond syllabus: the Frame-Stewart strategy, proved optimal for four pegs only in 2014 and still unproved for five or more.
How to start
Build a physical or online puzzle with 1 to 5 discs and record the shortest solution by hand. Then write a short program or spreadsheet that computes the shortest solution by breadth-first search for three pegs up to about 8 discs and four pegs up to about 10 discs. Compare the counts with the recurrence predictions before doing any algebra.
SL and HL
SL: derive and solve the three-peg recurrence, verify against small cases, and tabulate the four-peg strategy with a clear explanation of the split. HL: add a full induction proof, derive how fast the four-peg count grows (the exponent grows roughly like √(2n)) with justification, and check the strategy against your own exhaustive search for small n.
Where marks are lost
A and B: a page of move lists with no structure, and unexplained notation for the recurrence. C: retelling the legend without any personal angle. D: stating the four-peg values without saying how you know they are minimal. E: stopping at 2n - 1, which is a textbook exercise.
Data
Data comes from a computed search or hand play and is easy to generate. The optimality proof for four pegs exists but is far beyond the course, so quote it and check it computationally for small n instead of attempting it.

Routing a postal round through awkward streets

Aim. How much extra distance must a postman walk to cover every street of a real neighbourhood, and how does the number of odd-degree junctions determine that extra cost?

  • AI · HL topic
  • Needs care
  • Public data
  • Common: on 2 sites

My take. A good personal choice because you can use your own streets. Keep the network to about 8 vertices, or the by-hand pairing becomes a slog.

Mathematics, first steps and where marks are lost+
Mathematics
Graphs, degrees of vertices, Eulerian circuits and trails, weighted graphs, the Chinese postman algorithm: pairing odd vertices by minimum total weight, with shortest paths between them found by inspection. Beyond syllabus: Dijkstra's algorithm for the shortest paths, a proof of the handshake lemma and why the pairing method is optimal.
How to start
Take a map of the streets in your own area, mark junctions as vertices with lengths as weights, count odd-degree vertices and list all pairings of them with their path lengths.
SL and HL
This is AI HL content, since graph theory is not in the SL course. HL depth: compare your optimal route with a greedy hand-planned one, count how the number of pairings grows with the number of odd vertices, and test what happens when one street is closed.
Where marks are lost
E: shortest paths between odd vertices guessed rather than justified. B: graph diagrams cluttered and vertices unlabelled. A: too many pairing tables in the main text.
Data
Street lengths come from an online map and take time to collect, and the network must be kept small enough to check by hand.

The order of a perfect shuffle for decks of any size

Aim. For a deck of 2m cards, after how many perfect out-shuffles does the deck first return to its starting order, and can this number be predicted from m alone?

  • AA and AI · SL and HL
  • Easy to start
  • Simulation
  • Common: on 2 sites

My take. A sound, well-defined choice where the mathematics genuinely does the work, though the topic appears on a couple of other sites so it needs your own twist. Make it personal by linking it to a card trick you can actually perform, and merge the second, randomness-focused angle only if you can keep the maths controlled.

Mathematics, first steps and where marks are lost+
Mathematics
Permutations written in cycle notation; the out-shuffle as the position map x → 2x (mod 2m−1) on positions 0 to 2m−1; modular arithmetic and powers of 2 modulo n; the order of a permutation as the lowest common multiple of its cycle lengths; the multiplicative order of 2 modulo 2m−1. Beyond the syllabus, and reachable: Euler's theorem to bound the answer by φ(2m−1), and a comparison with the in-shuffle, which behaves like 2x modulo 2m+1.
How to start
Write a spreadsheet or short Python loop that applies one out-shuffle to a list of 52 numbered cards and repeats until the list matches the start. Record the count for every even deck size from 2 to 60, then write out the cycles for 8 and 10 cards by hand to see why the counts differ.
SL and HL
An SL student can tabulate counts for small decks, describe the position rule and explain the pattern using modular arithmetic and lowest common multiples. HL depth or top-band sophistication comes from proving that the return count equals the multiplicative order of 2 modulo 2m−1, explaining why 52 cards need 8 shuffles, and characterising the decks where the count is as large as possible or unusually small. Using the in-shuffle as a contrast adds a second model to compare.
Where marks are lost
E: stopping at a table of counts with no proof of why the modular rule works. B: cycle notation and the position indexing (starting at 0 or 1) not defined clearly, so formulas look inconsistent. C: no personal angle, for example a card trick or magic performance to motivate it. D: little reflection on the limits, since real shuffles are imperfect. A: long tables for many deck sizes left unedited.
Data
Pure theory plus easy computation, since a short loop generates every result and the proofs stay at elementary number theory level.

Area of the polygon formed by the nth roots of unity

Aim. What is the exact area of the polygon with vertices at the nth roots of unity, how does it approach π as n grows, and how does the product of the diagonals from one vertex behave?

  • AA · HL topic
  • Easy to start
  • Pure maths, no data
  • Rarely listed

My take. Neat and safe, but the area part alone is a textbook exercise. Adding the chord product proof and a comparison with Archimedes' polygon method for π gives it substance.

Mathematics, first steps and where marks are lost+
Mathematics
Roots of unity, polar form, area of a triangle as ½ab sin C, sum of n triangles giving (n/2) sin(2π/n), limit using Maclaurin series, and the product of chord lengths from one vertex equal to n via factorising zn − 1. Sum of the roots equal to zero.
How to start
Compute the area for n = 3 to 12 by hand and with a spreadsheet, then derive the general formula and compare with π.
SL and HL
Complex numbers in this form are HL only in AA. Depth comes from the chord product result and the error bound as n increases.
Where marks are lost
E: only the trigonometry area formula is used and the complex link is missing. B: gaps in the polynomial factorisation. C: the result stays impersonal.
Data
Pure theory with tidy closed forms that can be checked numerically.

Bounding the best delivery round for local addresses

Aim. How close to the true shortest round trip are the bounds given by nearest-neighbour and deleted-vertex methods for eight to ten real addresses?

  • AI · HL topic
  • Easy to start
  • Public data
  • Seen too often in subject reports
  • Rarely listed

My take. A solid discrete maths choice with clear answers, but a tour of universities or local sights is named in the subject reports as a template seen too often. It is stronger when the gap between the bounds is tested on several address sets, and when the addresses are ones you actually visit.

Mathematics, first steps and where marks are lost+
Mathematics
Complete weighted graphs, Hamiltonian cycles, nearest-neighbour upper bound, minimum spanning tree by Kruskal or Prim, deleted-vertex lower bound, exhaustive check of all tours for small cases. Beyond syllabus: the triangle inequality and the factor of two guarantee from a spanning tree.
How to start
Choose eight addresses, for example a paper round, and build the distance table from a map. Find a nearest-neighbour tour, then a lower bound by deleting one vertex and adding two edges to the spanning tree.
SL and HL
Graph theory and the travelling salesman bounds are AI HL content. HL: bounds for one set of addresses, several deleted vertices to tighten the lower bound, the triangle inequality argument, and how the gap between the bounds changes with the number of addresses. An SL student would be working outside the course and should pick another idea.
Where marks are lost
E: bounds found but never justified. B: terms such as Hamiltonian and spanning used without definition. C: addresses picked at random. D: no discussion of what real drivers care about besides distance.
Data
Only a distance table is needed, but a brute-force check beyond about nine points needs a short program.

Breaking a Hill cipher with matrices and modular arithmetic

Aim. How many plaintext and ciphertext pairs are needed to recover the key of a Hill cipher, and how does the choice of modulus affect which keys are usable?

  • AI · HL topic
  • Easy to start
  • Simulation
  • Rarely listed

My take. A good choice if the attack and key count are the centre. Common cryptography descriptions score poorly.

Mathematics, first steps and where marks are lost+
Mathematics
Modular arithmetic, matrix multiplication, determinants and inverse matrices (AI HL), inverses modulo 26, greatest common divisor, counting invertible keys. Beyond syllabus: modular inverses of matrices and Bezout's identity.
How to start
Encode a short message with a 2 by 2 key modulo 26 by hand. Then solve for the key from two known plaintext pairs and check when the determinant has no inverse.
SL and HL
Matrices are AI HL, so this is an AI HL idea. Depth comes from the known-plaintext attack, a proof of when it recovers the key, and a count of the usable 2 by 2 keys. An SL student could do the affine cipher idea instead.
Where marks are lost
E: encrypting and decrypting only, with no analysis of attack. B: number theory stated but not justified. A: long tables. D: no comparison of cipher strength.
Data
Simulation in a spreadsheet or code is easy, but proving key counts needs care.

Check digits: how well do ISBN and card numbers catch typing errors?

Aim. What proportion of single-digit and adjacent-swap errors is detected by the ISBN-13 and Luhn check-digit schemes, and why do some errors escape?

  • AA and AI · SL and HL
  • Easy to start
  • Simulation
  • Rarely listed

My take. A good, safe topic with real mathematics if the detection rates are proved and not just quoted. Twist: test the numbers on your own bookshelf and on a card scheme you invent.

Mathematics, first steps and where marks are lost+
Mathematics
Modular arithmetic, divisibility, weighted sums, counting arguments and probability of detection, systematic listing of all error types. HL can add proof using congruences and the role of primes as moduli. Beyond syllabus: the Verhoeff scheme, which uses group theory.
How to start
Write a spreadsheet or short program that takes 100 real ISBN numbers, applies every possible single-digit change and every adjacent swap, and counts how many still pass the check.
SL and HL
SL can count detections by simulation and explain with mod 10. HL can prove exactly which swaps go undetected and why modulus 11 in ISBN-10 behaves differently.
Where marks are lost
E: stopping at describing the scheme with no proof. B: unexplained modular notation. D: no comparison between schemes.
Data
Numbers can be generated or taken from books at home, and the proofs are short.

Comparing savings plans and loan repayments with geometric series

Aim. How long does it take a regular monthly saving plan to reach a target sum, and how does the answer change with the compounding frequency and a realistically varying interest rate?

  • AA and AI · SL and HL
  • Easy to start
  • Public data
  • Rarely listed

My take. Safe and accessible but risks being a textbook exercise. Make it personal with a real goal, such as a deposit for university, and test the model against varying rates.

Mathematics, first steps and where marks are lost+
Mathematics
Sum of a finite geometric series; compound interest with n compounding periods per year; solving for the number of periods with logarithms; comparison of nominal and effective rates and the limit as n tends to infinity giving continuous compounding with e. Sum to infinity for perpetuities.
How to start
Take the published rates of two or three real savings accounts or a student loan. Derive the closed formula for a monthly deposit annuity, then check it against a spreadsheet that rolls the balance forward month by month.
SL and HL
SL students derive and use the annuity formula and logarithms for time to target. HL extension: continuous compounding as a limit, and modelling a rate that changes each year with a product of factors compared with a constant average rate.
Where marks are lost
E: using the formula from a textbook without deriving it or testing its assumptions. C: generic figures with no connection to a real decision. D: no reflection on inflation, tax and fixed rates.
Data
Bank rates and inflation figures are public and easy to cite.

Continued fractions and the best rational approximations

Aim. Why do the convergents of a continued fraction give the best rational approximations to √2, e and π, and how does the error compare with the size of the denominator?

  • AA · SL and HL
  • Easy to start
  • Pure maths, no data
  • Rarely listed

My take. Quite a good idea once tied to approximation. Personal link: gear ratios, calendars or musical tuning make the application concrete.

Mathematics, first steps and where marks are lost+
Mathematics
Recurrence relations for convergents, sequences and limits, solving quadratics for periodic expansions such as √n, proof by induction of pk qk−1 − pk−1 qk = ±1, comparison of errors with 1/q² and a log scale plot. Beyond syllabus: Pell's equation from convergents.
How to start
Expand √2 and π by the Euclidean-style algorithm, compute the first eight convergents and tabulate |x − p/q| against 1/q².
SL and HL
SL treats quadratic irrationals and the recurrence. HL adds the proof of the determinant identity and the bound |x − p/q| < 1/q².
Where marks are lost
E: listing Ramanujan's expansions with no explanation. A: unfocused wandering across patterns. D: no assessment of what is proved versus observed.
Data
Everything is computable by hand or spreadsheet and the proofs are short.

Counting steps in the Euclidean algorithm and Lamé's bound

Aim. What is the worst-case number of division steps in the Euclidean algorithm for numbers below N, and why do consecutive Fibonacci numbers produce it?

  • AA and AI · SL and HL
  • Easy to start
  • Simulation
  • Rarely listed

My take. On its own, computing a GCD is a textbook exercise. The worst-case step count and the Fibonacci link turn it into real mathematics.

Mathematics, first steps and where marks are lost+
Mathematics
Euclidean algorithm and division with remainder, the Fibonacci sequence, the closed form with the golden ratio, inequalities and induction, logarithms to bound step count, average step count found by computation, Bézout's identity by back substitution. Beyond syllabus: Lamé's theorem.
How to start
Code the algorithm, record the step count for all pairs (a,b) up to 1000, find which pairs give the maximum, and check that they are Fibonacci neighbours.
SL and HL
SL can do the experiment, the Fibonacci pattern and a log bound. HL adds induction for the exact bound and a comparison of average versus worst case with a fitted model.
Where marks are lost
B: the algorithm described but not analysed. E: nothing beyond computing a GCD, which is only textbook. A: code dumps.
Data
The data is simulated easily, though the average-case model is a bit harder to justify.

Do different voting rules crown different winners?

Aim. Using ranked ballot data from a real preferential election, how often do plurality, Borda count, runoff and Condorcet rules disagree on the winner, and which fairness criteria fail?

  • AA and AI · SL and HL
  • Needs care
  • Public data
  • Rarely listed

My take. Rarely listed, so fresher than most, but it turns weak if it stays a list of methods. Keep it to a sharp question on disagreement rates and use real ballots, ideally from your own school.

Mathematics, first steps and where marks are lost+
Mathematics
Counting and permutations of preference orders; Borda scoring as arithmetic sequences; pairwise majority comparison in a table; probability of a Condorcet cycle for three candidates under random ballots, exactly 1/18 for three voters (countable by hand) and about 8.8% as the number of voters grows; simulation of random electorates. Beyond syllabus: Arrow's impossibility theorem stated, not proved.
How to start
Find a published ranked ballot dataset, for example from Scottish council elections or a club or society election, and tabulate first preferences. Then compute Borda scores and the pairwise matrix for the top three candidates.
SL and HL
SL students can compare methods on one real dataset and construct a small paradox by hand. HL depth comes from computing the cycle probability analytically and comparing it to simulation across electorate sizes.
Where marks are lost
E: descriptive comparison with little calculation; A: too many methods introduced without focus; C: no personal link such as a school council vote; D: not questioning whether the data represent true preferences.
Data
Ranked ballot data is available but needs cleaning; a simulation fallback exists if real data is thin.

Fibonacci ratios and the speed of convergence

Aim. Why do ratios of consecutive Fibonacci numbers settle at the golden ratio, and how many terms are needed before the ratio is correct to a chosen number of decimal places?

  • AA and AI · SL and HL
  • Easy to start
  • Pure maths, no data
  • Rarely listed

My take. Very common and safe, but easy to make routine. It becomes worthwhile only if you generalise to other recurrences and quantify the error rate yourself.

Mathematics, first steps and where marks are lost+
Mathematics
Second-order recurrence; fixed-point equation x = 1 + 1/x solved with the quadratic formula; limits of sequences; error analysis using geometric decay. HL extension: Binet's formula from the characteristic equation, giving the error term exactly as a multiple of (−1/φ²)ⁿ. Beyond syllabus: generalise to Fₙ = aFₙ₋₁ + bFₙ₋₂.
How to start
Use a spreadsheet to list the first 30 Fibonacci numbers and their ratios, then plot the absolute error against n on a log scale and look at the slope before any algebra.
SL and HL
SL students find the fixed point, show the errors alternate in sign and fit a geometric model to the data. HL students derive Binet's formula, prove the error rate is φ⁻² per step, and extend to other starting values or other recurrences.
Where marks are lost
E: stopping at the fixed-point equation, which assumes the limit exists without justifying it. D: reflection limited to 'it works'. C: weak if the golden-ratio-in-nature story is just repeated.
Data
Pure theory with spreadsheet checks; the only risk is assuming convergence rather than showing it.

Greedy algorithm for Egyptian fractions: does it always stop?

Aim. Does the greedy method of always subtracting the largest possible unit fraction terminate for every proper fraction, and how long can the resulting expansions become?

  • AA and AI · SL and HL
  • Easy to start
  • Simulation
  • Rarely listed

My take. A neat idea that is only worth choosing with the termination proof and a real comparison of algorithms. Testing 4/n against the Erdős-Straus conjecture gives it a personal, open-ended feel.

Mathematics, first steps and where marks are lost+
Mathematics
Fractions and inequalities; proof of termination by showing the numerator strictly decreases; ceiling function; comparison of greedy expansions with shortest ones for fractions such as 4/n; sequences with rapid growth of denominators. Beyond syllabus: the Erdős-Straus conjecture 4/n = 1/x+1/y+1/z tested computationally.
How to start
Perform the greedy method by hand on 5/6, 4/13 and 5/121, then code it and record the number of terms and the largest denominator for every fraction with denominator below 100.
SL and HL
SL students prove termination and study the data on length and denominator size. HL adds a proof that the denominators can grow extremely fast (each one roughly the square of the previous at worst), or a search for the shortest expansions of 4/n.
Where marks are lost
E if the termination proof is missing and the work only shows examples. B if the notation for the algorithm is unclear. C if it is only a history of Egyptian mathematics.
Data
The proof is short and the computations are small; big denominators need exact integer arithmetic in code.

Last digits and cycles: powers under a modulus

Aim. For which moduli n and bases a does the sequence ak mod n repeat, how long is its period, and how can this predict the last two digits of large powers?

  • AA · SL and HL
  • Easy to start
  • Pure maths, no data
  • Rarely listed

My take. A good and safe choice if the scope stays on powers. A twist such as designing a check-digit scheme or predicting the last digits of a number that means something to you makes it yours.

Mathematics, first steps and where marks are lost+
Mathematics
Congruence notation, proof by induction for ak ≡ ak+p statements, periods of powers, and the link between the period and n. Beyond syllabus: Euler's totient function and Euler's theorem, the Chinese remainder theorem to split a modulus into coprime parts, and the multiplicative order of an element.
How to start
Tabulate ak mod n for n from 2 to 30 and a coprime to n in a spreadsheet, record the period each time, then compare with φ(n) and conjecture a rule.
SL and HL
SL students can tabulate, conjecture and prove cycle lengths for prime moduli using simple algebra. HL depth comes from proving Euler's theorem and using the Chinese remainder theorem to predict periods for composite moduli.
Where marks are lost
E: stopping at tables with no proof. B: heavy notation left undefined. C: a generic 'modular arithmetic is everywhere' framing with no personal angle.
Data
Pure theory with easy computation, and the proofs are elementary if the scope stays on powers.

Leslie matrices for a real species population

Aim. Can a Leslie matrix built from real survival and fertility data predict the long-term growth and age structure of a chosen population?

  • AI · HL topic
  • Needs care
  • Public data
  • Rarely listed

My take. A good choice with a real data set. Choosing a species you care about and testing how a conservation change alters the growth rate makes it personal.

Mathematics, first steps and where marks are lost+
Mathematics
Matrix multiplication and powers, eigenvalues and eigenvectors, dominant eigenvalue as growth rate, diagonalisation, sensitivity of the eigenvalue to survival rates, comparison with a Markov chain for a closed system. Beyond syllabus: Perron-Frobenius reasoning.
How to start
Find an age-structured life table for one species, such as a fish or a bird, build a 3-class Leslie matrix and compute the first ten generations.
SL and HL
Matrices and eigenvalues are AI HL, so this is an AI HL idea. Depth comes from the exact eigenvalue analysis, the stable age distribution as an eigenvector, and a sensitivity test: which survival rate changes the growth rate most.
Where marks are lost
E: eigenvalue work done by software with no explanation. C: a generic species with no personal link. D: no comment on data reliability.
Data
Reliable fertility and survival rates take searching in published life tables.

Modular arithmetic behind Caesar and affine ciphers

Aim. How many distinct affine ciphers exist over a 26-letter alphabet, and how does frequency analysis break them?

  • AA and AI · SL and HL
  • Easy to start
  • Pure maths, no data
  • Rarely listed

My take. Caesar alone is too thin. It becomes a good exploration once you prove invertibility conditions and break your own ciphertext with letter frequencies.

Mathematics, first steps and where marks are lost+
Mathematics
Modular arithmetic, congruences, greatest common divisor and Euclidean algorithm, modular inverses, counting arguments. Beyond syllabus: Euler's totient function.
How to start
Encode a short sentence with a shift of 3, then with a map x to 5x+8 mod 26. Find which multipliers a allow decryption by testing gcd(a,26).
SL and HL
SL treats Caesar and affine ciphers, counts the 312 affine keys and proves which multipliers are invertible. AI HL students can move to a Hill cipher with 2 by 2 matrices mod 26.
Where marks are lost
E: a Caesar cipher alone is a textbook exercise. B: modular notation used loosely. C: no real message or attack of the student's own.
Data
Little data needed. Use a real English passage for frequency analysis of a cipher you break yourself.

Parametrising every Pythagorean triple and counting them

Aim. Why does every primitive Pythagorean triple take the form (m²−n², 2mn, m²+n²), and how many triples exist with hypotenuse below a given bound N?

  • AA and AI · SL and HL
  • Easy to start
  • Pure maths, no data
  • Rarely listed

My take. A classic that moderators know, so it earns marks only through a genuine proof and the counting question. Adding the growth rate of the number of triples below N gives it a personal, quantitative twist.

Mathematics, first steps and where marks are lost+
Mathematics
Divisibility and parity arguments; proof by contradiction; rational parametrisation of the unit circle using the gradient of a line through (−1,0); coprimality conditions on m and n; counting with sequences and inequalities. Beyond syllabus: the tree of primitive triples generated by three matrices.
How to start
List all triples up to hypotenuse 100 by hand or spreadsheet, mark the primitive ones and tabulate the (m,n) that produce each. Then prove that in a primitive triple exactly one leg is even.
SL and HL
SL students derive the formula through parity and factorisation, then count triples up to N and compare with a fitted trend. HL students can add the unit circle parametrisation with a full proof, or the matrix tree generation.
Where marks are lost
E if the formula is quoted rather than derived. A and B if a table of triples replaces argument. D if there is no comment on the limits of the counting estimate.
Data
Pure theory with a small computed check; the proofs are elementary but need careful writing about coprimality.

Pyramid schemes: how fast recruitment runs out of people

Aim. After how many levels must a pyramid scheme collapse, and what share of participants lose money?

  • AA and AI · SL and HL
  • Easy to start
  • Simulation
  • Rarely listed

My take. Accessible and very clear, though it risks being too easy. It earns marks only if the recruitment ratio is varied and a realistic decay model is fitted.

Mathematics, first steps and where marks are lost+
Mathematics
Geometric sequences and series, sum to n terms, exponential growth against a fixed population, logarithms to solve for the number of levels, comparison with a logistic model. HL: sum to infinity for a scheme with declining recruitment, and differential equation for logistic growth.
How to start
Set a scheme where each member pays 100 EUR and recruits 4 people. Build a spreadsheet of members and money by level, then find the level where the total exceeds the population of Italy.
SL and HL
SL does the geometric model, the collapse level with logarithms and the share of members in the last level, who never recruit anyone: with each member recruiting r people it is close to (r - 1)/r of everyone, so 3/4 when r = 4. HL adds a recruitment rate that falls by level and a logistic comparison.
Where marks are lost
E: only summing a geometric series, which is textbook level. D: no discussion of how unrealistic constant recruitment is. B: the definition of a loser left unclear.
Data
All data is constructed by the student, which is easy but needs sensible parameter choices justified.

Ranking pages with PageRank and a damping factor

Aim. How does the damping factor change the ranking of pages in a small network, and why does the iteration always settle?

  • AI · HL topic
  • Easy to start
  • Simulation
  • Rarely listed

My take. Very good HL choice as it is maths from the first page. It stays weak if the student ends up describing social media, so keep it to the matrices and test damping values.

Mathematics, first steps and where marks are lost+
Mathematics
Matrices, powers of matrices, eigenvalues and eigenvectors, the stationary vector of a stochastic matrix, geometric series for convergence. Beyond syllabus: the Perron-Frobenius result, quoted but not proved.
How to start
Draw a 6-page network from a small real site or a set of accounts, build the link matrix column by column, and compute the dominant eigenvector by repeated multiplication from an even start.
SL and HL
Matrices and eigenvectors are AI HL, so this is an AI HL idea. Depth: show that the damped matrix has a steady state, find it as an eigenvector, and show how the second eigenvalue sets the speed of convergence.
Where marks are lost
E: leaning on a software eigenvector command without showing meaning. B: unclear notation for the matrix. C: reads as a summary of Google. D: no discussion of manipulation.
Data
Small hand-built networks are enough, and the theory can be handled with matrices.

Roots of unity and complex roots on the Argand diagram

Aim. How do the roots of zn = w and of polynomials with real coefficients arrange themselves in the complex plane, and what happens to them when a coefficient changes?

  • AA · HL topic
  • Easy to start
  • Simulation
  • Rarely listed

My take. Sound but risks being a routine exercise. Choose a parameter family or a link to geometry, for example regular polygons from roots, so the exploration asks a genuine question.

Mathematics, first steps and where marks are lost+
Mathematics
Polar and exponential form, de Moivre's theorem, nth roots, conjugate root theorem, factorisation of real polynomials, sums of roots of unity, transformations as rotation and scaling. Beyond syllabus: how roots move as a parameter varies.
How to start
Solve zn = 1 for n up to 8, plot the roots, then pick a family such as z3 + az + 1 = 0 and plot how the roots move as a changes using software.
SL and HL
This is HL only because complex numbers are HL content. The extra depth comes from proving results such as the roots of unity summing to zero, and from tracking roots with a parameter and finding when they collide.
Where marks are lost
E: only plotting known roots, which is the textbook level; B: skipped steps in de Moivre derivations; C: no reason for choosing this; D: no reflection on accuracy of numerical roots.
Data
Needs only a graphing tool or a few lines of code to solve polynomials numerically.

Steady levels under repeated medication doses

Aim. For a drug with a known half-life, how does the time between doses control the peak and trough concentrations that build up over many doses?

  • AA and AI · SL and HL
  • Needs care
  • Public data
  • Rarely listed

My take. A good applied idea with real mathematics. Strong if you use a drug you know and compare your model with the printed dosing limits.

Mathematics, first steps and where marks are lost+
Mathematics
Exponential decay C = C₀e−kt with k from the half-life; geometric series for the concentration after n doses; the limit as n→∞ giving a steady peak C₀/(1−e−kτ) for dose interval τ; inequalities to find when a therapeutic window is reached. HL: the model dC/dt = −kC between doses solved by separation of variables, compared with continuous infusion.
How to start
Choose a real drug, such as paracetamol or ibuprofen, look up its half-life and dosing advice from an official leaflet, and calculate concentrations after doses 1 to 5 by hand.
SL and HL
SL students build the series model, derive the steady-state peak and trough, and test different intervals. HL students derive the same result from a differential equation and compare with a continuous infusion model.
Where marks are lost
E: assuming instant absorption with no comment. A: lots of tables and no clear structure. D: not questioning the one-compartment assumption or the reliability of half-life values.
Data
Half-life values are easy to find, but check that they come from reliable sources and state clearly that this is not medical advice.

True cost of a loan: simple, compound and hidden fees

Aim. For a realistic consumer loan, how much of the total repayment comes from the interest method and how much from fees, and at what term does the ranking of offers change?

  • AA and AI · SL and HL
  • Easy to start
  • Public data
  • Rarely listed

My take. A solid and practical choice, but a common one. It becomes strong when you derive the amortisation formula and find the APR yourself rather than quoting it.

Mathematics, first steps and where marks are lost+
Mathematics
Geometric sequences and series, compound interest with different compounding periods, the loan repayment formula (amortisation) derived from a geometric series, solving for the interest rate numerically, effective annual rate, comparison of offers via graphs and intersections. Beyond syllabus: the APR as the root of an equation for the cash flows.
How to start
Take two or three published loan offers (bank or car finance sites). Model each in a spreadsheet, then derive the monthly payment formula by hand and check it against the spreadsheet.
SL and HL
SL derives the repayment formula and finds the effective rate of each offer. HL can extend to continuous compounding, or to solving for the true APR with an arrangement fee by numerical root finding. Top band comes from finding a crossover term where the cheapest offer switches.
Where marks are lost
E: using only the calculator's finance solver with no derivation. A: long tables of numbers with no structure. C: generic loan with no personal link.
Data
Offers are public, and all the maths can be verified independently.

Where the sum 1+2+3+... = -1/12 breaks down

Aim. Which steps in the common derivations of 1+2+3+... = -1/12 are legitimate, and what does the value actually mean for a smoothed or regularised sum?

  • AA · HL topic
  • Demanding
  • Pure maths, no data
  • Rarely listed

My take. Popular and often done badly. It is only worth choosing if you stay with the cutoff calculation and are honest about what -1/12 means. The twist is testing the three summation methods on the same series.

Mathematics, first steps and where marks are lost+
Mathematics
Geometric series and convergence, Maclaurin series, sigma notation, partial sums, Abel summation of 1-1+1-1+..., a smoothed sum using an exponential cutoff with limits (HL), then a simple form of the Riemann zeta function continuation as the beyond-syllabus idea.
How to start
Take Grandi's series 1-1+1-1+... and show that Cesàro and Abel summation both give 1/2. Then apply the exponential cutoff e-nε to 1+2+3+..., expand with Maclaurin series and find the constant term.
SL and HL
SL students can study partial sums, why the usual shifting trick fails and the Abel sum of Grandi's series. HL students can do the cutoff calculation with series expansions and limits, and compare it with the zeta value.
Where marks are lost
E: proofs that copy the zeta continuation without understanding it. B: unclear distinction between 'equals' and 'is assigned'. D: no critical view of why the value is useful in physics.
Data
The full zeta continuation needs complex analysis, so the scope must be held to the cutoff method.

Where the √2 irrationality proof breaks

Aim. For which positive integers n is √n irrational, and which step of the classical √2 proof stops working when n is a perfect square?

  • AA · SL and HL
  • Easy to start
  • Pure maths, no data
  • Rarely listed

My take. Well-worn and short. It only merits choosing if you push to general n and kth roots and explain why the parity argument needs replacing.

Mathematics, first steps and where marks are lost+
Mathematics
Proof by contradiction; parity and divisibility arguments; prime factorisation and the fundamental theorem of arithmetic; generalising to √p, √(pq), and ³√2 and other roots. Beyond syllabus: the rational root theorem.
How to start
Write out the √2 proof line by line, then try it word for word on √3, √4 and √6 and mark each line where it fails or needs a new argument.
SL and HL
Proof by contradiction is AA HL, so HL students handle √p for primes, then any non-square n using prime factorisation, and extend to kth roots and to sums such as √2 + √3. An SL student can study the step where the argument fails for perfect squares, but the proofs themselves sit in the HL course.
Where marks are lost
E: repeating the standard proof without extension. B: unclear wording in the contradiction steps. C: seen extremely often, so little personal input.
Data
Pure theory; the main danger is being a textbook exercise unless you find your own family of cases.

Which exponents give Mersenne primes? Testing and proving

Aim. Why must n be prime for 2ⁿ−1 to be prime, and how does the Lucas-Lehmer test decide primality far faster than trial division?

  • AA and AI · SL and HL
  • Easy to start
  • Simulation
  • Rarely listed

My take. Good if it centres on the proof of the necessary condition and an efficiency comparison. Joining a distributed search is not mathematics and earns nothing in criterion E.

Mathematics, first steps and where marks are lost+
Mathematics
Factorisation of 2ab−1 using geometric series; modular arithmetic; proof by contradiction; recurrence sequence s(k+1) = s(k)²−2 mod (2p−1); comparing running times with growth of exponential functions. Beyond syllabus: a sketch of why Lucas-Lehmer works via quadratic extensions.
How to start
Factorise 2ⁿ−1 for n up to 30 by computer, and note which are prime and which prime n still fail (11, 23, 29). Then prove the necessity of n prime using a geometric series.
SL and HL
SL students prove the prime exponent condition and run the Lucas-Lehmer recurrence with modular arithmetic. HL adds a proof for the test itself or the link with perfect numbers.
Where marks are lost
C if the exploration only mentions distributed prime searches and does no mathematics of its own. E if the test is used without justification. A if the computational tables crowd out the argument.
Data
Small cases run on any laptop; the proof of the Lucas-Lehmer test is hard, so an honest scope must be chosen.

Which numbers are sums of two squares?

Aim. Which positive integers n can be written as x² + y² with integers x and y, and how does the prime factorisation of n decide this?

  • AA · SL and HL
  • Needs care
  • Pure maths, no data
  • Rarely listed

My take. A proper number theory problem that you can genuinely solve in part. Plan which half of the theorem you will prove and check the rest with a program.

Mathematics, first steps and where marks are lost+
Mathematics
Prime factorisation, modular arithmetic mod 4, proof by contradiction, the identity (a²+b²)(c²+d²) = (ac−bd)² + (ad+bc)², counting solutions systematically. HL extension: complex numbers and Gaussian integers, where n = |z|² and the product identity is just |zw| = |z||w|.
How to start
List all n up to 100 that are sums of two squares, factorise each, and look for what the failures share.
SL and HL
SL proves with arithmetic mod 4 that no number of the form 4k + 3 is a sum of two squares, and uses the product identity to build new sums from old. The full rule, that every prime of the form 4k + 3 must appear to an even power, needs a further argument that suits HL, and complex numbers make the product identity transparent.
Where marks are lost
E: quoting Fermat's two-square theorem with no proof of either direction. B: gaps in a proof by cases. C: no reason given for the interest.
Data
The full theorem needs care, so a student should plan which half to prove and check it with a program.

Winning positions in Nim and a variant of my own

Aim. How can the winning strategy in Nim be characterised using binary representations, and does it survive when a new move rule is added?

  • AA and AI · SL and HL
  • Easy to start
  • Pure maths, no data
  • Rarely listed

My take. Nim is well known, so the invented variant is what makes it yours. Solid if the proof is done and the variant is genuinely analysed.

Mathematics, first steps and where marks are lost+
Mathematics
Binary representation, the XOR (nim-sum) operation as addition without carry, proof by induction of the P-position characterisation, recurrence relations for counting positions, combinatorial counting. Beyond syllabus: Sprague-Grundy values.
How to start
Play two-heap and three-heap Nim by hand, tabulate all positions with small heaps as winning or losing, then look for the pattern before proving it.
SL and HL
SL can find and justify patterns for two heaps and small cases. HL or top-band work proves the nim-sum theorem by induction and analyses the modified game.
Where marks are lost
E if patterns are guessed and never proved; C if the game is copied without a personal variant; A if the tables are unreadable.
Data
Pure theory with small exhaustive tables.

Ideas were collected from public lists and published exploration titles, merged when they are the same exploration, rewritten from scratch and checked by hand. “On N sites” counts how many public lists carry the same idea. How this list was made. Have a draft already? An IA review reads it against the five criteria before you submit.

Frequently asked questions

What are good IB Math IA ideas on number and algebra?

+
Good starting points that are easy to begin and rarely listed are check digits: how well do ISBN and card numbers catch typing errors?, comparing savings plans and loan repayments with geometric series and continued fractions and the best rational approximations. Each has a clear question and room for a second method, which is where Personal engagement and Reflection come from.

Which number and algebra IA topics are overdone?

+
bounding the best delivery round for local addresses are either named in the subject reports among topics seen too often or appear on three or more public lists. They still work, but only with a twist that is your own.

Which of these number and algebra ideas fit AA and which fit AI?

+
23 of the 28 ideas use mathematics from Analysis and Approaches and 21 from Applications and Interpretation; many fit both. 8 rely on HL content and are marked as HL.

Have a draft? Get it read before you submit.

I read your Internal Assessment in full, assess it criterion by criterion against the IB criteria, and discuss it with you in a 50-minute session. No AI, confidential. US$630.

How the IA review works