The Extended GCD

This page computes the greatest common divisor of a and b and expresses it in the form a s + b t for some integers s and t. For details on how this is computed, go to http://faculty.uml.edu/klevasseur/math/gcd/

  • a =:
  • b = :



_



Ken Levasseur
Mathematical Sciences
UMass Lowell
Kenneth_Levasseur@uml.edu
Ken's WebMathematica Scripts

Script generated by MSPWizard.nb