No replies to this topic

[Tritonio]

?➝A:
?➝B:
Lbl 1:
A÷B➝C:
Fix 0:
Rnd(C-0.5)➝D:
Rnd((C-D)×B)➝M:
Norm 2:
M=0⇒Goto 2:
B➝A:
M➝B:
Goto 1:
Lbl 2:
B

The fastest algorithm for greatest common divisor calculation. Pretty annoying that this calculator doesn't have Intg() and Mod(). But you can at least emulate them with code.