What separates a Level 5 problem from a Level 7, side by side
6 October 2026
Students who ask what separates a Level 5 problem from a Level 7 usually expect the answer to be harder. It mostly is not. Two of the real IMO proofs on Lemma make the point better than any definition could. IMO 1964, Problem 2 and IMO 1995, Problem 2 are both inequalities in three variables, both rated 5 out of 6 for difficulty on their problem pages, and both expected to take under an hour. The ladder puts the first at Level 5 and the second at Level 7.
So the gap between the two levels is not effort or stamina. It is two specific things, and both are visible once the problems sit next to each other.
What the two levels are on the ladder
The levels are not difficulty bands invented for this page. They are the rungs Lemma teaches in order, and each technique page says where it unlocks.
- Level 5, Olympiad Initiate: "the proof-writing gateway". Induction, invariants and monovariants, without loss of generality, Diophantine equations, the power of a point, Ceva and Menelaus, double counting, symmetric sums.
- Level 6, Olympiad Veteran: games, functional equations, graphs, quadratic residues, Vieta jumping, the incircle configuration.
- Level 7, IMO Candidate: "the theorems that power shortlist problems". Orders and Fermat's little theorem, CRT and Euler, Wilson, Pell's equation, Cauchy–Schwarz beyond the AM–GM first steps of Level 4, convexity and Jensen, Burnside, directed angles, barycentric coordinates, and a lesson on managing a whole olympiad paper.
Read the two lists and the first difference is already there. Level 5 is a set of methods: ways of organising a proof that work on almost any topic. Level 7 is a set of theorems: specific results that are each the key to a particular family of problems, and useless outside it.
The inequality pair
Level 5. IMO 1964/2: if are the sides of a triangle, then Move everything to one side and expand. The difference is exactly which is Schur's expression. It is symmetric, so you may assume . Then the first two terms combine to , which is at least zero, and the last term is a product of two non-positive factors with , so it is at least zero too. Done, with equality only for the equilateral triangle.
Every move there is a Level 5 move: expand, notice symmetry, order the variables, check signs. The problem never asks you to see it as anything other than what it is. It even turns out the triangle condition is not needed: the inequality holds for any non-negative , which is the kind of thing you find by doing the algebra honestly.
Level 7. IMO 1995/2: if and , then Expand this and you drown. The problem does not yield until you change what it looks like. Put , , ; then still, and each term collapses to . Only now does a named theorem apply: Cauchy–Schwarz in Engel form gives a sum of at least , and AM–GM with gives . Equality at , where the sum is exactly .
That is the pattern. The Level 5 problem is solved by working on it as given. The Level 7 problem is solved by a chain of three moves, and the first one is a transformation the statement gives no hint of. Nothing in "" says take reciprocals. You have to have seen that a constraint like that is often an invitation to substitute.
The number theory pair
The same split shows up in number theory.
Level 5. Prove that has no solutions in positive integers. The 3 in the equation tells you where to look. Squares are 0 or 1 modulo 3, so is divisible by 3 only when both and are, and then a descent finishes it. Modular arithmetic is the first tool you would try, and the problem rewards the first try.
Level 7. IMO 1986, Problem 1: if is a positive integer other than 2, 5 and 13, show that some two distinct numbers from have not a perfect square. The modulus is not in the statement, and you have to earn it. First notice that the three pairs without all do give squares: , and . So the claim is really that , and cannot all be squares. If is an odd square, is odd. Then and are even squares, their difference forces a difference of two squares equal to , and a difference of squares is never 2 modulo 4.
None of those steps uses a theorem beyond Level 4. What makes it Level 7 is the setup: check the easy cases, negate the claim correctly (all three are squares, not one), extract the parity of , and only then find the congruence that bites. Four moves, and the problem hands you none of them.
So what actually separates them
Put the pairs together and three differences come out, in order of how often they decide the problem.
- The first move is hidden. A Level 5 problem tells you what kind of problem it is: "for every " points at induction, a process with moves points at an invariant, a 3 in the equation points at mod 3. A Level 7 problem usually needs a substitution or a reformulation before it looks like anything.
- The chain is longer. Level 5 proofs tend to be one idea carried through. Level 7 proofs are two or three ideas in sequence, and losing the thread in the middle is the most common way to lose the marks.
- The theorem is specific. Cauchy–Schwarz, orders, Jensen, CRT: each is the right tool for a narrow family and the wrong tool everywhere else. Knowing the statement is not enough; you need to recognise its shape after a transformation.
How to cross the gap
Do not jump to Level 7 problems and hope. The methods at Level 5 are what the Level 7 chains are made of: the reciprocal substitution only helps because you can then expand, order and sign-check without thinking.
What helps is practising the hidden first move on purpose. When you finish a Level 7 problem, write down only the first line, the substitution or reformulation, and ask what in the statement should have suggested it. " with cubes in the denominators" is a signal you can learn; "the modulus is not given, so find a parity fact first" is another. After a dozen of those, the first move stops being hidden.
If you are not sure which rung you are on, the free Find Your Level quiz places you in a few minutes. The problem archive carries every statement above in full with its difficulty and expected time, and the technique index shows where each method unlocks on the ladder.
Related guides
- gcd(2^m − 1, 2^n − 1): the proof, and how to spot itWhy gcd(2^m − 1, 2^n − 1) = 2^gcd(m,n) − 1: run Euclid's algorithm on the exponents. A full proof, a second proof by orders, and where it turns up.
- Nesbitt's inequality: three proofs and how to spot it in disguiseNesbitt's inequality takes two lines to prove once you know it. The skill is seeing it inside a harder problem, and choosing which of three proofs to use.
- How to build a problem-solving notebook that actually worksMost problem notebooks are copied solutions nobody reopens. Index yours by the clue in the statement, not by topic, and test it from the clue side.
- Number theory problems that look like algebra, and how to tellAn equation, a fraction, a polynomial: it reads like algebra, but the word integer changes the method. Five signals, and the three moves that follow.
Train it on Lemma
Every technique here is taught explicitly, in order. 125 lessons, 1206 curated problems and unlimited generated practice at six difficulties. Free to start, no card, and every paid plan opens with 3 free days.
Find your level