Sign in to follow this  
Followers 0

euclid extended euclid algorithm

1 post in this topic


can i prove by induction on b that , for all positive integers a and b such that a > b, the triple (d; s; t) returned

by EEgcd(a; b) indeed satises d = s a + t b. I donot have a clue how to prove this. How i should start?

Any help is appreciated

Share this post

Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
Sign in to follow this  
Followers 0

  • Recently Browsing   0 members

    No registered users viewing this page.