HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /A cyclist's wheel has a circumference of 1547 mm and a measuring wheel has a circumference of 560…
HardMathematicsHigh School (11–12)Number TheoryNumericalOlympiad

A cyclist's wheel has a circumference of 1547 mm and a measuring wheel has a circumference of 560…

StemPy LabContributed by StemPy Lab

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 154715471547 mm and a measuring wheel has a circumference of 560560560 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.

  1. Use the Euclidean algorithm to find gcd⁡(1547,560)\gcd(1547, 560)gcd(1547,560).
  1. Work backwards to find integers xxx and yyy with 1547x+560y=gcd⁡(1547,560)1547x + 560y = \gcd(1547, 560)1547x+560y=gcd(1547,560).
  1. Give the smallest positive xxx that works, and the matching yyy.

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

Euclidean algorithm: gcd⁡(a,b)=gcd⁡(b,r)\gcd(a, b) = \gcd(b, r)gcd(a,b)=gcd(b,r) where a=bq+ra = bq + ra=bq+r. Bezout: ax+by=gcd⁡(a,b)ax + by = \gcd(a, b)ax+by=gcd(a,b) for some integers xxx, yyy, and ax+by=cax + by = cax+by=c is solvable exactly when gcd⁡(a,b)∣c\gcd(a, b) \mid cgcd(a,b)∣c.

The worked solution

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.

1547=560×2+4271547 = 560 \times 2 + 4271547=560×2+427

560=427×1+133560 = 427 \times 1 + 133560=427×1+133

427=133×3+28427 = 133 \times 3 + 28427=133×3+28

133=28×4+21133 = 28 \times 4 + 21133=28×4+21

28=21×1+728 = 21 \times 1 + 728=21×1+7

21=7×321 = 7 \times 321=7×3

So gcd⁡(1547,560)=7\gcd(1547, 560) = 7gcd(1547,560)=7.

Step 2. Back substitution. 7=28−21=28−(133−4×28)=5×28−1337 = 28 - 21 = 28 - (133 - 4 \times 28) = 5 \times 28 - 1337=28−21=28−(133−4×28)=5×28−133. Then 28=427−3×13328 = 427 - 3 \times 13328=427−3×133 gives 7=5×427−16×1337 = 5 \times 427 - 16 \times 1337=5×427−16×133. Then 133=560−427133 = 560 - 427133=560−427 gives 7=21×427−16×5607 = 21 \times 427 - 16 \times 5607=21×427−16×560. Finally 427=1547−2×560427 = 1547 - 2 \times 560427=1547−2×560 gives

7=21×1547−58×560.\displaystyle 7 = 21 \times 1547 - 58 \times 560.7=21×1547−58×560.

Step 3. All solutions. If 1547x+560y=71547x + 560y = 71547x+560y=7, then 221x+80y=1221x + 80y = 1221x+80y=1, and the other solutions are x=21+80tx = 21 + 80tx=21+80t, y=−58−221ty = -58 - 221ty=−58−221t. The smallest positive xxx is 212121.

Check. 21×1547=3248721 \times 1547 = 3248721×1547=32487 and 58×560=3248058 \times 560 = 3248058×560=32480. The difference is 777.

Answer: the HCF is 7 mm7\ \text{mm}7 mm; x=21x = 21x=21 and y=−58y = -58y=−58.

Log in to save this for later
← All Problems
← For two numbers, gcd · lcm equals the product…Numbers of the form 2ᵏ - 1 share factors in a neat way… →
More onNumber Theory

Discussion (0)

Log in to join the discussion.

Loading…

More on this topic

  1. The triangular numbers are 1, 3, 6, 10, …, where the nth one is (n(n + 1))/2…Advanced
  2. Prove that the equation x³ + y³ + z³ = n has no solution in integers when n leaves remainder 4 or 5…Advanced
  3. Find every triple of positive integers a ≤ b ≤ c with 1/a + 1/b + 1/c = 1, and prove that there are…Advanced
  4. Find all pairs of positive integers (x, y) with x² - y² = 945…Hard
  5. A teacher wants a list of every primitive Pythagorean triple whose hypotenuse is less than 100…Advanced
All problems on this topic →