PPT Slide

• Algorithm (Euclid ca 300BC)
  • set a and b to the values A and B respectively
  • repeat the folloving sequence of operations until b has value 0
    • let r take the value of a mod b
    • let a take the value of b
    • let b take the value of r
  • the greatest comon divisor of A and B is the final value of a

Previous slide

Next slide

Back to first slide

View graphic version