Understanding Euclid’s Greatest Common Divisor Algorithm

Some quick notes on explaining how Euclid’s greatest common divisor algorithm works: if a=bq + r, and a=d(gq + h), where dg=b and dh=r, then d is a divisor of a, as well as of b and of r. So d|a and d|b and d|r. The recursion in the algorithm (here are the details) finds the greatest value of d satisfying d|a and d|b and d|r. I think.

internal tag: math

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: