greatest common divisor

Noun

 * 1)  The largest positive integer (respectively polynomial, element of a given ring) that is a divisor of each of a given set of integers (respectively polynomials, elements of a given ring).
 * 2) * 1974, John M. Peterson, Basic Concepts of Elementary Mathematics, Prindle, Weber & Schmidt, page 148,
 * Euclid's algorithm is a process for finding the greatest common divisor of any two whole numbers.
 * Euclid's algorithm is a process for finding the greatest common divisor of any two whole numbers.

Translations

 * Chinese:
 * Mandarin: ,
 * Czech: největší společný dělitel
 * Danish: største fælles divisor
 * Dutch: grootste gemene deler
 * Estonian: suurim ühiskordne
 * Finnish:
 * French: plus grand commun dénominateur,
 * Georgian: უდიდესი საერთო გამყოფი
 * German: größter gemeinsamer Teiler
 * Greek: μέγιστος κοινός διαιρέτης
 * Hungarian:
 * Icelandic: stærsti samdeilir, stærsti sameiginlegi deilir
 * Indonesian: faktor persekutuan terbesar
 * Japanese:, 最大公約多項式
 * Korean: 최대공약수
 * Malay: faktor sepunya terbesar
 * Malayalam: ഉത്തമ സാധാരണ ഘടകം
 * Norwegian: største felles faktor, største felles nevner
 * Polish: największy wspólny dzielnik
 * Portuguese:
 * Romanian: cel mai mare divizor comun, c.m.m.d.c
 * Russian:
 * Spanish: máximo común divisor
 * Swedish:
 * Turkish: en büyük ortak bölen, ortak bölenlerin en büyüğü
 * Ukrainian: найбі́льший спі́льний дільни́к
 * Vietnamese: ước chung lớn nhất, ước số chung lớn nhất