RosettaCodeData/Task/Least-common-multiple/Quackery/least-common-multiple.quackery
2023-07-01 13:44:08 -04:00

8 lines
166 B
Text

[ [ dup while
tuck mod again ]
drop abs ] is gcd ( n n --> n )
[ 2dup and iff
[ 2dup gcd
/ * abs ]
else and ] is lcm ( n n --> n )