Greatest common divisor: Difference between revisions
Content deleted Content added
Logo, Euclidian algorithm |
Added TI-83 BASIC |
||
Line 374: | Line 374: | ||
((> a b) (gcd b (modulo a b))) |
((> a b) (gcd b (modulo a b))) |
||
(else (gcd a (modulo b a))))) |
(else (gcd a (modulo b a))))) |
||
=={{header|TI-83 BASIC}}== |
|||
gcd(A,B) |