What is Greatest common divisor?
The greatest common divisor of two or more integers is the largest integer that divides all of them without remainder. Euclid’s algorithm computes it efficiently.
4 tools that work with Greatest common divisor
Files never leave your browser.
Related terms
Terms that appear alongside Greatest common divisor on the same tools.