Learn the idea. Try it yourself.
Read the explanation or try 6 questions with hints. Free, untimed and no sign-in needed.
All lessons · Kazakhstan study route
Your goal: Replace a pair of positive integers by their common scale and a coprime pair. Use the remaining conditions to find all possible pairs, then prove that every pair you list works.
Preparation context: This original topic lesson is a bridge to written number-theory reasoning for Kazakhstan’s Grade 9 Republican Olympiad preparation. The official released 2022–23 district paper includes GCD reasoning; that historical paper calibrates the mathematical skill, not a current school-stage format. This is neither an official paper nor a prediction of an exam question. The school, district, regional and national stages have separate instructions.
Plan: Use one 25–35 minute sitting for the common-scale method and Examples 1–2, then another for Examples 3–4 and transfer practice. Leave time to write the final proof problem independently. You need divisibility, prime factorisation and simple equations. Revisit greatest common divisor and Bézout or divisibility if the diagnostic is difficult.
Start with three small checks
Here gcd(a, b) means the greatest positive integer dividing both a and b. Two positive integers are coprime when their GCD is 1; they need not both be prime. Unless a problem says otherwise, every variable in this lesson is a positive integer.
Check 1. Remove the whole common factor
Find gcd(42, 70). Divide both numbers by this GCD and check the GCD of the two quotients.
Complete solution
We have 42 = 2 × 3 × 7 and 70 = 2 × 5 × 7. Their common prime factors give gcd(42, 70) = 14. The quotients are 42 ÷ 14 = 3 and 70 ÷ 14 = 5. They have no common prime factor, so gcd(3, 5) = 1.
Check 2. Coprime does not mean prime
Which of the pairs (6, 35) and (6, 15) is coprime? Explain.
Complete solution
The prime factors of 6 are 2 and 3, while those of 35 are 5 and 7. Thus gcd(6, 35) = 1, although both numbers are composite. The second pair has the common factor 3, and gcd(6, 15) = 3. Therefore only (6, 35) is coprime.
Check 3. A common divisor constrains a sum
If 8 divides both a and b, must 8 divide a + b? Could a + b equal 100?
Complete solution
Write a = 8r and b = 8s for integers r and s. Then a + b = 8(r + s), so 8 divides the sum. But 100 = 8 × 12 + 4 is not divisible by 8. Hence a + b cannot equal 100.
The common scale and the reduced pair
If g = gcd(a, b), both a and b are multiples of g. Put a = gu and b = gv. The letters u and v name the positive integer quotients. The extra statement gcd(u, v) = 1 is essential.
Why are the quotients coprime? If an integer c > 1 divided both u and v, then gc would divide both gu and gv. Since gc > g, that would contradict the fact that g is their greatest common divisor. Removing only some common factor is not enough: dividing 42 and 70 by 7 gives 6 and 10, which still share a factor 2.
Why does the reverse direction work? Suppose u and v are coprime. In their prime factorisations, no prime occurs in both. Multiplying both by g supplies exactly the shared prime factors of g, and no additional shared prime factor. Therefore gcd(gu, gv) = g. More generally, the same prime-exponent argument gives gcd(gu, gv) = g gcd(u, v): for each prime, the common exponent is the exponent in g plus the smaller of the exponents in u and v.
Thus the original condition gcd(a, b) = g is equivalent to a = gu, b = gv with gcd(u, v) = 1. Equivalent means that both directions have been proved. This is a parametrisation: a description of all the pairs using suitable parameters g, u and v.
Keep the conditions next to the substitution:
- g, u and v are positive integers.
- gcd(u, v) = 1.
- If a ≤ b, then u ≤ v. If a > b, then u > v.
- A sum a + b = S becomes g(u + v) = S.
- A product ab = P becomes g²uv = P. The square on g comes from multiplying gu by gv.
Four connected worked examples
Example 1. A fixed GCD and a fixed sum
Find all positive integer pairs (a, b) with a ≤ b, gcd(a, b) = 6 and a + b = 66.
Choose the representation. The GCD is specified, so write a = 6u and b = 6v, where u ≤ v and gcd(u, v) = 1. The sum becomes 6(u + v) = 66, hence u + v = 11.
Make the search finite. Since u ≤ v and u + v = 11, the smaller number u is at most 5. The positive possibilities are (u, v) = (1, 10), (2, 9), (3, 8), (4, 7), (5, 6).
Check coprimality without guessing. A number divides both u and 11 − u exactly when it divides both u and 11: adding the first two numbers gives 11, and subtracting u from 11 gives 11 − u. Therefore gcd(u, 11 − u) = gcd(u, 11). Since 11 is prime and 1 ≤ u ≤ 5, each of these GCDs is 1.
Scale back and verify. Multiplying both entries by 6 gives (6, 60), (12, 54), (18, 48), (24, 42), (30, 36). Each sum is 66 and each reduced pair is coprime, so each original GCD is exactly 6. The bound on u and the complete list from 1 to 5 rule out all other pairs.
Your turn 1. Now the reduced sum is composite
Find all positive integer pairs (a, b) with a ≤ b, gcd(a, b) = 5 and a + b = 60.
Hint 1
Reduce by the specified GCD before listing pairs.
Hint 2
The reduced sum is 12. Test gcd(u,12) for 1 ≤ u ≤ 6.
Complete solution
Write a = 5u and b = 5v with u ≤ v and gcd(u, v) = 1. Then u + v = 12 and 1 ≤ u ≤ 6. As in Example 1, gcd(u, 12 − u) = gcd(u, 12). Among 1, 2, 3, 4, 5, 6, only 1 and 5 are coprime to 12. Thus the reduced pairs are (1, 11) and (5, 7), giving (a, b) = (5, 55) or (25, 35). Both have sum 60 and GCD 5. Unlike the prime reduced sum 11, the composite reduced sum 12 excludes several candidates.
A bridge from sums to products
When u and v are coprime and uv is known, each prime belongs wholly to one factor. For example, if uv = 2 × 3² × 5, the two copies of the prime 3 cannot be split between u and v, because then both would be divisible by 3. Treat 2, 9 and 5 as three indivisible prime-power blocks. Assign each block to one side, then multiply the blocks on that side. Assigning no block to a side gives 1.
This is more precise than saying that u and v must be prime. They may be composite, provided they share no prime factor. It also explains the square case used later: if uv is a perfect square and u, v are coprime, every prime has an even exponent in whichever one of u or v contains it, so u and v are themselves perfect squares.
Example 2. A fixed GCD and a fixed product
Find all positive integer pairs (a, b) with a ≤ b, gcd(a, b) = 4 and ab = 1440.
Reduce. Put a = 4u and b = 4v, with u ≤ v and gcd(u, v) = 1. Since ab = (4u)(4v) = 16uv, we get uv = 1440 ÷ 16 = 90 = 2 × 3² × 5.
List every factor pair, then enforce the GCD. The positive factor pairs of 90 with smaller entry first are (1, 90), (2, 45), (3, 30), (5, 18), (6, 15), (9, 10). The pairs (3, 30) and (6, 15) share the prime 3 and must be removed. The four surviving pairs are (1, 90), (2, 45), (5, 18), (9, 10). Equivalently, these are the unordered assignments of the prime-power blocks 2, 9 and 5.
Return to the question. Multiplying each entry by 4 gives (4, 360), (8, 180), (20, 72), (36, 40). Each product is 16 × 90 = 1440. Each reduced pair is coprime, so the original GCD is exactly 4. The complete factor-pair list proves that no pair was missed.
If a least common multiple is given
The least common multiple lcm(a, b) is the smallest positive integer divisible by both a and b. For any positive a and b, gcd(a, b) × lcm(a, b) = ab. To see why, take any prime whose exponents in a and b are r and s. Its exponent in the GCD is min(r, s), and in the LCM it is max(r, s); together they add to r + s, its exponent in ab.
With a = gu, b = gv and gcd(u, v) = 1, this identity becomes lcm(a, b) = guv. Do not confuse this with ab = g²uv. Thus a specified GCD g and LCM L lead to the coprime product uv = L/g.
Your turn 2. Use the LCM bridge
Find all positive integer pairs (a, b) with a ≤ b, gcd(a, b) = 6 and lcm(a, b) = 210.
Hint 1
For coprime u and v, lcm(gu,gv) = guv.
Hint 2
Reduce to uv = 35, not to uv = 210 or uv = 210/36.
Complete solution
Write a = 6u and b = 6v with gcd(u, v) = 1 and u ≤ v. The LCM bridge gives 6uv = 210, so uv = 35. Its factor pairs (1, 35) and (5, 7) are both coprime. Therefore (a, b) = (6, 210) or (30, 42). The GCD of each pair is 6 and its LCM is 6 × 35 = 210. These are all the factor pairs of 35, so the answer is complete.
A bridge: the GCD of a sum and a difference
Let u > v be coprime positive integers, and put h = gcd(u + v, u − v). Because h divides both expressions, it divides their sum 2u and their difference 2v. By the scaling rule proved earlier, gcd(2u, 2v) = 2 gcd(u, v) = 2. Therefore h can only be 1 or 2.
If u and v are both odd, then u + v and u − v are both even. Their GCD is at least 2 and at most 2, so it is 2. If one is odd and the other even, the sum and difference are both odd; their GCD cannot be 2, so it is 1. The remaining possibility, both even, is forbidden by coprimality.
Consequently, for a = gu > b = gv with gcd(u, v) = 1, gcd(a + b, a − b) is 2g when u and v are both odd, and g otherwise. Test the parity of the reduced pair. If g is even, a and b can both be even even though u and v have different parities.
Example 3. A second GCD detects parity
Find all positive integer pairs (a, b) with a > b, gcd(a, b) = 5, a + b = 80 and gcd(a + b, a − b) = 10.
Translate both conditions. Write a = 5u and b = 5v with u > v and gcd(u, v) = 1. The sum gives u + v = 16. The second GCD is 2 × 5, so the sum-and-difference bridge requires u and v both to be odd.
List within a proved bound. Since v < u and u + v = 16, we have 1 ≤ v < 8. The odd candidates are v = 1, 3, 5, 7, yielding (u, v) = (15, 1), (13, 3), (11, 5), (9, 7). Every pair is coprime: gcd(v, 16 − v) = gcd(v, 16) = 1 for each of these odd v.
Scale back. We obtain (75, 5), (65, 15), (55, 25), (45, 35). Each sum is 80, each GCD is 5, and each reduced pair consists of two odd coprime numbers, so the second GCD is 10. Every positive v permitted by the bound and parity has been considered.
Your turn 3. Look at the quotients, not the original parity
Suppose a = 24 and b = 40. Find g = gcd(a, b), the reduced pair (u, v), and gcd(a + b, |a − b|). Explain using the reduced parities.
Hint 1
Remove gcd(24,40) first.
Hint 2
The reduced pair is (3,5); both entries are odd.
Complete solution
Here g = 8, u = 3 and v = 5. Although both original numbers are even, their coprime quotients are both odd. Thus the sum-and-difference GCD is 2g = 16. Directly, a + b = 64 and |a − b| = 16, whose GCD is indeed 16. The absolute-value bars mean the non-negative size of the difference; reversing the order of the two numbers does not change their GCD.
Example 4. When the GCD is itself part of an equation
Find all positive integers a > b satisfying gcd(a, b) = a − b and a + b = 63.
Name the unknown GCD. Put g = gcd(a, b), a = gu and b = gv, where u > v and gcd(u, v) = 1. The equation gcd(a, b) = a − b becomes g = g(u − v). Since g > 0, divide by g to get u − v = 1.
Describe all reduced pairs. Set v = t, so u = t + 1 for a positive integer t. Consecutive integers are coprime: any common divisor divides their difference 1. Thus there is no additional hidden GCD restriction. All pairs satisfying the first equation are a = g(t + 1), b = gt, with positive integers g and t. Conversely, every such pair has GCD g and difference g, so this description is both necessary and sufficient.
Impose the sum. We need g(2t + 1) = 63. Since t ≥ 1, the odd factor 2t + 1 must be an odd divisor of 63 greater than 1. Its possibilities are 3, 7, 9, 21, 63. The corresponding (g, t) are (21, 1), (9, 3), (7, 4), (3, 10), (1, 31).
Answer and completeness. These give (a, b) = (42, 21), (36, 27), (35, 28), (33, 30), (32, 31). Each sum is 63, and the parametrisation already verifies that its GCD equals its difference. The divisor 1 is excluded because it would give t = 0 and b = 0, outside the domain. Every permitted divisor has been used.
Choosing the method independently
Ask first which part of the problem concerns common factors. If a GCD is specified, remove it. If the GCD is unknown but occurs in an equation, name it g and remove it anyway. Then look at the surviving information: a sum suggests a bounded list; a product suggests factor pairs and prime-power blocks; a second GCD of sums and differences suggests parity; a difference equal to the GCD forces consecutive reduced integers.
For a condition such as a² − b² = M, reduction gives g²(u² − v²) = M. Now use u² − v² = (u − v)(u + v). This links the method to factorisation and integer solutions, but the coprimality condition must still be checked after recovering u and v. A factor pair alone need not give the required GCD.
Your turn 4. A parity obstruction
Can positive integers a > b satisfy gcd(a, b) = a − b and a + b = 32? Find all possibilities or prove that none exist.
Hint 1
Use the complete parametrisation from Example 4.
Hint 2
Which odd positive divisors does 32 have? The value 2t+1 must be greater than 1.
Complete solution
Example 4 gives a = g(t + 1), b = gt, where g and t are positive integers. The sum requires g(2t + 1) = 32. But 2t + 1 is an odd integer greater than 1, while the only odd positive divisor of 32 = 2⁵ is 1. Hence there are no such pairs. This is a divisibility obstruction, not a failure to find a pair by trial.
Common mistakes and their repairs
- Removing a common factor but forgetting “greatest”. Write gcd(u, v) = 1 explicitly. Otherwise your constructed pair may have a larger GCD than required.
- Replacing “coprime” with “prime”. The reduced pair (9, 10) is coprime and both numbers are composite.
- Losing a factor of g. A sum is multiplied by g, but a product is multiplied by g². Write (gu)(gv) before simplifying.
- Splitting one prime-power block across both factors. In a coprime product pair, the whole exponent of a prime belongs to one side.
- Counting both (a, b) and (b, a). Respect a ≤ b or a > b. If the question asks for ordered pairs without an order restriction, both orders may count separately.
- Checking the wrong parity. For gcd(a + b, a − b), inspect a/g and b/g, not merely a and b.
- Finding candidates and stopping. Check the original GCD, every extra condition and the domain. Then explain why the list exhausts all possibilities.
- Claiming that examples prove a general formula. A table is useful for discovery; a divisibility or prime-exponent argument establishes the formula for every permitted pair.
Nine original written problems
Problems 1–3 build fluency. Problems 4–7 change or combine conditions. Problems 8–9 ask for a complete argument. Try the problem first, then open Hint 1 before Hint 2. Write your proof before opening the solution.
Foundation 1. Recover the scale
For a = 84 and b = 126, find g = gcd(a, b) and the coprime pair (u, v) such that a = gu and b = gv. Explain why dividing both numbers by 21 would not finish the reduction.
Hint 1
Compare the common prime powers in 84 and 126.
Hint 2
84 = 2² × 3 × 7 and 126 = 2 × 3² × 7.
Complete solution
The shared prime powers give g = 2 × 3 × 7 = 42. Dividing by 42 yields (u, v) = (2, 3), whose GCD is 1. Dividing only by 21 would instead yield (4, 6), which still has common factor 2. Thus 21 is a common divisor but is not the greatest common divisor.
Foundation 2. A sum with exclusions
Find all positive integer pairs (a, b) with a ≤ b, gcd(a, b) = 3 and a + b = 42.
Hint 1
Remove the common scale 3.
Hint 2
Use u+v=14 and gcd(u,14)=1, with 1≤u≤7.
Complete solution
Write a = 3u, b = 3v, with u ≤ v and gcd(u, v) = 1. The sum gives u + v = 14, so 1 ≤ u ≤ 7. The condition gcd(u, 14 − u) = 1 is equivalent to gcd(u, 14) = 1. In this range the allowed u are 1, 3 and 5: the others are divisible by 2 or 7. Hence (u, v) = (1, 13), (3, 11), (5, 9), and (a, b) = (3, 39), (9, 33), (15, 27). Their sums are 42 and their reduced GCDs are 1, so all work. The complete bounded list proves completeness.
Foundation 3. A product with two possibilities
Find all positive integer pairs (a, b) with a ≤ b, gcd(a, b) = 6 and ab = 756.
Hint 1
The product of the reduced numbers is ab divided by 6².
Hint 2
Find the positive factor pairs of 21.
Complete solution
Put a = 6u and b = 6v with u ≤ v and gcd(u, v) = 1. Then 36uv = 756, so uv = 21. Its positive factor pairs with u ≤ v are (1, 21) and (3, 7), both coprime. Scaling gives (a, b) = (6, 126) or (18, 42). Each product is 756 and each GCD is 6. There are no further factor pairs of 21.
Transfer 4. Detect impossibility before a long search
Find all positive integer pairs (a, b) satisfying gcd(a, b) = 8 and a + b = 100.
Hint 1
Every common divisor of a and b divides their sum.
Hint 2
If a=8u and b=8v, the sum would be 8(u+v).
Complete solution
If gcd(a, b) = 8, write a = 8u and b = 8v with positive integer u and v. Then 100 = 8(u + v), so 8 would divide 100. But 100 leaves remainder 4 on division by 8. This contradiction proves that no such pair exists. Coprimality need not even be checked because the sum already fails a necessary condition.
Transfer 5. GCD and LCM together
Find all positive integer pairs (a, b) with a ≤ b, gcd(a, b) = 3 and lcm(a, b) = 420.
Hint 1
Use lcm(3u,3v)=3uv for coprime u,v.
Hint 2
The prime-power blocks in 140 are 4, 5 and 7.
Complete solution
Let a = 3u and b = 3v, with u ≤ v and gcd(u, v) = 1. The LCM condition gives 3uv = 420, hence uv = 140 = 2² × 5 × 7. The coprime factor pairs are (1, 140), (4, 35), (5, 28), (7, 20). For completeness, the other positive factor pairs are (2, 70) and (10, 14); both share a factor 2 and are rejected. Multiplying the surviving entries by 3 gives (3, 420), (12, 105), (15, 84), (21, 60). Each pair has GCD 3 and LCM 3 × 140 = 420. Both requirements have therefore been checked.
Transfer 6. Keep the GCD after factorisation
Find all positive integers a > b such that gcd(a, b) = 7 and a² − b² = 1029.
Hint 1
After a=7u and b=7v, factor u²−v².
Hint 2
Use (u−v)(u+v)=21. Recover u and v by adding and subtracting the two factors.
Complete solution
Write a = 7u and b = 7v, where u > v and gcd(u, v) = 1. Then 49(u² − v²) = 1029, so (u − v)(u + v) = 21. Both factors are positive, the first is smaller, and they have the same parity. The possible factor pairs are (1, 21) and (3, 7). From u − v = 1, u + v = 21 we get 2u = 22 and 2v = 20, so (u, v) = (11, 10). From 3 and 7 we get (u, v) = (5, 2). Both are coprime. Thus (a, b) = (77, 70) or (35, 14). Their squared differences are 49 × 21 = 1029 and their GCDs are 7. The complete factor list and the recovery formulas show there are no other pairs.
Transfer 7. A parity condition is not the whole test
Find all positive integers a > b such that gcd(a, b) = 4, a + b = 72 and gcd(a + b, a − b) = 8.
Hint 1
Reduce by 4. The two reduced integers must be odd, but they must also be coprime.
Hint 2
Write u + v = 18 with 1 ≤ v < 9. Test v = 1, 3, 5, 7 for gcd(v, 18) = 1.
Complete solution
Put a = 4u, b = 4v with u > v and gcd(u, v) = 1. The sum gives u + v = 18. The second GCD equals 2 × 4, so u and v must both be odd. Thus the smaller v is one of 1, 3, 5, 7. When v = 3, u = 15 and the pair is not coprime, so that case is rejected. The other reduced pairs are (17, 1), (13, 5), (11, 7). Consequently (a, b) = (68, 4), (52, 20), (44, 28). Each reduced pair is coprime and odd, which checks both GCD conditions, and each original sum is 72. This example shows why parity does not replace the coprimality check.
Proof 8. Describe every pair before using the sum
Find all positive integers a > b satisfying gcd(a, b) = a − b and a + b = 45. Your solution must explain why your list is complete.
Hint 1
First derive a=g(t+1), b=gt with g,t positive integers.
Hint 2
The factor 2t+1 is an odd divisor of 45 greater than 1.
Complete solution
Let g = gcd(a, b) and write a = gu, b = gv with u > v and gcd(u, v) = 1. The GCD equation gives g = g(u − v), hence u − v = 1. Therefore u = t + 1 and v = t for a positive integer t. Conversely, consecutive positive integers are coprime, so every pair a = g(t + 1), b = gt has GCD g and difference g.
The sum now requires g(2t + 1) = 45. The odd divisors of 45 greater than 1 are 3, 5, 9, 15, 45. These yield (g, t) = (15, 1), (9, 2), (5, 4), (3, 7), (1, 22). Hence the answer is (30, 15), (27, 18), (25, 20), (24, 21), (23, 22). Each comes from the proved parametrisation and has sum 45, so each works. Every solution must arise from one of these divisors. The omitted divisor 1 would force b = 0 and is excluded by positivity.
Proof 9. A square product after removing the GCD
Find all positive integer pairs (a, b) with a ≤ b, gcd(a, b) = 9, a + b = 153 and ab a perfect square. Explain why coprimality matters.
Hint 1
Put a=9u, b=9v. The reduced sum is 17 and the reduced product uv must be a square.
Hint 2
Prove that coprime factors of a square are each squares. Then solve r²+s²=17 with positive r≤s.
Complete solution
Write a = 9u, b = 9v with u ≤ v and gcd(u, v) = 1. The sum gives u + v = 17. Since ab = 81uv and 81 is a square, ab is a square exactly when uv is a square: in prime factorisations, multiplying by 81 changes every prime exponent by an even number.
Because u and v are coprime, a prime can occur in at most one of them. Its exponent in uv is even, so its exponent in the one factor containing it is even. Thus u = r² and v = s² for positive integers r ≤ s. We need r² + s² = 17. Since r ≤ s, 2r² ≤ 17, so r is 1 or 2. If r = 1, then s² = 16 and s = 4. If r = 2, then s² = 13, which lies strictly between 3² and 4² and is not a square. The sole reduced pair is (u, v) = (1, 16), which is coprime.
Therefore (a, b) = (9, 144). Its sum is 153, its GCD is 9, and its product is 1296 = 36². Both candidate values of r have been checked, so the answer is complete. Coprimality was essential to the square-factor argument: for instance, 3 × 12 = 36 is a square although neither 3 nor 12 is a square, because the prime 3 occurs in both factors.
A proof rubric for your own solution
This is a self-review checklist, not an official marking scheme and not automatic proof grading.
- Set-up: State positivity, order, g = gcd(a, b), and a = gu, b = gv with gcd(u, v) = 1.
- Reasoning: Transform each condition correctly. Explain a divisibility, prime-block or parity claim before using it.
- Completeness: Give a bound, an exhaustive factor list or a proved parametrisation. A few successful examples do not establish “all”.
- Sufficiency: Scale back and check the original GCD and every extra condition. Reject zero, negative, non-integer or non-coprime candidates where the domain requires it.
If you found a correct pair but no complete argument, start the repair with “Every solution must have…”. If you found a complete candidate list but forgot verification, add “Conversely, each listed pair satisfies…”. These two directions answer different parts of the problem.
Adaptive checks: choose and verify the next step
The practice below uses objective questions on reduction, sums, products, parity and completeness. It adjusts the question level using your responses and provides hints, explanations and links back to the relevant example. The written proofs above still need your own reasoning; the site does not automatically assess an arbitrary proof.
A completed session means six responses, including any requested solutions. It does not mean six independently correct answers or mastery. Revisit solution-assisted work later without the explanation. Practice is free and keeps the site’s existing privacy and optional local-progress choices; it does not ask you to submit a written proof or personal information.
Interactive practice loads here. You can also use the complete question set below.
Exit check and return to the paper
Explain aloud why removing the greatest common divisor leaves coprime quotients, why ab introduces g², and why a candidate factor pair still needs a GCD check. Then redo one problem that required a hint. Note privately whether the new attempt was independent or solution-assisted.
Return to Kazakhstan’s study and paper route · Repair a GCD prerequisite · Choose another lesson
Preparation sources and original material
The Daryn Republican Olympiad page provides official stage information and released-paper links. The official 2022–23 Grade 9 district paper is linked for level and skill context; it is a historical district paper, not a statement of the current school-stage format.
All teaching text, examples and practice questions here are original IMOolympiad.com material. No official question is reproduced, translated or numerically adapted. This independent educational site is not an organiser and does not claim affiliation or endorsement. Preparation context checked 29 October 2026.