(11C) Greatest Common Divisor

[Gamo]

Another great version from member name Csaba Tizedes mention:

There is a 15C version as per Marcus du Sautoy explanation (in TV show 'Secrets Of Modern Living: Algorithms')

Also work for HP-11C

Code:


LBL E
x=y     / there are the two numbers are equal?
RTN     / yes, stop here and the GCD on the display
x>y     / no, check there are the smaller number in x?
x<>y   / no, chsnge x and y
  -       / let's substract it
LSTx   / and get back the number of x
GTO E / and again until numbers are equal

Here is the link to this discussion: http://www.hpmuseum.org/forum/thread-652...l#pid77428

Gamo