Learn the idea. Try it yourself.
Read the explanation or try 6 questions with hints. Free, untimed and no sign-in needed.
All lessons · Ireland’s Olympiad route
Your goal: decide which integer targets can be reached, construct a legal route when one exists, and explain why your reverse search is complete.
Preparation context: a bridge from IrMO enrichment to written-final reasoning. This is targeted original study, not a Round 1 mock, a complete IrMO syllabus or a prediction of a contest score. Later problems require full proofs as well as numerical conclusions.
Before you start: exact integer arithmetic, odd and even numbers, solving simple equations and writing a proof. Example 4 explains the common-divisor fact it needs; use greatest common divisors if that language is new. For Problem 7, review induction and whole-number powers.
Use three sessions rather than rushing the whole page: first the diagnostic and Examples 1–2; then Examples 3–4 and Problems 1–6; finally Problems 7–9 and an independent written explanation. Allow about 25–40 minutes per session, with extra time for proofs.
Three checks before reversing a move
Try these on paper. This diagnostic is unsaved and is separate from the adaptive session.
- A positive integer x is changed to 4x + 1. The result is 29. Recover x and check it.
- For an odd positive integer y, are both and always positive odd integers? Test y = 5.
- Can a strictly decreasing sequence of positive integers continue forever? Explain the role of the word “integer”.
Explained answers and a repair route
- Undo addition first: 4x = 28, so x = 7. Checking gives . If you divided 29 before subtracting 1, revisit simple equation solving.
- No. For y = 5 the candidates are 2 and 1; only 1 is odd. For y = 1 the candidates are 0 and −1, neither positive. An algebraic candidate must satisfy the state restrictions. Revisit parity if necessary.
- No. Each strict decrease between integers lowers the value by at least 1. Starting at a positive integer S therefore allows at most S − 1 strict decreases while staying positive. The values are positive and decreasing forever, but they are not all integers. If that distinction is unclear, review domains and mathematical statements.
Ask what the last move could have been
Forward play often branches: after every move there may be several choices, and the numbers grow quickly. A fixed target can be easier to analyse. Instead of asking “What can I do next?”, ask “What previous state could legally have produced this one?”
state is all the information a move needs: one integer or an ordered pair, for example. A predecessor is a state that can reach the current one in one legal forward move. Working backwards is a way to discover a forward construction; it does not add new moves to the original game.
Reverse the order, not just the signs
If a programme first adds 2 and then multiplies by 3, its inverse first divides by 3 and then subtracts 2. Undo the most recent operation before earlier ones. For a rule , solving gives . That formula is only a candidate predecessor until you check the domain.
Three tests for a proposed inverse
- Correct formula: does the forward move send your candidate back to the target?
- Valid state: is the candidate an integer of the required sign, with all coordinates in the stated domain?
- Allowed input: did the original move have an extra condition, such as an even input or a minimum size? Check it at the candidate.
For a target y reached by , the value y/3 must be an integer. If that forward move was allowed only for even x, the candidate y/3 must also be even. The target being an integer does not settle either condition.
Separate an obstruction from a construction
An invariant is a property unchanged by every legal move. If the start is odd and all reachable states remain odd, an even target is impossible. But an odd target might still have no legal predecessor leading to the start. A necessary condition says what every reachable target must satisfy. A sufficient argument gives a route, or proves that a route always exists for every target satisfying a stated condition.
A single reverse route ending at the start proves possibility once every arrow is checked and the list is read forwards. A failed reverse route proves impossibility only if no untested predecessor branch remains. These two endings will matter in every example.
Four connected worked examples
Example 1 · A fixed programme
A positive integer x is replaced by 3x + 2; the result is doubled; then 5 is subtracted. The final value is 41. Find x.
- The last subtraction is undone first: immediately before it the value was 41 + 5 = 46.
- Undo doubling: the preceding value was .
- Now solve . Subtracting 2 and dividing by 3 gives x = 7.
- Check forwards: 7 → 23 → 46 → 41. The recovered start is a positive integer, and each step matches the given order. All three inverse steps were forced, so the answer is unique.
Your turn 1 · What if the final value is 39?
Use the same programme with a positive integer start. Decide whether 39 can occur.
Hint 1
Undo subtraction and doubling before solving the first equation.
Hint 2
The intermediate value would be 22, so .
Complete solution
Reversing gives 39 → 44 → 22. Then , which is not an integer. Because the inverse steps are forced, no positive integer start gives 39. A positive rational answer would belong to a different problem.
Example 2 · Construct every admissible target
Start at 1. Each move replaces x by either 2x + 1 or 2x + 3. Prove that the reachable values are exactly the positive odd integers. Allow zero moves.
- First find the necessary condition. The initial value is odd. Either move gives an odd output, so every reachable value is a positive odd integer.
- Now take any positive odd target y greater than 1. Its candidate predecessors are and . They are consecutive integers, so exactly one is odd.
- If y leaves remainder 3 on division by 4, write with . Choose . This is positive, odd and smaller than y. Its forward move 2x + 1 returns to y.
- If y leaves remainder 1 on division by 4, then y > 1 forces with . Choose . It too is positive, odd and smaller than y, and the move 2x + 3 returns to y.
- Repeat with the chosen smaller positive odd number. The values cannot decrease forever because they are positive integers. The process cannot stop at an odd value greater than 1, because one of the two cases always supplies a smaller valid predecessor. It therefore reaches 1.
- Reverse the finite list. Every reversed arrow is an allowed forward move, so it constructs the target. The target 1 itself needs zero moves. Necessity and sufficiency together give the complete classification.
Notice the extra information used in choosing a predecessor: it must be odd because it lies on a route from 1. The formula alone gave two candidates, but the invariant left exactly one possible route.
Your turn 2 · Construct 19
Use the same two moves from 1. Find the route to 19 and explain why it is forced.
Hint 1
At each reverse step keep the odd candidate.
Hint 2
The backward list begins 19 → 9 → 3.
Complete solution
The forced backward list is 19 → 9 → 3 → 1. Reversing gives 1 → 3 → 9 → 19, using 2x + 1, then 2x + 3, then 2x + 1. At each stage the other candidate is even and could not occur on a route from 1. Thus the route is unique.
Example 3 · One failed branch is not a proof
Start at 1. The allowed moves on positive integers are A: and B: . Can 25 be reached?
- The last move could be A, giving predecessor , or B, giving predecessor . Both are valid positive integers, so both branches must be considered if we want to prove impossibility.
- The branch through 8 fails: its candidates are and , neither an integer. This does not dispose of the branch through 11.
- From 11, undo B to get 4; from 4, undo A to get 1. Therefore 1 → 4 → 11 → 25 is a valid route, using A, B, B.
- One successful checked branch is enough to prove possibility. For impossibility, every branch would have to fail. Here both forward moves increase a positive integer, so every valid predecessor is smaller; any backward branch must eventually stop.
Your turn 3 · Reach 34
Use the same A and B from 1 to reach 34. Give a checked route.
Hint 1
Which last move has a positive integer predecessor?
Hint 2
Undo A to get 11, then reuse the route to 11.
Complete solution
Since , a route to 11 extends to 34. The sequence 1 → 4 → 11 → 34 uses A, B, A. The candidate obtained by undoing B from 34 is , not an integer. The construction proves reachability without needing to explore any invalid branch.
Example 4 · Subtraction constructs a pair
A state is an ordered pair of positive integers. Start at (1,1), and allow L: and R: . Prove that a target (u,v) is reachable exactly when its greatest common divisor is 1.
The greatest common divisor is the largest positive integer dividing both coordinates. To use it here, we need more than a remembered rule: we must check why a move preserves the common divisors.
- If d divides a and b, it divides a + b and b. Conversely, if d divides a + b and b, it divides their difference a. So L preserves the set of common divisors, and hence their greatest member. The argument for R is the same with the coordinates exchanged. Since the initial greatest common divisor is 1, any reachable pair must have greatest common divisor 1.
- Now suppose (u,v) has greatest common divisor 1. If its coordinates are unequal, subtract the smaller from the larger. The result remains a pair of positive integers. It is a valid inverse of L or R and preserves all common divisors by the same difference argument.
- The sum of the two coordinates is a positive integer and decreases by at least 1 at each reverse step. Thus only finitely many steps are possible. We can continue whenever the coordinates are unequal, so the process must stop with equal coordinates, say (d,d).
- The greatest common divisor at that endpoint is d, and it has stayed 1 throughout. Therefore the endpoint is (1,1).
- Reverse this finite subtraction list. Each arrow is a permitted addition, giving a route from (1,1) to (u,v). The already-equal target (1,1) uses zero moves. This proves sufficiency as well as necessity.
For instance, (8,13) reverses through (8,5), (3,5), (3,2), (1,2), (1,1). Reading upwards gives a five-move construction. The proof above covers every coprime positive target, not just this example.
Your turn 4 · A different common divisor
Can (9,15) be reached from (1,1) under L and R? Can it be reached from (3,3)? Explain both answers.
Hint 1
Compare the greatest common divisors before constructing anything.
Hint 2
For the second start, reverse (9,15) through (9,6) and (3,6).
Complete solution
The target has greatest common divisor 3, so it is impossible from (1,1), whose greatest common divisor is 1. From (3,3), the route (3,3) → (3,6) → (9,6) → (9,15) is legal. The invariant rules out the first start; the route proves that the second works.
Why descent stops, and what stopping proves
Choose a decreasing integer measure. For a scalar game it may be the current value. For a pair it may be the sum of the coordinates. Prove that each chosen inverse step keeps the state valid and decreases that measure. If it stays positive, there cannot be infinitely many such steps.
Termination alone is not enough. A process might stop at a dead end different from the required start, as 8 did in Example 3. You must separately identify every possible stopping state. Example 2 could continue at every positive odd value above 1. Example 4 could continue at every unequal pair, and its invariant identified the final equal pair.
This is a constructive use of descent. It is related to choosing a smallest object and strong induction, but here the purpose is to recover an explicit legal route and show that the inverse choices are complete.
Bridge to counting moves
After one move in Example 2, the possible values are 3 and 5. After two they are 7, 9, 11 and 13. The important observation is not just that the endpoints grow: the two output lists fit between one another without leaving an odd gap. Problem 7 asks you to prove that pattern for every number of moves.
For the pair game, a different fact controls length. A forward addition makes the changed coordinate larger than the unchanged positive coordinate. Thus the larger coordinate in a noninitial target identifies its last move. Problem 8 turns this forced predecessor into a proof of the least move count.
Bridge to a changed rule
Do not carry a reachability theorem into a different game without rechecking it. If the new moves add twice the other coordinate, namely or , undoing the first requires ; undoing the second requires . These stricter conditions create new dead ends. Problem 9 asks whether the old invariants still tell the whole story.
Mistakes to catch while writing
- Undoing operations in their original order instead of the reverse order.
- Keeping a fractional, zero or negative predecessor when the problem requires positive integers.
- Checking the output rather than the input of a restricted forward move.
- Calling a target impossible after testing only one of several valid predecessor branches.
- Treating matching parity or greatest common divisor as a construction without proving sufficiency for this exact game.
- Saying “it gets smaller” without naming a positive integer measure or proving that every chosen move decreases it.
- Stopping at any dead end and assuming it must be the initial state.
- Claiming a route is shortest merely because you found it quickly.
Practise the decisions, then write the proof
This adaptive session draws six questions from the nine objective checks matching the written problems below. It checks a selected conclusion or method, not an arbitrary written proof. Work on paper first and use the written solutions and rubric to review your reasoning.
Choose Start with the basics, or Check my starting point if the method is familiar. After six responses, choose See my session summary and Review all 6 answers and explanations. A requested solution counts as a response, so completion does not mean six independent correct answers or mastery. Retry one original paper problem after closing the explanation.
Interactive practice loads here. You can also use the complete question set below.
Nine original written problems
Problems 1–3 check valid inverses. Problems 4–6 require complete reachability arguments. Problems 7–9 develop a general classification, a minimum-length proof and a changed-rule test. The hints progress from a useful observation to a method. A full written answer remains necessary even if you correctly select its adaptive answer.
1. Undo a fixed programme
Foundation
An unknown positive integer n is increased by 4. The result is multiplied by 3, then divided by 2; this last move is allowed only if its input is even. The final value is 27. Find n and verify every forward step.
Hint 1
Undo the last move first. What number was divided by 2?
Hint 2
After recovering that number, undo multiplication by 3 and only then subtract 4.
Complete solution and proof check
- The input to the final division was . It is even, so that division is permitted.
- The preceding value was . Before the first addition, .
- Checking forwards gives 14 → 18 → 54 → 27. All values are positive integers and the only restricted move has an even input. Each inverse step was forced, so no other starting value works.
Answer: 14
Check your written reasoning:
- Undo the operations in reverse order.
- Check integrality and the even-input condition.
- Verify the complete forward route and uniqueness.
2. Choose the predecessor that could occur
Foundation
Start at 1. The only moves are A: and B: . Find a route to 47 and prove that it is the only route. All states must be positive integers; zero moves are allowed.
Hint 1
Which parity does every state in this game have? Test both possible predecessors of 47.
Hint 2
At each step keep the positive odd predecessor. Continue until you reach 1, then reverse your list.
Complete solution and proof check
- Every state is odd: the start is odd, and both moves give odd outputs. Thus a genuine predecessor must be a positive odd integer.
- For 47 the two algebraic candidates are 23 and 22; only 23 is odd. Repeating gives the forced backward list 47 → 23 → 11 → 5 → 1. The alternative candidates at the later steps are 10, 4 and 2, all even.
- Reverse the list: 1 → 5 → 11 → 23 → 47. The moves are B, A, A, A. Direct substitution checks each arrow.
- At every noninitial value the odd predecessor is unique. No route can begin with an earlier state below 1, and both forward moves strictly increase a positive state. Consequently the displayed four-move route is the only route.
Answer: The unique route has four moves: B, A, A, A.
Check your written reasoning:
- Establish that a predecessor must be odd and positive.
- Give and verify the forward route.
- Use the forced predecessor at every step to prove uniqueness.
3. Reverse the condition as well as the formula
Foundation
States are nonnegative integers. Move A replaces x by 3x, but A is allowed only when x is even. Move B replaces x by x + 5. Find every state from which one legal move reaches 21. No starting state is otherwise specified.
Hint 1
Solve each possible last-move equation separately.
Hint 2
The candidate for A must satisfy its condition before the move, not a condition on the output.
Complete solution and proof check
- If A was the last move, would force x = 7. However, 7 is odd, so A cannot legally be applied there. This candidate must be rejected.
- If B was the last move, gives x = 16. It is a nonnegative integer, and B has no additional restriction. The arrow 16 → 21 is legal.
- These are the only two permitted move types, so 16 is the complete list of one-move predecessors. We have not assumed that 16 must be reachable from some unstated initial state.
Answer: 16 only
Check your written reasoning:
- Consider both possible last moves.
- Reject 7 using the input condition on A.
- Check 16 and explain why the list is exhaustive.
4. A preserved property is only a first test
Core
Start at 2, and use only the move . Classify all values reachable after any nonnegative number of moves. Use your classification to decide whether 44 is reachable, even though both 2 and 44 are even.
Hint 1
Add 1 to both the current value and the next value. What simpler operation appears?
Hint 2
If , then the next y is five times the current y. Begin with y = 3.
Complete solution and proof check
- Write . After one forward move, the new shifted value is . The initial shifted value is 3.
- After k moves, , so , where k is an integer with . This follows by induction: it holds for zero moves, and each additional move multiplies y by 5.
- Conversely, performing the move exactly k times produces that value. Therefore the formula lists every reachable value and every listed value is attainable.
- For 44, the equation would be , or . The nonnegative powers begin 1, 5, 25 and then strictly increase, so none equals 15. Hence 44 is not reachable. Matching parity alone was not enough.
- A reverse check reaches the same conclusion: 44 would have to come from 8, which would have to come from . That is not an integer state, so the route stops before reaching 2.
Answer: Exactly for integers ; 44 is not reachable.
Check your written reasoning:
- Derive the shifted multiplication rule.
- Prove the formula and verify its converse.
- Reject 44 without treating matching parity as a construction.
5. Exhaust the backward branches
Core
Start at 1. The only moves on positive integers are A: and B: . Decide whether 31 is reachable. Give a complete argument that covers every possible last move.
Hint 1
List every positive integer predecessor of 31; there may be more than one.
Hint 2
The candidates are 10 and 14. Work backwards from each, rejecting noninteger and nonpositive candidates.
Complete solution and proof check
- If 31 is reached by A, its predecessor is 10. If it is reached by B, its predecessor is 14. These are the only possibilities.
- For 10, A would require predecessor 3, while B would require , which is not an integer. For 3, A would require and B would require 0. Neither is a positive integer. The branch through 10 therefore cannot reach the start 1.
- For 14, A would require and B would require . Neither is an integer, so this branch also fails.
- We tested both possible last moves at every branch. None ends at 1. Therefore 31 is unreachable. The value 31 is not the initial state, and both forward moves strictly increase positive states, so no route can avoid this final-predecessor analysis.
Answer: 31 is unreachable; both predecessor branches fail.
Check your written reasoning:
- List both predecessors of 31.
- Dispose of every branch with its exact domain failure.
- Conclude only after the complete branch analysis.
6. Find the correct equal starting pair
Core
A state is an ordered pair of positive integers. A move replaces (a,b) by either (a + b,b) or (a,a + b). From which of the starts (1,1), (2,2) and (3,3) can (14,22) be reached? Prove your answer and give a route whenever it is possible.
Hint 1
Adding one coordinate to the other does not change the common divisors of the pair.
Hint 2
The greatest common divisor of 14 and 22 is 2. Work backwards by subtracting the smaller coordinate from the larger.
Complete solution and proof check
- The common divisors of a and b are exactly the common divisors of a + b and b: a divisor of the latter pair also divides their difference a. The same statement holds for the other move. Thus the greatest common divisor is preserved.
- The target has greatest common divisor 2, because 14 and 22 have common divisor 2 and the reduced numbers 7 and 11 are coprime. The starts have greatest common divisors 1, 2 and 3 respectively. Only (2,2) can possibly work.
- A legal route is (2,2) → (4,2) → (6,2) → (6,8) → (14,8) → (14,22). Each arrow adds one current coordinate to the other. This verifies sufficiency for the remaining start.
- Therefore exactly (2,2) works. The preserved greatest common divisor ruled out two starts; the displayed route, not the invariant alone, proved that the third works.
Answer: Exactly (2,2)
Check your written reasoning:
- Prove preservation of common divisors.
- Exclude the two incompatible starts.
- Verify a construction from the compatible start.
7. Classify a whole depth of the construction
Stretch
Start at 1 with moves A: and B: . Prove that after exactly k moves the reachable values are precisely the odd integers from through , inclusive, for every integer . Deduce how many values occur and how many moves are needed to reach 101.
Hint 1
Check k = 0. If the old odd values are , compare the outputs of A and B in increasing order.
Hint 2
The outputs interleave: . Use this to prove that no odd value in the new interval is missed.
Complete solution and proof check
- For k = 0 only the initial value 1 occurs. The stated lower and upper endpoints both equal 1, so the claim is true.
- Assume that after k moves the values are all odd integers , with and .
- The two moves from L give 2L + 1 and 2L + 3. The moves from L + 2 give 2L + 5 and 2L + 7, and so on. Thus the outputs are precisely every odd integer from 2L + 1 through 2U + 3. This proves both that every displayed value is reached and that there are no others.
- Substitution gives and . These are the required endpoints for k + 1, so induction proves the claim for every .
- The number of odd values in the interval is . In particular, five moves give every odd value from 63 through 125, including 101.
- For completeness, the forced reverse list is 101 → 49 → 23 → 11 → 5 → 1. Its five arrows reverse to a legal construction, and the unique odd predecessor at each step proves that no different move count reaches 101.
Answer: There are values; 101 requires exactly five moves.
Check your written reasoning:
- Include the zero-move base case.
- Prove that the two output lists interleave without gaps.
- Calculate the endpoints and count, and justify the exact move count.
8. A construction that also proves minimality
Stretch
Start at (1,1). On positive integer pairs, the only moves are and . Find the least number of moves needed to reach (23,7). Explain why a different forward strategy cannot be shorter.
Hint 1
In a noninitial reachable pair, which coordinate was most recently changed?
Hint 2
Subtract the smaller coordinate from the larger until (1,1) is reached. Record each step; then explain why every predecessor was forced.
Complete solution and proof check
- If a move changes the first coordinate, that new coordinate is a + b and is strictly larger than the unchanged positive coordinate b. If it changes the second, the second is strictly larger. Consequently the larger coordinate of a target identifies its last move.
- The forced reverse list is (23,7) → (16,7) → (9,7) → (2,7) → (2,5) → (2,3) → (2,1) → (1,1). There are seven arrows, and every pair has positive integer coordinates.
- Reading the list backwards gives seven legal additions from (1,1) to (23,7). Thus seven moves are sufficient.
- At every noninitial pair the most recent move and its predecessor are uniquely determined. Any forward route to the target must therefore contain this entire list in reverse order. There are no optional extra loops: each forward move strictly increases the positive coordinate sum. Hence the route is unique and seven is the least possible number of moves.
Answer: 7 moves
Check your written reasoning:
- Identify the last move using the larger coordinate.
- Count and verify all seven inverse steps.
- Use forced predecessors to prove the lower bound, not just an example route.
9. When the old invariant stops being sufficient
Stretch
Start at (1,1), but change the moves to or , on positive integer pairs. Consider this backward procedure: if , replace (a,b) by ; if , replace it by ; otherwise stop. Prove that the target is reachable if and only if this procedure stops at (1,1). Use it to decide which of (3,5), (5,11), (5,7) and (7,9) are reachable, and explain why odd coordinates with greatest common divisor 1 do not suffice.
Hint 1
In a genuine forward move, the coordinate just changed becomes greater than twice the unchanged coordinate. What does this say about the last move?
Hint 2
Show that the reverse procedure has at most one choice, stays in positive integers and decreases the sum. Then reverse a successful list; test the four pairs.
Complete solution and proof check
- After changing the first coordinate, its new value a + 2b is greater than 2b because a is positive. After changing the second, its new value b + 2a is greater than 2a. Thus a target with can only have arisen by the first move, and its predecessor must be . The analogous statement holds when .
- Both inequalities cannot hold at once: and would imply , impossible for positive a. Each permitted subtraction leaves positive integer coordinates and decreases their sum by at least 2. Therefore the procedure is unambiguous and must terminate.
- If a target was reached by a forward sequence, the forced backward step must undo its final move, then the preceding move, and so on. It therefore returns to the initial pair (1,1). This includes the zero-move target (1,1).
- Conversely, if the backward procedure ends at (1,1), reverse its finite list. Each reversed arrow is one of the permitted additions, so it constructs a valid forward route. This proves the stated if-and-only-if criterion.
- For (5,11), the reverse list is (5,11) → (5,1) → (3,1) → (1,1), so it is reachable in three moves. For each of (3,5), (5,7) and (7,9), neither coordinate exceeds twice the other. The procedure stops immediately at a pair different from (1,1), so all three are unreachable.
- Both coordinates stay odd from (1,1), since adding twice an integer preserves parity. Common divisors also stay unchanged under adding twice the other coordinate. Nevertheless (3,5) has odd coordinates and greatest common divisor 1 and is unreachable. Those conditions are necessary, but the complete reverse procedure supplies the missing sufficiency test.
Answer: Exactly (5,11) among the four targets is reachable; the reverse procedure is a complete reachability test.
Check your written reasoning:
- Derive both strict inverse inequalities from positivity.
- Prove uniqueness of the reverse choice and termination.
- Prove both directions of the criterion, including zero moves.
- Apply the test and give the counterexample to sufficiency of the invariants.
A modest rubric for your written proof
Use this as a self-check, not an official IrMO marking scheme. For each relevant item write “shown”, “needs repair” or “not needed here”. Do not give yourself credit merely for having read the model.
- State and domain. I named the starting state, target, allowed moves, integer/sign restrictions and whether zero moves are allowed.
- Reverse legality. I derived each predecessor and checked the original input restrictions.
- Completeness. I covered every possible final move, or justified why one predecessor is forced.
- Progress and endpoint. I named a decreasing positive integer measure and proved what the process can stop at.
- Required conclusion. I supplied a checked construction for possibility, exhausted the relevant branches for impossibility, or proved both a bound and an attaining route for a minimum.
Exit check: say what your argument actually proves
Without looking back, explain why “the target has the correct parity” and “one backward branch gets stuck” each fail to prove reachability or impossibility by themselves. Then choose one solved written problem, close the solution and reproduce its deciding step. If you used a hint, mark it as prompted work and retry it on another day.
Return to a released IrMO or enrichment problem that involves a sequence of allowed changes. Write down its state space and every possible last move before searching forwards. Use Ireland’s official paper links to select the correct paper; during an active contest, follow the organiser’s rules on outside help.
For the next method, use invariants and colouring to find an obstruction, strong induction to formalise a smaller-target argument, or proof writing if your explanation skips a reason. Number notation is a separate topic in number bases and digits; the present lesson is about legal inverse paths.
Source and authorship: AI-assisted editorial teaching material prepared for IMOolympiad.com. The exposition, example data, diagrams and practice questions were independently written using standard mathematical ideas. The official enrichment information and the organiser-linked released-paper compendium informed the preparation context only. No official question is reproduced, translated or presented as one of these original exercises. No organiser affiliation or endorsement is claimed. Report a specific unclear step through the contact page.