greatest common divisor
     n : the largest integer that divides without remainder into a
         set of integers [syn: greatest common factor, highest
         common factor]

	

	greatest common divisor
     
         (GCD) A function that returns the largest
        positive integer that both arguments are integer multiples
        of.
     
        See also Euclid's Algorithm.  Compare: lowest common
        multiple.
     
        (1999-11-02)