This is an old revision of the document!

• The complete result of the calculation of the greatest common divisor of two numbers a and b:
  g=gcd(a,b)
  g=a*p+b*q
  a=g*k1
  b=g*k2
• The complete result of the calculation of the greatest common divisor of two numbers a and b:
  g=gcd(a,b)
  g=a*p+b*q
  a=g*k1
  b=g*k2
• The complete result of the calculation of the greatest common divisor of two numbers a and b:
  g=gcd(a,b)
  g=a*p+b*q
  a=g*k1
  b=g*k2
• The complete result of the calculation of the greatest common divisor of two numbers a and b:
  g=gcd(a,b)
  g=a*p+b*q
  a=g*k1
  b=g*k2
• The complete result of the calculation of the greatest common divisor of two numbers a and b:
  g=gcd(a,b)
  g=a*p+b*q
  a=g*k1
  b=g*k2
• The complete result of the calculation of the greatest common divisor of two numbers a and b:
  g=gcd(a,b)
  g=a*p+b*q
  a=g*k1
  b=g*k2
• The complete result of the calculation of the greatest common divisor of two numbers a and b:
  g=gcd(a,b)
  g=a*p+b*q
  a=g*k1
  b=g*k2
• The complete result of the calculation of the greatest common divisor of two numbers a and b:
  g=gcd(a,b)
  g=a*p+b*q
  a=g*k1
  b=g*k2

ExtGCD

• The complete result of the calculation of the greatest common divisor of two numbers a and b:
  g=gcd(a,b)
  g=a*p+b*q
  a=g*k1
  b=g*k2
• The complete result of the calculation of the greatest common divisor of two numbers a and b:
  g=gcd(a,b)
  g=a*p+b*q
  a=g*k1
  b=g*k2
• The complete result of the calculation of the greatest common divisor of two numbers a and b:
  g=gcd(a,b)
  g=a*p+b*q
  a=g*k1
  b=g*k2
• The complete result of the calculation of the greatest common divisor of two numbers a and b:
  g=gcd(a,b)
  g=a*p+b*q
  a=g*k1
  b=g*k2
• The complete result of the calculation of the greatest common divisor of two numbers a and b:
  g=gcd(a,b)
  g=a*p+b*q
  a=g*k1
  b=g*k2