LCM/GCD - LCM and GCD of two positive integers / HP-32sII

for the HP 32sII
LCM/GCD - Least common multiple and greatest common divisor of two positive integers

Usage

XEQ L

Input

REG Y: Positive integer
REG X: Positive integer

Output

REG Y: GCD (Greatest common divisor)
REG X: LCM (Least common multiple)

Resources used

VAR i: will be cleared to 0

Program list

LCMGCD - Rev.1.0 : Jan. 20 2012


L01 LBL L    CK=02E7 009.0
L02 STO i
L03 ENTER
L04 ENTER
L05 R↑
L06 STO× i
G01 LBL G    CK=CEA1 021.0
G02 ENTER
G03 R↓
G04 ÷
G05 IP
G06 R↑
G07 ×
G08 -
G09 x≠0?
G10 GTO G
G11 x<> i
G12 x<>y
G13 ÷
G14 RTN