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. Python Labs
  2. /Euclid and Bezout by machine
MathematicsEasyHigh School (11–12)Number Theory

Euclid and Bezout by machine

You will write the Euclidean algorithm with a count of its divisions, the extended algorithm that finds Bezout's xxx and yyy, and a test for whether ax+by=cax + by = cax+by=c can be solved.

The idea. Replace the pair (a,b)(a, b)(a,b) by (b,r)(b, r)(b,r), where rrr is the remainder of aaa on division by bbb, until bbb is 000. The extended algorithm carries two numbers along so that each remainder stays a combination of the starting pair.

Your tasks.

  1. Finish hcf_steps(a, b). Return the pair (hcf, number of divisions).
  2. Finish bezout(a, b). Return (g, x, y) with a * x + b * y == g, where g is the HCF. A recursive version is short.
  3. Finish solvable(a, b, c). Return True when ax+by=cax + by = cax+by=c has a solution in integers.

Run it first, just as it is. The checker at the end prints FAIL for each task. Then do the tasks one at a time, and run the program again after each one. A Hint appears under every check that still fails.

When every line says PASS, use hcf_steps on consecutive Fibonacci numbers, such as (144, 89) and (233, 144). How many divisions does each pair need?

StemPy LabContributed by StemPy Lab
python
Loading Python runtime…

A worked solution

Run your code once to unlock the worked solution.

Have you tried it?

Do the tasks in the editor first, and run the checker after each one. Its hints help when a check fails. When you are ready, compare your code with this solution.

Log in to save
← All Labs
← Prime factorisation machineCounting and adding divisors →
More onNumber Theory

Discussion (0)

Log in to join the discussion.

Loading…

More labs on this topic

  1. Pythagorean triples by formula and by searchMedium
  2. Every solution of a linear equationMedium
  3. Orders, primitive roots and WilsonMedium
  4. Euler's totient two waysMedium
  5. A solver for the Chinese remainder theoremMedium
All labs on this topic →