pgcd.py

Created on April 13, 2023

300 Bytes

Computes and prints each step of the Euclidea Algorithm.

from math import floor

def fmt(s, *a):
  return s.format(*a)

def pgcd(a, b):
  if a<b:
    r=a
    a=b
    b=r
  r=a%b
  q=floor(a/b)
  print(fmt("{} = {} ({}) + {}",a,q,b,r))
  while r>0:
    a=b
    b=r
    r=a%b
    q=floor(a/b)
    print(fmt("{} = {} ({}) + {}",a,q,b,r))
  return b

During your visit to our site, NumWorks needs to install "cookies" or use other technologies to collect data about you in order to:

Ensure the proper functioning of the site (essential cookies); and
Track your browsing to send you personalized communications if you have created a professional account on the site and can be contacted (audience measurement cookies).

With the exception of Cookies essential to the operation of the site, NumWorks leaves you the choice: you can accept Cookies for audience measurement by clicking on the "Accept and continue" button, or refuse these Cookies by clicking on the "Continue without accepting" button or by continuing your browsing. You can update your choice at any time by clicking on the link "Manage my cookies" at the bottom of the page. For more information, please consult our cookies policy.

Accept and continue Continue without accepting