Threaded Mode | Linear Mode

Logan · (This post was last modified: 02-13-2018 10:00 PM by Logan.)

(07-12-2016 06:23 AM)Dieter Wrote: Also posted in the other GCD thread:
You can get it one step shorter (but with the same byte count):

Code:

LBL d STO Z MOD X≠0? GTO d + END

I tried to come up with my own method to do this (after reading about Euclid's Algorithm), and once I had did a search to see what others had come up with. I was proud to see that the one I'd come up with was identical to this with the exception that I swapped X<>Y at the end instead of the addition.