IA idea · Cryptography & number theory
Perfect numbers and Mersenne primes: proving Euclid's rule
Research question
Why does 2ᵖ⁻¹(2ᵖ − 1) give a perfect number whenever 2ᵖ − 1 is prime, why must p itself be prime, and how rare are such numbers among those you can check?
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
An ancient result with a short, satisfying proof that uses geometric series and divisors. The second question (why p must be prime) is a neat proof by contradiction.
The mathematics you'll need
- Sum of divisors and geometric series
- Proof of Euclid's rule
- Factorising 2ᵃᵇ − 1 to show p must be prime (proof by contradiction)
- Counting how many cases you can verify
- Logarithmic growth of the known examples
Where the data comes from
No data needed; check lists of perfect numbers and Mersenne exponents against OEIS.
- OEIS (On-Line Encyclopedia of Integer Sequences) — Check a sequence you have found and read its known formulas and references.
A possible outline
- Find the first perfect numbers by hand.
- Prove Euclid's rule with a geometric series.
- Prove the exponent must be prime.
- Test which prime exponents fail.
- Reflect on what is known and unknown (odd perfect numbers).
Pitfalls that cost marks
- Claiming the converse (Euler's result) without proof or acknowledgement.
- History instead of mathematics.
- Not checking examples.
Showing personal engagement
- Find the perfect numbers yourself before reading about them.
- Investigate abundant and deficient numbers.
- Make and test your own conjecture.
See Criterion C: personal engagement for what examiners look for.
Which course is it for?
| Course | Fit | Maths to lean on |
|---|---|---|
| AA SL | Not a natural fit | The core technique sits in the AI course or at HL; an AA SL student could use it only as clearly explained new mathematics. |
| AA HL | Good fit | Sum of divisors and geometric series; Proof of Euclid's rule |
| 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: Ambitious. Suits confident students; expect to learn some mathematics on your own. 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: claiming the converse (Euler's result) without proof or acknowledgement; and history instead of mathematics. Say how each one affects your answer.
Use of mathematics (E)
HL: sum of divisors and geometric series; proof of Euclid's rule; factorising 2ᵃᵇ − 1 to show p must be prime (proof by contradiction); counting how many cases you can verify; logarithmic growth of the known examples, 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
Prove that every even perfect number has Euclid's form (a harder, known result), or investigate amicable pairs.
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. We rate it Ambitious: it suits confident students, who should expect to learn some mathematics on their own.
What mathematics does this IA use?
Sum of divisors and geometric series, proof of Euclid's rule, factorising 2ᵃᵇ − 1 to show p must be prime (proof by contradiction), counting how many cases you can verify and logarithmic growth of the known examples.
Where can I get data for this IA?
No data needed; check lists of perfect numbers and Mersenne exponents against OEIS. Checked sources and tools: OEIS (On-Line Encyclopedia of Integer Sequences).
Turn this idea into your IA
The planner opens with “Perfect numbers and Mersenne primes: proving Euclid's rule” 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
- Agreeing a secret in public: the Diffie–Hellman key exchangeAA HLAmbitious
- Which typing errors does a check digit catch? ISBN-10 versus ISBN-13AA HLAA SLSolid