Jump to content

Greatest common divisor: Difference between revisions

Added TI-83 BASIC
(Logo, Euclidian algorithm)
(Added TI-83 BASIC)
Line 374:
((> a b) (gcd b (modulo a b)))
(else (gcd a (modulo b a)))))
=={{header|TI-83 BASIC}}==
gcd(A,B)
Anonymous user
Cookies help us deliver our services. By using our services, you agree to our use of cookies.