`gcd`

of two numbers is the largest number that
divides exactly into both of them. e.g. `gcd(3,4)=1`

and `gcd(12,8)=4`

.
Read `http://en.wikipedia.org/wiki/Euclidean_algorithm`

.

s.danicic@gold.ac.uk

Sebastian Danicic BSc MSc PhD (Reader in Computer Science)

Dept of Computing, Goldsmiths, University of London, London SE14 6NW

Last updated 2010-12-29