Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A cyclist's wheel has a circumference of mm and a measuring wheel has a circumference of mm. A technician rolls one wheel forwards and the other backwards, each a whole number of turns. She wants the shortest positive distance that the two can differ by.
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. The algorithm.
So .
Step 2. Back substitution. . Then gives . Then gives . Finally gives
Step 3. All solutions. If , then , and the other solutions are , . The smallest positive is .
Check. and . The difference is .
Answer: the HCF is ; and .
Log in to join the discussion.
Loading…