meaning of greatest common divisor

1. greatest common divisor GCD A function that returns the largest positive integer that both arguments are integer multiples of. See also Euclids Algorithm. Compare: lowest common multiple.
2. the largest integer that divides without remainder into a set of integers

Related Words

greatest common divisor |

Developed & Maintained By Taraprasad.com