Display program code

gcd.pl : Greatest Common Divisor
Computes greatest common divisor by Euclidean algorithm.

How to use:
For two or more positive integers (N1,N2,..), you enter gcd(N1), gcd(N2), ...
and get the greatest common divisor X as single remaining gcd(X).

Program: Change the code, then submit!

Console: Enter query or select example from below, then submit and wait for answer!

Select example query: 

WebCHR help - CHR Website - (c) Copyrights Martin Kaeser Uni Ulm 2007