(42S) GCF
|
07-11-2016, 06:58 PM
(This post was last modified: 07-11-2016 07:11 PM by Dieter.)
Post: #7
|
|||
|
|||
RE: HP 42S: GCF
(07-10-2016 04:41 AM)Gerald H Wrote: here's my short GCD programme. Fine – my fractions programs used virtually the same code, but with a final + instead of R↓ which works as a DROP here. ;-) FTR, here is an alternate GCD routine with a slightly shorter and thus faster loop. It can be used if Z does not have to be preserved: Code: 01 LBL 00 And finally a solution that returns both LCM and GCD (in Y resp. X): Code: 01 LBL"LCMGCD" This is HP41 code. HP42s users may imagine an additional "ST" in the stack related commands. ;-) Dieter |
|||
« Next Oldest | Next Newest »
|
Messages In This Thread |
RE: HP 42S: GCF - Werner - 07-10-2016, 07:21 AM
RE: HP 42S: GCF - Gerald H - 07-11-2016, 09:15 AM
RE: HP 42S: GCF - Guenter Schink - 07-10-2016, 08:41 PM
RE: HP 42S: GCF - Gerald H - 07-11-2016, 04:26 AM
RE: HP 42S: GCF - Werner - 07-11-2016, 10:01 AM
RE: HP 42S: GCF - Dieter - 07-11-2016 06:58 PM
RE: HP 42S: GCF - Gerald H - 07-12-2016, 04:46 AM
RE: HP 42S: GCF - Gerald H - 07-12-2016, 04:59 AM
|
User(s) browsing this thread: 1 Guest(s)