Schyper

COMPUTE THE GCD/HCF OF TWO NUMBERS

This program computes the greatest common divisor (gcd) of two numbers, a and b, using the Euclidean Algorithm. Generally, the gcd of two numbers a and b is denoted by gcd(a,b) or (a,b).

BIRTHDAY

Born:

Place:

INPUT
Compute
RESULT
Quod Erat Inveniendum
CAS COMMANDS
MAXIMA
(%i1) gcd(a,b);
PARI/GP
gp> gcd(a,b)
FUNCTIONS