Revision as of 14:37, 8 October 2002 edit AxelBoldt (talk \| contribs) Administrators 44,650 edits we already have an example; moving it up ← Previous edit		Revision as of 14:38, 8 October 2002 edit undo AxelBoldt (talk \| contribs) Administrators 44,650 edits No edit summary Next edit →
Line 5: # Let A be the greater number of A and B, and B the lesser. # ~~Let~~Replace A =by the difference A-B. # Repeat steps 1 and 2 until A and B are equal, this number will then be the greatest common divisor of the original numbers.

Algorithm: Difference between revisions