Maths EE ideas library
Maths Extended Essay ideas: number theory
Primes, divisibility, Diophantine equations and the patterns in the integers. Number theory suits an EE because a narrow question can be stated exactly and the results can be proved, not just observed.
Number theory ideas (12)
- Which numbers are sums of two squares?Number theorySolid
- Generating every Pythagorean tripleNumber theoryAccessible
- Solving Pell's equation with continued fractionsNumber theoryAmbitious
- When Fermat's little theorem fools usNumber theorySolid
- Perfect numbers and Mersenne primesNumber theorySolid
- Divisibility tests in any baseNumber theoryAccessible
- Patterns in Collatz stopping timesNumber theorySolid
- Farey sequences and Ford circlesNumber theorySolid
- Counting partitions with generating functionsNumber theoryAmbitious
- How long is the repeating block of 1/n?Number theoryAccessible
- The Chinese remainder theorem and calendar cyclesNumber theoryAccessible
- Best rational approximations to πNumber theorySolid
Research questions to start from
One starting question for each idea. Change the case, the comparison or the limit until it is yours.
- Which numbers are sums of two squares? Solid
- Which positive integers can be written as the sum of two squares, and how does the number of such representations depend on the prime factorisation? A classical result with an elementary but genuine proof, and a counting question you can test by computation before you prove it.
- Generating every Pythagorean triple Accessible
- How can every primitive Pythagorean triple be generated from two integers, and what does the parametrisation reveal about which numbers can be the hypotenuse? An accessible proof that every student can follow and extend, with a natural follow-up question about the hypotenuse.
- Solving Pell's equation with continued fractions Ambitious
- How does the continued fraction expansion of √d produce the fundamental solution of x² − dy² = 1, and how large can that solution be for small d? Links two beautiful areas, gives you an algorithm to analyse, and produces surprising data (some fundamental solutions are enormous).
- When Fermat's little theorem fools us Solid
- How reliable is the Fermat test as a primality test, and how do Carmichael numbers defeat it? Combines a proof, an algorithm and a counterexample family: a natural line of argument from method to evaluation.
- Perfect numbers and Mersenne primes Solid
- Why must every even perfect number have the form 2^(p−1)(2^p − 1) with 2^p − 1 prime, and what can be proved about odd perfect numbers? A complete classification with a proof you can own, plus an open problem where you can prove partial results.
- Divisibility tests in any base Accessible
- Which divisibility tests from base 10 have analogues in other bases, and how can a test for divisibility by any integer be constructed? Familiar ideas generalised: modular arithmetic does all the work, and you can construct new tests and prove them.
- Patterns in Collatz stopping times Solid
- What can be proved about the stopping times of the Collatz map for numbers in particular residue classes, even though the conjecture itself is open? An open problem where you can still prove real statements, provided you are honest about what remains conjecture.
- Farey sequences and Ford circles Solid
- Why do neighbouring fractions in a Farey sequence satisfy bc − ad = 1, and how do Ford circles turn this into geometry? A number-theory result with a striking geometric picture: two representations you can connect in one argument.
- Counting partitions with generating functions Ambitious
- How do generating functions prove that the number of partitions of n into odd parts equals the number into distinct parts? A surprising identity with two proofs (algebraic and a bijection), letting you compare methods in the discussion.
- How long is the repeating block of 1/n? Accessible
- What determines the length of the repeating block in the decimal expansion of 1/n, and for which primes is it as long as possible? Starts from a calculator observation and leads to orders modulo n and primitive roots: real number theory from a simple question.
- The Chinese remainder theorem and calendar cycles Accessible
- How does the Chinese remainder theorem explain when calendar cycles of different lengths coincide, and how can solutions be constructed efficiently? A theorem with a constructive proof that you can apply to a context you choose, and an algorithm to evaluate.
- Best rational approximations to π Solid
- Why are the convergents of a continued fraction the best rational approximations to a real number, and what does this say about approximations such as 22/7 and 355/113? A precise notion of 'best' that you can define, prove and test numerically.
Frequently asked questions
Is number theory a good area for a maths EE?
It can be, if you narrow it to one question you can answer with mathematics you understand. Make sure there is something to prove or analyse, not just a pattern to admire. A good number-theory EE states a conjecture from examples and then explains why it is true (or finds where it fails).
Can I use one of these research questions as it is?
Use it as a starting point. Change the case, the comparison or the limit until the question is your own, and agree it with your supervisor.
Other areas: Algebra · Analysis & calculus · Geometry · Probability · Statistics · Modelling · Graph theory · Codes & algorithms · Optimisation & games · History of maths