IA idea · Cryptography & number theory
Which typing errors does a check digit catch? ISBN-10 versus ISBN-13
Research question
Which single-digit errors and swaps of adjacent digits are always detected by the ISBN-10 and ISBN-13 check digits, which slip through, and why does working modulo 11 catch more than working modulo 10?
Make it yours, then agree it with your teacher.
Next step: plan this IA free — the planner opens with this question filled in. For feedback on your own draft, the IA package (€39 once) gives you 5 AI feedback credits and every annotated exemplar in full.
Why it makes a good exploration
Check digits are everywhere (books, bank cards, parcels) and the mathematics is a clean, provable piece of number theory. You can test the theory on real barcodes from your own shelf.
The mathematics you'll need
- Modular arithmetic (new: explain it with examples)
- Weighted sums and why a prime modulus matters
- Proof that ISBN-10 detects every single error and every adjacent swap
- Finding the adjacent swaps ISBN-13 misses (digits differing by 5)
- Counting: proportion of errors detected
Where the data comes from
No data needed; check the rules on ISBNs from books you own.
- Desmos graphing calculator — Free graphing and regression (y₁ ~ ax₁ + b) — fit models to your data and show residuals.
A possible outline
- Explain modular arithmetic with your own examples.
- Verify both check-digit rules on real books.
- Prove which errors ISBN-10 always detects.
- Find and explain the swaps ISBN-13 misses.
- Count the proportion of all possible errors each scheme catches and reflect on the trade-off.
Pitfalls that cost marks
- Checking examples instead of proving.
- Using mod notation before explaining it.
- Forgetting the 'X' check digit in ISBN-10.
Showing personal engagement
- Use the books on your own shelf.
- Design your own check-digit scheme and test it.
- Find a real error the scheme would miss.
See Criterion C: personal engagement for what examiners look for.
Which course is it for?
| Course | Fit | Maths to lean on |
|---|---|---|
| AA SL | Good fit | Modular arithmetic (new: explain it with examples); Weighted sums and why a prime modulus matters |
| AA HL | Good fit | Modular arithmetic (new: explain it with examples); Weighted sums and why a prime modulus matters |
| AI SL | Not a natural fit | The mathematics is mainly AA or HL (calculus or proof beyond AI SL); an AI SL version would need a data-driven, technology-based approach. |
| AI HL | Not a natural fit | The mathematics is mainly from the AA course; an AI HL version would need modelling with technology, statistics or networks at HL level. |
Level: Solid. Needs some independent work beyond class examples. See how the IA differs between AA and AI, SL and HL.
How this idea reaches the top bands
Reflection (D)
For this idea, start with the weak points: checking examples instead of proving; and using mod notation before explaining it. Say how each one affects your answer.
Use of mathematics (E)
SL: modular arithmetic (new: explain it with examples); weighted sums and why a prime modulus matters; proof that ISBN-10 detects every single error and every adjacent swap; finding the adjacent swaps ISBN-13 misses (digits differing by 5); counting: proportion of errors detected, each explained in your own words and carried out correctly.
How cryptography explorations reach the top bands in general: Cryptography & number theory IA ideas. Guides: A · B · C · D · E · self-grade sheet.
Taking it further
Analyse another real scheme (bank card numbers use the Luhn algorithm) or design a scheme that catches two errors.
Extending it for HL
Add an HL technique the question genuinely needs: what an HL cryptography exploration adds.
See a complete IA, marked
How far can a stack of books lean over the edge of a table? (AA HL) is a complete cryptography exploration, marked on every criterion.
Frequently asked questions
Which IB Maths course is this IA idea for?
It works for AA HL and AA SL. We rate it Solid: it needs some independent work beyond class examples.
What mathematics does this IA use?
Modular arithmetic (new: explain it with examples), weighted sums and why a prime modulus matters, proof that ISBN-10 detects every single error and every adjacent swap, finding the adjacent swaps ISBN-13 misses (digits differing by 5) and counting: proportion of errors detected.
Where can I get data for this IA?
No data needed; check the rules on ISBNs from books you own. Checked sources and tools: Desmos graphing calculator.
Turn this idea into your IA
The planner opens with “Which typing errors does a check digit catch? ISBN-10 versus ISBN-13” filled in: the question, the maths and the data sources.
Your plan is kept in this browser. A free account keeps it with your drafts on any device: Join free · Sign in
Also: free IA self-check · A–E checklist (PDF) · have a draft? AI feedback or a review with Pete (€100)
Writing it up: how to write a Maths IA, step by step · structure and format · mistakes that cost marks · annotated exemplars, marked on every criterion
Similar ideas
- The Collatz conjecture: what can we say about stopping times?AA SLAA HLAI SLAI HLSolid
- How many primes are there below n? Testing the prime number theoremAA SLAA HLAI SLSolid
- Patterns in the last digits of powersAA SLAA HLSolid
- How does RSA encryption work, and how long would it take to break a small key?AA HLAA SLAmbitious
All cryptography ideas · AA HL ideas · AA SL ideas · All 239 IA ideas