Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Euclidean algorithm: where . Bezout: for some integers , , and is solvable exactly when .
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. Part (a). . Any common divisor divides , so the HCF is and the fraction is in lowest terms.
Step 2. Part (b). . A common divisor divides , a prime. So the only possible common factor above is .
Step 3. When it happens. Try : is the multiple of , at . Then too. Adding to adds and , both multiples of . So the fraction cancels exactly when .
Step 4. Part (c). The numbers are for to , so numbers.
Answer: the first fraction never cancels; the second cancels only by , for values of from to . Proof complete.
Source. Part (a) is the first problem of the first International Mathematical Olympiad (Romania, 1959).
Log in to join the discussion.
Loading…