Post Reply 
(11C) GCD and LCM
01-07-2018, 08:26 AM
Post: #4
RE: (11C) Least Common Multiple <> GCD
it is because I use the rule gcd(a,b)=gcd(b,a mod b) which decreases faster than gcd(a,b)=gcd(b,a-b).
Unfortunatly, there is no modulo function on the hp11, so extra steps are needed.
Find all posts by this user
Quote this message in a reply
Post Reply 


Messages In This Thread
(11C) GCD and LCM - Gamo - 01-06-2018, 12:59 PM
RE: (11C) Least Common Multiple <> GCD - wawa - 01-07-2018 08:26 AM



User(s) browsing this thread: 1 Guest(s)