Как найти наименьший общий делитель алгоритм

Алгори́тм Евкли́да — эффективный алгоритм для нахождения наибольшего общего делителя двух целых чисел (или общей меры двух отрезков). Алгоритм назван в честь греческого математика Евклида (III век до н. э.), который впервые описал его в VII^[1] и X^[2] книгах «Начал». Это один из старейших численных алгоритмов, используемых в наше время^[3].

В самом простом случае алгоритм Евклида применяется к паре положительных целых чисел и формирует новую пару, которая состоит из меньшего числа и разницы между большим и меньшим числом. Процесс повторяется, пока числа не станут равными. Найденное число и есть наибольший общий делитель исходной пары. Евклид предложил алгоритм только для натуральных чисел и геометрических величин (длин, площадей, объёмов). Однако в XIX веке он был обобщён на другие типы математических объектов, включая целые числа Гаусса и полиномы от одной переменной. Это привело к появлению в современной общей алгебре такого понятия, как евклидово кольцо. Позже алгоритм Евклида был обобщён на другие математические структуры, такие как узлы и многомерные полиномы.

Для данного алгоритма существует множество теоретических и практических применений. В частности, он является основой для криптографического алгоритма с открытым ключом RSA^[4], широко распространённого в электронной коммерции. Также алгоритм используется при решении линейных диофантовых уравнений^[5], при построении непрерывных дробей^[6], в методе Штурма^[7]. Алгоритм Евклида является основным инструментом для доказательства теорем в современной теории чисел, например таких как теорема Лагранжа о сумме четырёх квадратов^[8] и основная теорема арифметики^[9].

История[править | править код]

Древнегреческие математики называли этот алгоритм ἀνθυφαίρεσις или ἀνταναίρεσις — «взаимное вычитание». Этот алгоритм не был открыт Евклидом, так как упоминание о нём имеется уже в Топике Аристотеля (IV век до н. э.)^[3]. В «Началах» Евклида он описан дважды — в VII книге для нахождения наибольшего общего делителя двух натуральных чисел^[1] и в X книге для нахождения наибольшей общей меры двух однородных величин^[2]. В обоих случаях дано геометрическое описание алгоритма, для нахождения «общей меры» двух отрезков.

Историками математики было выдвинуто предположение, что именно с помощью алгоритма Евклида (процедуры последовательного взаимного вычитания) в древнегреческой математике впервые было открыто существование несоизмеримых величин (стороны и диагонали квадрата, или стороны и диагонали правильного пятиугольника)^[10]. Впрочем, это предположение не имеет достаточных документальных подтверждений. Алгоритм для поиска наибольшего общего делителя двух натуральных чисел описан также в I книге древнекитайского трактата Математика в девяти книгах.

Описание[править | править код]

Алгоритм Евклида для целых чисел[править | править код]

Пусть и — целые числа, не равные одновременно нулю, и последовательность чисел

определена тем, что каждое — это остаток от деления предпредыдущего числа на предыдущее, а предпоследнее делится на последнее нацело, то есть:

Тогда НОД(a, b), наибольший общий делитель a и b, равен r_n, последнему ненулевому члену этой последовательности^[11].

Существование таких r₁, r₂, …, r_n, то есть возможность деления с остатком m на n для любого целого m и целого n ≠ 0, доказывается индукцией по m.

Корректность этого алгоритма вытекает из следующих двух утверждений^[12]:

I. Пусть a = b⋅q + r, тогда НОД (a, b) = НОД (b, r).

II. НОД(r, 0) = r для любого ненулевого r (так как 0 делится на любое целое число).

Геометрический алгоритм Евклида[править | править код]

Пусть даны два отрезка длины a и b. Вычтем из большего отрезка меньший и заменим больший отрезок полученной разностью. Повторяем эту операцию, вычитая из большего отрезка меньший, пока отрезки не станут равны. Если это произойдёт, то исходные отрезки соизмеримы, и последний полученный отрезок есть их наибольшая общая мера. Если общей меры нет, то процесс бесконечен. В таком виде алгоритм описан Евклидом^[2] и реализуется с помощью циркуля и линейки.

Пример[править | править код]

Для иллюстрации алгоритм Евклида будет использован, чтобы найти НОД a = 1071 и b = 462. Для начала от 1071 отнимем кратное значение 462, пока не получим разность меньше, чем 462. Мы должны дважды отнять 462, (q₀ = 2), оставаясь с остатком 147:

1071 = 2 × 462 + 147.

Затем от 462 отнимем кратное значение 147, пока не получим разность меньше, чем 147. Мы должны трижды отнять 147 (q₁ = 3), оставаясь с остатком 21:

462 = 3 × 147 + 21.

Затем от 147 отнимем кратное значение 21, пока не получим разность меньше, чем 21. Мы должны семь раз отнять 21 (q₂ = 7), оставаясь без остатка:

147 = 7 × 21 + 0.

Таким образом последовательность a > b > r₁ > r₂ > r₃ > … > r_n в данном конкретном случае будет выглядеть так:

1071 > 462 > 147 > 21.

Так как последний остаток равен нулю, алгоритм заканчивается числом 21 и НОД(1071, 462) = 21.

В табличной форме шаги были следующие:

Шаг k	Равенство	Частное и остаток
0	1071 = q0 462 + r0	q0 = 2 и r0 = 147
1	462 = q1 147 + r1	q1 = 3 и r1 = 21
2	147 = q2 21 + r2	q2 = 7 и r2 = 0; алгоритм заканчивается

Если требуется найти НОД для более чем двух чисел, алгоритм аналогичен, на каждом шаге все числа, кроме
наименьшего, заменяются остатками по модулю наименьшего. Нулевые остатки, если получатся, вычёркиваются. Алгоритм завершается, когда остаётся одно ненулевое число, это и есть НОД.

Применения[править | править код]

Расширенный алгоритм Евклида и соотношение Безу[править | править код]

Формулы для могут быть переписаны следующим образом:

НОД

Здесь s и t целые. Это представление наибольшего общего делителя называется соотношением Безу, а числа s и t — коэффициентами Безу^[13]. Соотношение Безу является ключевым в доказательстве леммы Евклида и основной теоремы арифметики.

Цепные дроби[править | править код]

Алгоритм Евклида достаточно тесно связан с цепными дробями^[6]. Отношение a/b допускает представление в виде цепной дроби:

.

При этом цепная дробь без последнего члена равна отношению коэффициентов Безу t/s, взятому со знаком минус:

.

Последовательность равенств, задающая алгоритм Евклида, может быть переписана в форме:

Последнее слагаемое в правой части равенства всегда равно обратному значению левой части следующего уравнения. Поэтому первые два уравнения могут быть объединены в форме:

Третье равенство может быть использовано, чтобы заменить знаменатель выражения r₁/r₀, получим:

Последнее отношение остатков r_k/r_k−1 всегда может быть заменено с использованием следующего равенства в последовательности, и так до последнего уравнения. Результатом является цепная дробь:

В приведённом выше примере НОД(1071, 462) был посчитан и были найдены частные q_k, равные 2, 3 и 7 соответственно. Поэтому 1071/462 может быть записана как:

Линейные диофантовы уравнения[править | править код]

Диофантово уравнение — это уравнение с целочисленными коэффициентами и с одним или несколькими переменными, причём ставится задача поиска лишь его целых корней. Такое уравнение может иметь бесконечно много решений, конечное число решений или не иметь их вовсе. Простейшее диофантово уравнение — линейное с двумя неизвестными:

где a, b, c — целые числа. С помощью алгоритма Евклида может быть найдено полное решение уравнения такого типа^[5]. Сначала с помощью этого алгоритма можно определить d = НОД(a, b). Затем, используя расширенный алгоритм Евклида, определяются такие k и l, что:

То есть x = k и y = l — это частное решение уравнения при c = d. Получается, что если c = q⋅d, то x = q⋅k, y = q⋅l — частное решение исходного уравнения, так как:

Обратно, если существует хотя бы одно решение уравнения, то c кратно d. Это следует из того, что d делит и a, и b (а значит, и всю левую часть), поэтому должно делить и c (правую часть). Таким образом, линейное диофантово уравнение имеет хотя бы одно решение тогда и только тогда, когда c кратно НОД(a, b).

Вариации и обобщения[править | править код]

Евклидово кольцо[править | править код]

Кольца, в которых применим алгоритм Евклида, называются евклидовыми кольцами^[14]. К ним относятся, в частности, кольца целых чисел и кольца многочленов.

Обобщённый алгоритм Евклида для многочленов[править | править код]

Алгоритм Евклида и расширенный алгоритм Евклида естественным образом обобщается на кольцо многочленов k[x] от одной переменной над произвольным полем k, поскольку для таких многочленов определена операция деления с остатком. При выполнении алгоритма Евклида для многочленов аналогично алгоритму Евклида для целых чисел получается последовательность полиномиальных остатков (PRS)^[15].

Ускоренные версии алгоритма[править | править код]

• Одним из методов ускорения целочисленного алгоритма Евклида является использование симметричного остатка^[16]:

где

• Одна из версий ускоренного алгоритма Евклида для полиномов основывается на том, что промежуточные значения алгоритма в основном зависят от высоких степеней. Применение стратегии «разделяй и властвуй» позволяет уменьшить асимптотическую сложность алгоритма^[16].

Вычислительная сложность алгоритма[править | править код]

Вычислительная сложность алгоритма Евклида изучена полностью.^[17] Эта сложность может быть описана произведением количества шагов деления, требуемых алгоритмом, на вычислительную сложность одного шага. Первый известный анализ алгоритма Евклида был предложен Рейнаудом в 1811.^[18] Он показал, что число шагов алгоритма для пары чисел (u, v) ограничено v. Позже он улучшил оценку до v/2 + 2. Эмиль Леже в 1837 году изучил наихудший случай, когда для вычисления НОД подаются последовательные числа Фибоначчи.^[19] Затем, в 1841 году, Пьер Джосеф Финк показал,^[20] что количество шагов алгоритма не превышает 2 log₂ v + 1. Следовательно, алгоритм работает за полиномиальное время от размера меньшего из пары чисел (u, v).^[19] Анализ Финка был уточнён Габриэлем Ламе в 1844 году.^[21] Он показал, что количество шагов, необходимых для завершения алгоритма, не более чем в пять раз превышает h — количество цифр в десятичном представлении меньшего из пары чисел (u, v).^[22][23]

Когда НОД вычисляется для чисел, которые вписываются в одно машинное слово, каждый шаг алгоритма занимает постоянное время. В данном случае анализ Ламе предполагает, что вычислительная сложность оценивается как O(h). Однако в модели расчёта, подходящей для вычислений с числами больше одного машинного слова, оценка сложности вычисления одного остатка может быть O(h²).^[24] В этом случае общее время для всех этапов алгоритма можно проанализировать с помощью телескопического ряда, показав, что это также O(h²). Для ускорения алгоритма Евклида могут быть использованы современные алгоритмические методы, основанные на методе Шёнхаге — Штрассена для быстрого целочисленного умножения. Это приводит к квазиполиномиальному времени.^[25]

Количество шагов[править | править код]

Число шагов для вычисления НОД двух натуральных чисел a и b обозначим как T(a, b). Если g — это наибольший общий делитель a и b, тогда a = mg и b = ng для двух взаимно простых чисел m и n. Тогда T(a, b) = T(m, n), что можно заметить, если разделить уравнения, полученные при вычислении НОД для пары (a, b), на g.^[26] Используя тот же принцип, число шагов алгоритма остаётся неизменным, если a и b умножаются на общий множитель w, что эквивалентно равенству T(a, b) = T(wa, wb). Следовательно, количество шагов T может сильно различаться между соседними парами чисел, такими как (a, b) и (a, b+1), так как данная величина зависит от НОД.

Рекурсивный характер алгоритма Евклида даёт следующее уравнение T(a, b) = 1 + T(b, r₀) = 2 + T(r₀, r₁) = … = N + T(r_N−2, r_N−1) = N + 1, где T(x, 0) = 0 по предположению.^[17]

Наихудший случай[править | править код]

Если для алгоритма Евклида требуются N шагов для пары натуральных чисел a > b > 0, наименьшие значения a и b, для которых это выполняется — числа Фибоначчи F_N+2 и F_N+1 соответственно.^[27] Тогда, если алгоритм Евклида требует N шагов для пары чисел (a,b), где a > b, выполняются следующие неравенства a ≥ F_N+2 и b ≥ F_N+1. Доказать это можно по математической индукции. Если N = 1, тогда a делится на b без остатка. Наименьшие натуральные числа, для которых это верно, равны b = 1 и a = 2, соответственно F₂ и F₃. Предположим теперь, что результат выполняется для всех значений N до M − 1. Первый шаг алгоритма Евклида с M шагами a = q₀b + r₀, и алгоритм Евклида для пары чисел (b,r₀), где b > r₀, требует M − 1 шагов. По предположению индукции имеем b ≥ F_M+1 и r₀ ≥ F_M. Следовательно, a = q₀b + r₀ ≥ b + r₀ ≥ F_M+1 + F_M = F_M+2, что является искомым неравенством. Это доказательство, опубликованное Габриэлем Ламе в 1844 году, представляет собой начало теории сложности вычислений,^[28] а также первое практическое применение чисел Фибоначчи.^[27]

Теорема Ламе[править | править код]

Число делений с остатком в процессе применения алгоритма Евклида не превосходит упятеренного количества цифр меньшего числа , записанного в десятичной системе^[29].

Среднее[править | править код]

Существуют различные способы вычисления среднего количества шагов алгоритма. Первый способ вычисления — среднее время T(a), необходимое для вычисления НОД заданного числа a и меньшего натурального числа b, выбранного с равной вероятностью из целых чисел от 0 до a − 1.^[17]

Однако, поскольку T(a, b) сильно колеблется в зависимости от НОД двух чисел, усреднённая функция T(a) также является «шумной».^[30] Для того, чтобы уменьшить этот шум, второе среднее τ(a) берётся по всем числам, взаимно простым с a.

где φ(a) функция Эйлера. Это среднее плавно растёт с ростом a.^[31]

Константа (константа Портера^[32]) в этой формуле , а ε является бесконечно малым.

Третье среднее значение Y(n) определяется как среднее число шагов, требуемых, когда a и b выбираются случайным образом (с равномерным распределением) от 1 до n.

Вычислительная сложность шага[править | править код]

На каждом шаге алгоритма Евклида вычисляется коэффициент q_k и остаток r_k для заданной пары целых чисел r_k−2 и r_k−1. Эти величины связаны следующим соотношением:

r_k−2 = q_k r_k−1 + r_k

Вычислительная сложность каждого шага связана главным образом с нахождением q_k, так как остаток r_k можно быстро вычислить, используя r_k−2, r_k−1, и q_k

r_k = r_k−2 − q_k r_k−1

Вычислительная сложность операции деления чисел размером h бит оценивается как O(h(ℓ+1)), где ℓ размер частного.^[24]

Для сравнения, исходный алгоритм Евклида, с использованием вычитания, может быть намного медленнее. В большинстве случаев коэффициент q_k является малым числом. Вероятность данного частного q примерно равна ln|u/(u − 1)|, где u = (q + 1)².^[33] Для иллюстрации вероятность частного 1, 2, 3 или 4 составляет примерно 41,5 %, 17,0 %, 9,3 % и 5,9 % соответственно. Так как операция вычитания быстрее, чем деление, особенно для чисел больше одного машинного слова,^[34] алгоритм Евклида с использованием вычитания может быть более конкурентоспособным в сравнении с алгоритмом, использующим деление.^[35] Это используется в бинарном алгоритме вычисления НОД.^[36]

Оценка сложности алгоритма вычисляется как произведение количества шагов на время выполнения одного шага. Она показывает, что алгоритм Евклида растёт квадратично O(h²), где h — среднее число цифр в двух начальных числах a и b в десятичной записи. Пусть h₀, h₁, …, h_N−1 представляют число цифр в последовательных остатках r₀, r₁, …, r_N−1. Так как число шагов N растёт линейно с h, время работы ограничено следующим выражением:

Примечания[править | править код]

Литература[править | править код]

Ссылки[править | править код]

• Реализация алгоритма Евклида на языке Pascal

• Алгоритм Евклида на e-maxx.ru
• Реализация расширенного алгоритма Евклида на языке C

Рассмотрим два основных метода нахождения НОД двумя основными способами: с использованием алгоритма Евклида и путем разложения на простые множители. Применим оба метода для двух, трех и большего количества чисел.

Алгоритм Евклида для нахождения НОД

Алгоритм Евклида позволяет с легкостью вычислить наибольший общий делитель для двух положительных чисел. Формулировки и доказательство алгоритма Евклида мы привели в разделе «Наибольший общий делитель: определитель, примеры».

Суть алгоритма заключается в том, чтобы последовательно проводить деление с остатком, в ходе которого получается ряд равенств вида:

a=b·q1+r1, 0<r1<bb=r1·q2+r2, 0<r2<r1r1=r2·q3+r3, 0<r3<r2r2=r3·q4+r4, 0<r4<r3⋮rk-2=rk-1·qk+rk, 0<rk<rk-1rk-1=rk·qk+1

Мы можем закончить деление тогда, когда rk+1=0, при этом rk=НОД(a, b).

Нахождение НОД с помощью разложения чисел на простые множители

Для того, чтобы найти наибольший общий делитель двух чисел методом разложения на множители, необходимо перемножить все простые множители, которые получаются при разложении этих двух чисел и являются для них общими.

Если мы разложим числа 220 и 600 на простые множители, то получим два произведения: 220=2·2·5·11 и 600=2·2·2·3·5·5. Общими в этих двух произведениях будут множители 2,2 и 5. Это значит, что НОД(220, 600)=2·2·5=20.

Правило нахождения наибольшего общего делителя двух чисел основано на свойствах наибольшего общего делителя, согласно которому НОД(m·a1, m·b1)=m·НОД(a1, b1), где m– любое целое положительное число.

Нахождение НОД трех и большего количества чисел

Независимо  от количества чисел, для которых нам нужно найти НОД, мы будем действовать по одному и тому же алгоритму, который заключается в последовательном нахождении НОД двух чисел. Основан этот алгоритм на применении следующей теоремы: НОД нескольких чисел a1, a2, …, ak равен числу dk, которое находится при последовательном вычислении НОД(a1, a2)=d2, НОД(d2, a3)=d3, НОД(d3, a4)=d4, …, НОД(dk-1, ak)=dk.

А теперь давайте рассмотрим еще один способ вычисления НОД для тех и большего количества чисел. Мы можем найти НОД, перемножив все общие простые множители чисел.

Нахождение НОД отрицательных чисел

Если нам приходится иметь дело с отрицательными числами, то для нахождения наибольшего общего делителя мы можем воспользоваться модулями этих чисел. Мы можем так поступить, зная свойство чисел с противоположными знаками: числа n и -n имеют одинаковые делители.

This article is about an algorithm for the greatest common divisor. For the mathematics of space, see Euclidean geometry. For other uses of “Euclidean”, see Euclidean (disambiguation).

In mathematics, the Euclidean algorithm,^{[note 1]} or Euclid’s algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers (numbers), the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements (c. 300 BC).
It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules,
and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations.

The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number. For example, 21 is the GCD of 252 and 105 (as 252 = 21 × 12 and 105 = 21 × 5), and the same number 21 is also the GCD of 105 and 252 − 105 = 147. Since this replacement reduces the larger of the two numbers, repeating this process gives successively smaller pairs of numbers until the two numbers become equal. When that occurs, they are the GCD of the original two numbers. By reversing the steps or using the extended Euclidean algorithm, the GCD can be expressed as a linear combination of the two original numbers, that is the sum of the two numbers, each multiplied by an integer (for example, 21 = 5 × 105 + (−2) × 252). The fact that the GCD can always be expressed in this way is known as Bézout’s identity.

The version of the Euclidean algorithm described above (and by Euclid) can take many subtraction steps to find the GCD when one of the given numbers is much bigger than the other. A more efficient version of the algorithm shortcuts these steps, instead replacing the larger of the two numbers by its remainder when divided by the smaller of the two (with this version, the algorithm stops when reaching a zero remainder). With this improvement, the algorithm never requires more steps than five times the number of digits (base 10) of the smaller integer. This was proven by Gabriel Lamé in 1844 (Lamé’s Theorem),^[1][2] and marks the beginning of computational complexity theory. Additional methods for improving the algorithm’s efficiency were developed in the 20th century.

The Euclidean algorithm has many theoretical and practical applications. It is used for reducing fractions to their simplest form and for performing division in modular arithmetic. Computations using this algorithm form part of the cryptographic protocols that are used to secure internet communications, and in methods for breaking these cryptosystems by factoring large composite numbers. The Euclidean algorithm may be used to solve Diophantine equations, such as finding numbers that satisfy multiple congruences according to the Chinese remainder theorem, to construct continued fractions, and to find accurate rational approximations to real numbers. Finally, it can be used as a basic tool for proving theorems in number theory such as Lagrange’s four-square theorem and the uniqueness of prime factorizations.

The original algorithm was described only for natural numbers and geometric lengths (real numbers), but the algorithm was generalized in the 19th century to other types of numbers, such as Gaussian integers and polynomials of one variable. This led to modern abstract algebraic notions such as Euclidean domains.

Background: greatest common divisor[edit]

The Euclidean algorithm calculates the greatest common divisor (GCD) of two natural numbers a and b. The greatest common divisor g is the largest natural number that divides both a and b without leaving a remainder. Synonyms for GCD include greatest common factor (GCF), highest common factor (HCF), highest common divisor (HCD), and greatest common measure (GCM). The greatest common divisor is often written as gcd(a, b) or, more simply, as (a, b),^[3] although the latter notation is ambiguous, also used for concepts such as an ideal in the ring of integers, which is closely related to GCD.

If gcd(a, b) = 1, then a and b are said to be coprime (or relatively prime).^[4] This property does not imply that a or b are themselves prime numbers.^[5] For example, 6 and 35 factor as 6 = 2 × 3 and 35 = 5 × 7, so they are not prime, but their prime factors are different, so 6 and 35 are coprime, with no common factors other than 1.

Let g = gcd(a, b). Since a and b are both multiples of g, they can be written a = mg and b = ng, and there is no larger number G > g for which this is true. The natural numbers m and n must be coprime, since any common factor could be factored out of m and n to make g greater. Thus, any other number c that divides both a and b must also divide g. The greatest common divisor g of a and b is the unique (positive) common divisor of a and b that is divisible by any other common divisor c.^[6]

The greatest common divisor can be visualized as follows.^[7] Consider a rectangular area a by b, and any common divisor c that divides both a and b exactly. The sides of the rectangle can be divided into segments of length c, which divides the rectangle into a grid of squares of side length c. The GCD g is the largest value of c for which this is possible. For illustration, a 24×60 rectangular area can be divided into a grid of: 1×1 squares, 2×2 squares, 3×3 squares, 4×4 squares, 6×6 squares or 12×12 squares. Therefore, 12 is the GCD of 24 and 60. A 24×60 rectangular area can be divided into a grid of 12×12 squares, with two squares along one edge (24/12 = 2) and five squares along the other (60/12 = 5).

The greatest common divisor of two numbers a and b is the product of the prime factors shared by the two numbers, where each prime factor can be repeated as many times as divides both a and b.^[8] For example, since 1386 can be factored into 2 × 3 × 3 × 7 × 11, and 3213 can be factored into 3 × 3 × 3 × 7 × 17, the GCD of 1386 and 3213 equals 63 = 3 × 3 × 7, the product of their shared prime factors (with 3 repeated since 3 × 3 divides both). If two numbers have no common prime factors, their GCD is 1 (obtained here as an instance of the empty product), in other words they are coprime. A key advantage of the Euclidean algorithm is that it can find the GCD efficiently without having to compute the prime factors.^[9][10] Factorization of large integers is believed to be a computationally very difficult problem, and the security of many widely used cryptographic protocols is based upon its infeasibility.^[11]

Another definition of the GCD is helpful in advanced mathematics, particularly ring theory.^[12] The greatest common divisor g  of two nonzero numbers a and b is also their smallest positive integral linear combination, that is, the smallest positive number of the form ua + vb where u and v are integers. The set of all integral linear combinations of a and b is actually the same as the set of all multiples of g (mg, where m is an integer). In modern mathematical language, the ideal generated by a and b is the ideal generated by g alone (an ideal generated by a single element is called a principal ideal, and all ideals of the integers are principal ideals). Some properties of the GCD are in fact easier to see with this description, for instance the fact that any common divisor of a and b also divides the GCD (it divides both terms of ua + vb). The equivalence of this GCD definition with the other definitions is described below.

The GCD of three or more numbers equals the product of the prime factors common to all the numbers,^[13] but it can also be calculated by repeatedly taking the GCDs of pairs of numbers.^[14] For example,

gcd(a, b, c) = gcd(a, gcd(b, c)) = gcd(gcd(a, b), c) = gcd(gcd(a, c), b).

Thus, Euclid’s algorithm, which computes the GCD of two integers, suffices to calculate the GCD of arbitrarily many integers.

Description[edit]

Procedure[edit]

The Euclidean algorithm proceeds in a series of steps, with the output of each step used as the input for the next. Track the steps using an integer counter k, so the initial step corresponds to k = 0, the next step to k = 1, and so on.

Each step begins with two nonnegative remainders r_k−2 and r_k−1, with r_k−2 > r_k−1. The kth step performs division-with-remainder to find the quotient q_k and remainder r_k so that:

That is, multiples of the smaller number r_k−1 are subtracted from the larger number r_k−2 until the remainder r_k is smaller than r_k−1. Then the algorithm proceeds to the (k+1)th step starting with r_k−1 and r_k.

In the initial step k = 0, the remainders are set to r₋₂ = a and r₋₁ = b, the numbers for which the GCD is sought. In the next step k = 1, the remainders are r₋₁ = b and the remainder r₀ of the initial step, and so on. The algorithm proceeds in a sequence of equations

The algorithm need not be modified if a < b: in that case, the initial quotient is q₀ = 0, the first remainder is r₀ = a, and henceforth r_k−2 > r_k−1 for all k ≥ 1.

Since the remainders are non-negative integers that decrease with every step, the sequence cannot be infinite, so the algorithm must eventually fail to produce the next step; but the division algorithm can always proceed to the (N+1)th step provided r_N > 0. Thus the algorithm must eventually produce a zero remainder r_N = 0.^[15] The final nonzero remainder is the greatest common divisor of a and b:

Proof of validity[edit]

The validity of the Euclidean algorithm can be proven by a two-step argument.^[16] In the first step, the final nonzero remainder r_N−1 is shown to divide both a and b. Since it is a common divisor, it must be less than or equal to the greatest common divisor g. In the second step, it is shown that any common divisor of a and b, including g, must divide r_N−1; therefore, g must be less than or equal to r_N−1. These two opposite inequalities imply r_N−1 = g.

To demonstrate that r_N−1 divides both a and b (the first step), r_N−1 divides its predecessor r_N−2

r_N−2 = q_N r_N−1

since the final remainder r_N is zero. r_N−1 also divides its next predecessor r_N−3

r_N−3 = q_N−1 r_N−2 + r_N−1

because it divides both terms on the right-hand side of the equation. Iterating the same argument, r_N−1 divides all the preceding remainders, including a and b. None of the preceding remainders r_N−2, r_N−3, etc. divide a and b, since they leave a remainder. Since r_N−1 is a common divisor of a and b, r_N−1 ≤ g.

In the second step, any natural number c that divides both a and b (in other words, any common divisor of a and b) divides the remainders r_k. By definition, a and b can be written as multiples of c : a = mc and b = nc, where m and n are natural numbers. Therefore, c divides the initial remainder r₀, since r₀ = a − q₀b = mc − q₀nc = (m − q₀n)c. An analogous argument shows that c also divides the subsequent remainders r₁, r₂, etc. Therefore, the greatest common divisor g must divide r_N−1, which implies that g ≤ r_N−1. Since the first part of the argument showed the reverse (r_N−1 ≤ g), it follows that g = r_N−1. Thus, g is the greatest common divisor of all the succeeding pairs:^[17][18]

g = gcd(a, b) = gcd(b, r₀) = gcd(r₀, r₁) = … = gcd(r_N−2, r_N−1) = r_N−1.

Worked example[edit]

For illustration, the Euclidean algorithm can be used to find the greatest common divisor of a = 1071 and b = 462. To begin, multiples of 462 are subtracted from 1071 until the remainder is less than 462. Two such multiples can be subtracted (q₀ = 2), leaving a remainder of 147:

1071 = 2 × 462 + 147.

Then multiples of 147 are subtracted from 462 until the remainder is less than 147. Three multiples can be subtracted (q₁ = 3), leaving a remainder of 21:

462 = 3 × 147 + 21.

Then multiples of 21 are subtracted from 147 until the remainder is less than 21. Seven multiples can be subtracted (q₂ = 7), leaving no remainder:

147 = 7 × 21 + 0.

Since the last remainder is zero, the algorithm ends with 21 as the greatest common divisor of 1071 and 462. This agrees with the gcd(1071, 462) found by prime factorization above. In tabular form, the steps are:

Step k	Equation	Quotient and remainder
0	1071 = q0 462 + r0	q0 = 2 and r0 = 147
1	462 = q1 147 + r1	q1 = 3 and r1 = 21
2	147 = q2 21 + r2	q2 = 7 and r2 = 0; algorithm ends

Visualization[edit]

The Euclidean algorithm can be visualized in terms of the tiling analogy given above for the greatest common divisor.^[19] Assume that we wish to cover an a×b rectangle with square tiles exactly, where a is the larger of the two numbers. We first attempt to tile the rectangle using b×b square tiles; however, this leaves an r₀×b residual rectangle untiled, where r₀ < b. We then attempt to tile the residual rectangle with r₀×r₀ square tiles. This leaves a second residual rectangle r₁×r₀, which we attempt to tile using r₁×r₁ square tiles, and so on. The sequence ends when there is no residual rectangle, i.e., when the square tiles cover the previous residual rectangle exactly. The length of the sides of the smallest square tile is the GCD of the dimensions of the original rectangle. For example, the smallest square tile in the adjacent figure is 21×21 (shown in red), and 21 is the GCD of 1071 and 462, the dimensions of the original rectangle (shown in green).

Euclidean division[edit]

At every step k, the Euclidean algorithm computes a quotient q_k and remainder r_k from two numbers r_k−1 and r_k−2

r_k−2 = q_k r_k−1 + r_k

where the r_k is non-negative and is strictly less than the absolute value of r_k−1. The theorem which underlies the definition of the Euclidean division ensures that such a quotient and remainder always exist and are unique.^[20]

In Euclid’s original version of the algorithm, the quotient and remainder are found by repeated subtraction; that is, r_k−1 is subtracted from r_k−2 repeatedly until the remainder r_k is smaller than r_k−1. After that r_k and r_k−1 are exchanged and the process is iterated. Euclidean division reduces all the steps between two exchanges into a single step, which is thus more efficient. Moreover, the quotients are not needed, thus one may replace Euclidean division by the modulo operation, which gives only the remainder. Thus the iteration of the Euclidean algorithm becomes simply

r_k = r_k−2 mod r_k−1.

Implementations[edit]

Implementations of the algorithm may be expressed in pseudocode. For example, the division-based version may be programmed as^[21]

function gcd(a, b)
    while b ≠ 0
        t := b
        b := a mod b
        a := t
    return a

At the beginning of the kth iteration, the variable b holds the latest remainder r_k−1, whereas the variable a holds its predecessor, r_k−2. The step b := a mod b is equivalent to the above recursion formula r_k ≡ r_k−2 mod r_k−1. The temporary variable t holds the value of r_k−1 while the next remainder r_k is being calculated. At the end of the loop iteration, the variable b holds the remainder r_k, whereas the variable a holds its predecessor, r_k−1.

(If negative inputs are allowed, or if the mod function may return negative values, the last line must be changed into return max(a, −a).)

In the subtraction-based version, which was Euclid’s original version, the remainder calculation (b := a mod b) is replaced by repeated subtraction.^[22] Contrary to the division-based version, which works with arbitrary integers as input, the subtraction-based version supposes that the input consists of positive integers and stops when a = b:

function gcd(a, b)
    while a ≠ b 
        if a > b
            a := a − b
        else
            b := b − a
    return a

The variables a and b alternate holding the previous remainders r_k−1 and r_k−2. Assume that a is larger than b at the beginning of an iteration; then a equals r_k−2, since r_k−2 > r_k−1. During the loop iteration, a is reduced by multiples of the previous remainder b until a is smaller than b. Then a is the next remainder r_k. Then b is reduced by multiples of a until it is again smaller than a, giving the next remainder r_k+1, and so on.

The recursive version^[23] is based on the equality of the GCDs of successive remainders and the stopping condition gcd(r_N−1, 0) = r_N−1.

function gcd(a, b)
    if b = 0
        return a
    else
        return gcd(b, a mod b)

(As above, if negative inputs are allowed, or if the mod function may return negative values, the instruction “return a” must be changed into “return max(a, −a)”.)

For illustration, the gcd(1071, 462) is calculated from the equivalent gcd(462, 1071 mod 462) = gcd(462, 147). The latter GCD is calculated from the gcd(147, 462 mod 147) = gcd(147, 21), which in turn is calculated from the gcd(21, 147 mod 21) = gcd(21, 0) = 21.

Method of least absolute remainders[edit]

In another version of Euclid’s algorithm, the quotient at each step is increased by one if the resulting negative remainder is smaller in magnitude than the typical positive remainder.^[24][25] Previously, the equation

r_k−2 = q_k r_k−1 + r_k

assumed that |r_k−1| > r_k > 0. However, an alternative negative remainder e_k can be computed:

r_k−2 = (q_k + 1) r_k−1 + e_k

if r_k−1 > 0 or

r_k−2 = (q_k − 1) r_k−1 + e_k

if r_k−1 < 0.

If r_k is replaced by e_k. when |e_k| < |r_k|, then one gets a variant of Euclidean algorithm such that

|r_k| ≤ |r_k−1| / 2

at each step.

Leopold Kronecker has shown that this version requires the fewest steps of any version of Euclid’s algorithm.^[24][25] More generally, it has been proven that, for every input numbers a and b, the number of steps is minimal if and only if q_k is chosen in order that where is the golden ratio.^[26]

Historical development[edit]

The Euclidean algorithm is one of the oldest algorithms in common use.^[27] It appears in Euclid’s Elements (c. 300 BC), specifically in Book 7 (Propositions 1–2) and Book 10 (Propositions 2–3). In Book 7, the algorithm is formulated for integers, whereas in Book 10, it is formulated for lengths of line segments. (In modern usage, one would say it was formulated there for real numbers. But lengths, areas, and volumes, represented as real numbers in modern usage, are not measured in the same units and there is no natural unit of length, area, or volume; the concept of real numbers was unknown at that time.) The latter algorithm is geometrical. The GCD of two lengths a and b corresponds to the greatest length g that measures a and b evenly; in other words, the lengths a and b are both integer multiples of the length g.

The algorithm was probably not discovered by Euclid, who compiled results from earlier mathematicians in his Elements.^[28][29] The mathematician and historian B. L. van der Waerden suggests that Book VII derives from a textbook on number theory written by mathematicians in the school of Pythagoras.^[30] The algorithm was probably known by Eudoxus of Cnidus (about 375 BC).^[27][31] The algorithm may even pre-date Eudoxus,^[32][33] judging from the use of the technical term ἀνθυφαίρεσις (anthyphairesis, reciprocal subtraction) in works by Euclid and Aristotle.^[34]

Centuries later, Euclid’s algorithm was discovered independently both in India and in China,^[35] primarily to solve Diophantine equations that arose in astronomy and making accurate calendars. In the late 5th century, the Indian mathematician and astronomer Aryabhata described the algorithm as the “pulverizer”,^[36] perhaps because of its effectiveness in solving Diophantine equations.^[37] Although a special case of the Chinese remainder theorem had already been described in the Chinese book Sunzi Suanjing,^[38] the general solution was published by Qin Jiushao in his 1247 book Shushu Jiuzhang (數書九章 Mathematical Treatise in Nine Sections).^[39] The Euclidean algorithm was first described numerically and popularized in Europe in the second edition of Bachet’s Problèmes plaisants et délectables (Pleasant and enjoyable problems, 1624).^[36] In Europe, it was likewise used to solve Diophantine equations and in developing continued fractions. The extended Euclidean algorithm was published by the English mathematician Nicholas Saunderson,^[40] who attributed it to Roger Cotes as a method for computing continued fractions efficiently.^[41]

In the 19th century, the Euclidean algorithm led to the development of new number systems, such as Gaussian integers and Eisenstein integers. In 1815, Carl Gauss used the Euclidean algorithm to demonstrate unique factorization of Gaussian integers, although his work was first published in 1832.^[42] Gauss mentioned the algorithm in his Disquisitiones Arithmeticae (published 1801), but only as a method for continued fractions.^[35] Peter Gustav Lejeune Dirichlet seems to have been the first to describe the Euclidean algorithm as the basis for much of number theory.^[43] Lejeune Dirichlet noted that many results of number theory, such as unique factorization, would hold true for any other system of numbers to which the Euclidean algorithm could be applied.^[44] Lejeune Dirichlet’s lectures on number theory were edited and extended by Richard Dedekind, who used Euclid’s algorithm to study algebraic integers, a new general type of number. For example, Dedekind was the first to prove Fermat’s two-square theorem using the unique factorization of Gaussian integers.^[45] Dedekind also defined the concept of a Euclidean domain, a number system in which a generalized version of the Euclidean algorithm can be defined (as described below). In the closing decades of the 19th century, the Euclidean algorithm gradually became eclipsed by Dedekind’s more general theory of ideals.^[46]

“[The Euclidean algorithm] is the granddaddy of all algorithms, because it is the oldest nontrivial algorithm that has survived to the present day.”

Donald Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 2nd edition (1981), p. 318.

Other applications of Euclid’s algorithm were developed in the 19th century. In 1829, Charles Sturm showed that the algorithm was useful in the Sturm chain method for counting the real roots of polynomials in any given interval.^[47]

The Euclidean algorithm was the first integer relation algorithm, which is a method for finding integer relations between commensurate real numbers. Several novel integer relation algorithms have been developed, such as the algorithm of Helaman Ferguson and R.W. Forcade (1979)^[48] and the LLL algorithm.^[49][50]

In 1969, Cole and Davie developed a two-player game based on the Euclidean algorithm, called The Game of Euclid,^[51] which has an optimal strategy.^[52] The players begin with two piles of a and b stones. The players take turns removing m multiples of the smaller pile from the larger. Thus, if the two piles consist of x and y stones, where x is larger than y, the next player can reduce the larger pile from x stones to x − my stones, as long as the latter is a nonnegative integer. The winner is the first player to reduce one pile to zero stones.^[53][54]

Mathematical applications[edit]

Bézout’s identity[edit]

Bézout’s identity states that the greatest common divisor g of two integers a and b can be represented as a linear sum of the original two numbers a and b.^[55] In other words, it is always possible to find integers s and t such that g = sa + tb.^[56][57]

The integers s and t can be calculated from the quotients q₀, q₁, etc. by reversing the order of equations in Euclid’s algorithm.^[58] Beginning with the next-to-last equation, g can be expressed in terms of the quotient q_N−1 and the two preceding remainders, r_N−2 and r_N−3:

g = r_N−1 = r_N−3 − q_N−1 r_N−2 .

Those two remainders can be likewise expressed in terms of their quotients and preceding remainders,

r_N−2 = r_N−4 − q_N−2 r_N−3 and

r_N−3 = r_N−5 − q_N−3 r_N−4 .

Substituting these formulae for r_N−2 and r_N−3 into the first equation yields g as a linear sum of the remainders r_N−4 and r_N−5. The process of substituting remainders by formulae involving their predecessors can be continued until the original numbers a and b are reached:

r₂ = r₀ − q₂ r₁

r₁ = b − q₁ r₀

r₀ = a − q₀ b.

After all the remainders r₀, r₁, etc. have been substituted, the final equation expresses g as a linear sum of a and b, so that g = sa + tb.

The Euclidean algorithm, and thus Bezout’s identity, can be generalized to the context of Euclidean domains.

Principal ideals and related problems[edit]

Bézout’s identity provides yet another definition of the greatest common divisor g of two numbers a and b.^[12] Consider the set of all numbers ua + vb, where u and v are any two integers. Since a and b are both divisible by g, every number in the set is divisible by g. In other words, every number of the set is an integer multiple of g. This is true for every common divisor of a and b. However, unlike other common divisors, the greatest common divisor is a member of the set; by Bézout’s identity, choosing u = s and v = t gives g. A smaller common divisor cannot be a member of the set, since every member of the set must be divisible by g. Conversely, any multiple m of g can be obtained by choosing u = ms and v = mt, where s and t are the integers of Bézout’s identity. This may be seen by multiplying Bézout’s identity by m,

mg = msa + mtb.

Therefore, the set of all numbers ua + vb is equivalent to the set of multiples m of g. In other words, the set of all possible sums of integer multiples of two numbers (a and b) is equivalent to the set of multiples of gcd(a, b). The GCD is said to be the generator of the ideal of a and b. This GCD definition led to the modern abstract algebraic concepts of a principal ideal (an ideal generated by a single element) and a principal ideal domain (a domain in which every ideal is a principal ideal).

Certain problems can be solved using this result.^[59] For example, consider two measuring cups of volume a and b. By adding/subtracting u multiples of the first cup and v multiples of the second cup, any volume ua + vb can be measured out. These volumes are all multiples of g = gcd(a, b).

Extended Euclidean algorithm[edit]

The integers s and t of Bézout’s identity can be computed efficiently using the extended Euclidean algorithm. This extension adds two recursive equations to Euclid’s algorithm^[60]

s_k = s_k−2 − q_ks_k−1

t_k = t_k−2 − q_kt_k−1

with the starting values

s₋₂ = 1, t₋₂ = 0

s₋₁ = 0, t₋₁ = 1.

Using this recursion, Bézout’s integers s and t are given by s = s_N and t = t_N, where N+1 is the step on which the algorithm terminates with r_N+1 = 0.

The validity of this approach can be shown by induction. Assume that the recursion formula is correct up to step k − 1 of the algorithm; in other words, assume that

r_j = s_j a + t_j b

for all j less than k. The kth step of the algorithm gives the equation

r_k = r_k−2 − q_kr_k−1.

Since the recursion formula has been assumed to be correct for r_k−2 and r_k−1, they may be expressed in terms of the corresponding s and t variables

r_k = (s_k−2 a + t_k−2 b) − q_k(s_k−1 a + t_k−1 b).

Rearranging this equation yields the recursion formula for step k, as required

r_k = s_k a + t_k b = (s_k−2 − q_ks_k−1) a + (t_k−2 − q_kt_k−1) b.

Matrix method[edit]

The integers s and t can also be found using an equivalent matrix method.^[61] The sequence of equations of Euclid’s algorithm

can be written as a product of 2×2 quotient matrices multiplying a two-dimensional remainder vector

Let M represent the product of all the quotient matrices

This simplifies the Euclidean algorithm to the form

To express g as a linear sum of a and b, both sides of this equation can be multiplied by the inverse of the matrix M.^[61][62] The determinant of M equals (−1)^N+1, since it equals the product of the determinants of the quotient matrices, each of which is negative one. Since the determinant of M is never zero, the vector of the final remainders can be solved using the inverse of M

Since the top equation gives

g = (−1)^N+1 ( m₂₂ a − m₁₂ b),

the two integers of Bézout’s identity are s = (−1)^N+1m₂₂ and t = (−1)^Nm₁₂. The matrix method is as efficient as the equivalent recursion, with two multiplications and two additions per step of the Euclidean algorithm.

Euclid’s lemma and unique factorization[edit]

Bézout’s identity is essential to many applications of Euclid’s algorithm, such as demonstrating the unique factorization of numbers into prime factors.^[63] To illustrate this, suppose that a number L can be written as a product of two factors u and v, that is, L = uv. If another number w also divides L but is coprime with u, then w must divide v, by the following argument: If the greatest common divisor of u and w is 1, then integers s and t can be found such that

1 = su + tw .

by Bézout’s identity. Multiplying both sides by v gives the relation

v = suv + twv = sL + twv .

Since w divides both terms on the right-hand side, it must also divide the left-hand side, v. This result is known as Euclid’s lemma.^[64] Specifically, if a prime number divides L, then it must divide at least one factor of L. Conversely, if a number w is coprime to each of a series of numbers a₁, a₂, …, a_n, then w is also coprime to their product, a₁ × a₂ × … × a_n.^[64]

Euclid’s lemma suffices to prove that every number has a unique factorization into prime numbers.^[65] To see this, assume the contrary, that there are two independent factorizations of L into m and n prime factors, respectively

L = p₁p₂…p_m = q₁q₂…q_n .

Since each prime p divides L by assumption, it must also divide one of the q factors; since each q is prime as well, it must be that p = q. Iteratively dividing by the p factors shows that each p has an equal counterpart q; the two prime factorizations are identical except for their order. The unique factorization of numbers into primes has many applications in mathematical proofs, as shown below.

Linear Diophantine equations[edit]

Diophantine equations are equations in which the solutions are restricted to integers; they are named after the 3rd-century Alexandrian mathematician Diophantus.^[66] A typical linear Diophantine equation seeks integers x and y such that^[67]

ax + by = c

where a, b and c are given integers. This can be written as an equation for x in modular arithmetic:

ax ≡ c mod b.

Let g be the greatest common divisor of a and b. Both terms in ax + by are divisible by g; therefore, c must also be divisible by g, or the equation has no solutions. By dividing both sides by c/g, the equation can be reduced to Bezout’s identity

sa + tb = g

where s and t can be found by the extended Euclidean algorithm.^[68] This provides one solution to the Diophantine equation, x₁ = s (c/g) and y₁ = t (c/g).

In general, a linear Diophantine equation has no solutions, or an infinite number of solutions.^[69] To find the latter, consider two solutions, (x₁, y₁) and (x₂, y₂), where

ax₁ + by₁ = c = ax₂ + by₂

or equivalently

a(x₁ − x₂) = b(y₂ − y₁).

Therefore, the smallest difference between two x solutions is b/g, whereas the smallest difference between two y solutions is a/g. Thus, the solutions may be expressed as

x = x₁ − bu/g

y = y₁ + au/g.

By allowing u to vary over all possible integers, an infinite family of solutions can be generated from a single solution (x₁, y₁). If the solutions are required to be positive integers (x > 0, y > 0), only a finite number of solutions may be possible. This restriction on the acceptable solutions allows some systems of Diophantine equations with more unknowns than equations to have a finite number of solutions;^[70] this is impossible for a system of linear equations when the solutions can be any real number (see Underdetermined system).

Multiplicative inverses and the RSA algorithm[edit]

A finite field is a set of numbers with four generalized operations. The operations are called addition, subtraction, multiplication and division and have their usual properties, such as commutativity, associativity and distributivity. An example of a finite field is the set of 13 numbers {0, 1, 2, …, 12} using modular arithmetic. In this field, the results of any mathematical operation (addition, subtraction, multiplication, or division) is reduced modulo 13; that is, multiples of 13 are added or subtracted until the result is brought within the range 0–12. For example, the result of 5 × 7 = 35 mod 13 = 9. Such finite fields can be defined for any prime p; using more sophisticated definitions, they can also be defined for any power m of a prime p ^m. Finite fields are often called Galois fields, and are abbreviated as GF(p) or GF(p ^m).

In such a field with m numbers, every nonzero element a has a unique modular multiplicative inverse, a⁻¹ such that aa⁻¹ = a⁻¹a ≡ 1 mod m. This inverse can be found by solving the congruence equation ax ≡ 1 mod m,^[71] or the equivalent linear Diophantine equation^[72]

ax + my = 1.

This equation can be solved by the Euclidean algorithm, as described above. Finding multiplicative inverses is an essential step in the RSA algorithm, which is widely used in electronic commerce; specifically, the equation determines the integer used to decrypt the message.^[73] Although the RSA algorithm uses rings rather than fields, the Euclidean algorithm can still be used to find a multiplicative inverse where one exists. The Euclidean algorithm also has other applications in error-correcting codes; for example, it can be used as an alternative to the Berlekamp–Massey algorithm for decoding BCH and Reed–Solomon codes, which are based on Galois fields.^[74]

Chinese remainder theorem[edit]

Euclid’s algorithm can also be used to solve multiple linear Diophantine equations.^[75] Such equations arise in the Chinese remainder theorem, which describes a novel method to represent an integer x. Instead of representing an integer by its digits, it may be represented by its remainders x_i modulo a set of N coprime numbers m_i:^[76]

The goal is to determine x from its N remainders x_i. The solution is to combine the multiple equations into a single linear Diophantine equation with a much larger modulus M that is the product of all the individual moduli m_i, and define M_i as

Thus, each M_i is the product of all the moduli except m_i. The solution depends on finding N new numbers h_i such that

With these numbers h_i, any integer x can be reconstructed from its remainders x_i by the equation

Since these numbers h_i are the multiplicative inverses of the M_i, they may be found using Euclid’s algorithm as described in the previous subsection.

Stern–Brocot tree[edit]

The Euclidean algorithm can be used to arrange the set of all positive rational numbers into an infinite binary search tree, called the Stern–Brocot tree.
The number 1 (expressed as a fraction 1/1) is placed at the root of the tree, and the location of any other number a/b can be found by computing gcd(a,b) using the original form of the Euclidean algorithm, in which each step replaces the larger of the two given numbers by its difference with the smaller number (not its remainder), stopping when two equal numbers are reached. A step of the Euclidean algorithm that replaces the first of the two numbers corresponds to a step in the tree from a node to its right child, and a step that replaces the second of the two numbers corresponds to a step in the tree from a node to its left child. The sequence of steps constructed in this way does not depend on whether a/b is given in lowest terms, and forms a path from the root to a node containing the number a/b.^[77] This fact can be used to prove that each positive rational number appears exactly once in this tree.

For example, 3/4 can be found by starting at the root, going to the left once, then to the right twice:

The Euclidean algorithm has almost the same relationship to another binary tree on the rational numbers called the Calkin–Wilf tree. The difference is that the path is reversed: instead of producing a path from the root of the tree to a target, it produces a path from the target to the root.

Continued fractions[edit]

The Euclidean algorithm has a close relationship with continued fractions.^[78] The sequence of equations can be written in the form

The last term on the right-hand side always equals the inverse of the left-hand side of the next equation. Thus, the first two equations may be combined to form

The third equation may be used to substitute the denominator term r₁/r₀, yielding

The final ratio of remainders r_k/r_k−1 can always be replaced using the next equation in the series, up to the final equation. The result is a continued fraction

In the worked example above, the gcd(1071, 462) was calculated, and the quotients q_k were 2, 3 and 7, respectively. Therefore, the fraction 1071/462 may be written

as can be confirmed by calculation.

Factorization algorithms[edit]

Calculating a greatest common divisor is an essential step in several integer factorization algorithms,^[79] such as Pollard’s rho algorithm,^[80] Shor’s algorithm,^[81] Dixon’s factorization method^[82] and the Lenstra elliptic curve factorization.^[83] The Euclidean algorithm may be used to find this GCD efficiently. Continued fraction factorization uses continued fractions, which are determined using Euclid’s algorithm.^[84]

Algorithmic efficiency[edit]

The computational efficiency of Euclid’s algorithm has been studied thoroughly.^[85] This efficiency can be described by the number of division steps the algorithm requires, multiplied by the computational expense of each step. The first known analysis of Euclid’s algorithm is due to A. A. L. Reynaud in 1811,^[86] who showed that the number of division steps on input (u, v) is bounded by v; later he improved this to v/2  + 2. Later, in 1841, P. J. E. Finck showed^[87] that the number of division steps is at most 2 log₂ v + 1, and hence Euclid’s algorithm runs in time polynomial in the size of the input.^[88] Émile Léger, in 1837, studied the worst case, which is when the inputs are consecutive Fibonacci numbers.^[88] Finck’s analysis was refined by Gabriel Lamé in 1844,^[89] who showed that the number of steps required for completion is never more than five times the number h of base-10 digits of the smaller number b.^[90][91]

In the uniform cost model (suitable for analyzing the complexity of gcd calculation on numbers that fit into a single machine word), each step of the algorithm takes constant time, and Lamé’s analysis implies that the total running time is also O(h). However, in a model of computation suitable for computation with larger numbers, the computational expense of a single remainder computation in the algorithm can be as large as O(h²).^[92] In this case the total time for all of the steps of the algorithm can be analyzed using a telescoping series, showing that it is also O(h²). Modern algorithmic techniques based on the Schönhage–Strassen algorithm for fast integer multiplication can be used to speed this up, leading to quasilinear algorithms for the GCD.^[93][94]

Number of steps[edit]

The number of steps to calculate the GCD of two natural numbers, a and b, may be denoted by T(a, b).^[95] If g is the GCD of a and b, then a = mg and b = ng for two coprime numbers m and n. Then

T(a, b) = T(m, n)

as may be seen by dividing all the steps in the Euclidean algorithm by g.^[96] By the same argument, the number of steps remains the same if a and b are multiplied by a common factor w: T(a, b) = T(wa, wb). Therefore, the number of steps T may vary dramatically between neighboring pairs of numbers, such as T(a, b) and T(a, b + 1), depending on the size of the two GCDs.

The recursive nature of the Euclidean algorithm gives another equation

T(a, b) = 1 + T(b, r₀) = 2 + T(r₀, r₁) = … = N + T(r_N−2, r_N−1) = N + 1

where T(x, 0) = 0 by assumption.^[95]

Worst-case[edit]

If the Euclidean algorithm requires N steps for a pair of natural numbers a > b > 0, the smallest values of a and b for which this is true are the Fibonacci numbers F_N+2 and F_N+1, respectively.^[97] More precisely, if the Euclidean algorithm requires N steps for the pair a > b, then one has a ≥ F_N+2 and b ≥ F_N+1. This can be shown by induction.^[98] If N = 1, b divides a with no remainder; the smallest natural numbers for which this is true is b = 1 and a = 2, which are F₂ and F₃, respectively. Now assume that the result holds for all values of N up to M − 1. The first step of the M-step algorithm is a = q₀b + r₀, and the Euclidean algorithm requires M − 1 steps for the pair b > r₀. By induction hypothesis, one has b ≥ F_M+1 and r₀ ≥ F_M. Therefore, a = q₀b + r₀ ≥ b + r₀ ≥ F_M+1 + F_M = F_M+2,
which is the desired inequality.
This proof, published by Gabriel Lamé in 1844, represents the beginning of computational complexity theory,^[99] and also the first practical application of the Fibonacci numbers.^[97]

This result suffices to show that the number of steps in Euclid’s algorithm can never be more than five times the number of its digits (base 10).^[100] For if the algorithm requires N steps, then b is greater than or equal to F_N+1 which in turn is greater than or equal to φ^N−1, where φ is the golden ratio. Since b ≥ φ^N−1, then N − 1 ≤ log_φb. Since log₁₀φ > 1/5, (N − 1)/5 < log₁₀φ log_φb = log₁₀b. Thus, N ≤ 5 log₁₀b. Thus, the Euclidean algorithm always needs less than O(h) divisions, where h is the number of digits in the smaller number b.

Average[edit]

The average number of steps taken by the Euclidean algorithm has been defined in three different ways. The first definition is the average time T(a) required to calculate the GCD of a given number a and a smaller natural number b chosen with equal probability from the integers 0 to a − 1^[95]

However, since T(a, b) fluctuates dramatically with the GCD of the two numbers, the averaged function T(a) is likewise “noisy”.^[101]

To reduce this noise, a second average τ(a) is taken over all numbers coprime with a

There are φ(a) coprime integers less than a, where φ is Euler’s totient function. This tau average grows smoothly with a^[102][103]

with the residual error being of order a^{−(1/6) + ε}, where ε is infinitesimal. The constant C in this formula is called Porter’s constant^[104] and equals

where γ is the Euler–Mascheroni constant and ζ’ is the derivative of the Riemann zeta function.^[105][106] The leading coefficient (12/π²) ln 2 was determined by two independent methods.^[107][108]

Since the first average can be calculated from the tau average by summing over the divisors d of a^[109]

it can be approximated by the formula^[110]

where Λ(d) is the Mangoldt function.^[111]

A third average Y(n) is defined as the mean number of steps required when both a and b are chosen randomly (with uniform distribution) from 1 to n^[110]

Substituting the approximate formula for T(a) into this equation yields an estimate for Y(n)^[112]

Computational expense per step[edit]

In each step k of the Euclidean algorithm, the quotient q_k and remainder r_k are computed for a given pair of integers r_k−2 and r_k−1

r_k−2 = q_k r_k−1 + r_k.

The computational expense per step is associated chiefly with finding q_k, since the remainder r_k can be calculated quickly from r_k−2, r_k−1, and q_k

r_k = r_k−2 − q_k r_k−1.

The computational expense of dividing h-bit numbers scales as O(h(ℓ+1)), where ℓ is the length of the quotient.^[92]

For comparison, Euclid’s original subtraction-based algorithm can be much slower. A single integer division is equivalent to the quotient q number of subtractions. If the ratio of a and b is very large, the quotient is large and many subtractions will be required. On the other hand, it has been shown that the quotients are very likely to be small integers. The probability of a given quotient q is approximately ln |u/(u − 1)| where u = (q + 1)².^[113] For illustration, the probability of a quotient of 1, 2, 3, or 4 is roughly 41.5%, 17.0%, 9.3%, and 5.9%, respectively. Since the operation of subtraction is faster than division, particularly for large numbers,^[114] the subtraction-based Euclid’s algorithm is competitive with the division-based version.^[115] This is exploited in the binary version of Euclid’s algorithm.^[116]

Combining the estimated number of steps with the estimated computational expense per step shows that the Euclid’s algorithm grows quadratically (h²) with the average number of digits h in the initial two numbers a and b. Let h₀, h₁, …, h_N−1 represent the number of digits in the successive remainders r₀, r₁, …, r_N−1. Since the number of steps N grows linearly with h, the running time is bounded by

Alternative methods[edit]

Euclid’s algorithm is widely used in practice, especially for small numbers, due to its simplicity.^[117] For comparison, the efficiency of alternatives to Euclid’s algorithm may be determined.

One inefficient approach to finding the GCD of two natural numbers a and b is to calculate all their common divisors; the GCD is then the largest common divisor. The common divisors can be found by dividing both numbers by successive integers from 2 to the smaller number b. The number of steps of this approach grows linearly with b, or exponentially in the number of digits. Another inefficient approach is to find the prime factors of one or both numbers. As noted above, the GCD equals the product of the prime factors shared by the two numbers a and b.^[8] Present methods for prime factorization are also inefficient; many modern cryptography systems even rely on that inefficiency.^[11]

The binary GCD algorithm is an efficient alternative that substitutes division with faster operations by exploiting the binary representation used by computers.^[118][119] However, this alternative also scales like O(h²). It is generally faster than the Euclidean algorithm on real computers, even though it scales in the same way.^[93] Additional efficiency can be gleaned by examining only the leading digits of the two numbers a and b.^[120][121] The binary algorithm can be extended to other bases (k-ary algorithms),^[122] with up to fivefold increases in speed.^[123] Lehmer’s GCD algorithm uses the same general principle as the binary algorithm to speed up GCD computations in arbitrary bases.

A recursive approach for very large integers (with more than 25,000 digits) leads to quasilinear integer GCD algorithms,^[124] such as those of Schönhage,^[125][126] and Stehlé and Zimmermann.^[127] These algorithms exploit the 2×2 matrix form of the Euclidean algorithm given above. These quasilinear methods generally scale as O(h (log h)² (log log h)).^[93][94]

Generalizations[edit]

Although the Euclidean algorithm is used to find the greatest common divisor of two natural numbers (positive integers), it may be generalized to the real numbers, and to other mathematical objects, such as polynomials,^[128] quadratic integers^[129] and Hurwitz quaternions.^[130] In the latter cases, the Euclidean algorithm is used to demonstrate the crucial property of unique factorization, i.e., that such numbers can be factored uniquely into irreducible elements, the counterparts of prime numbers. Unique factorization is essential to many proofs of number theory.

Rational and real numbers[edit]

Euclid’s algorithm can be applied to real numbers, as described by Euclid in Book 10 of his Elements. The goal of the algorithm is to identify a real number g such that two given real numbers, a and b, are integer multiples of it: a = mg and b = ng, where m and n are integers.^[28] This identification is equivalent to finding an integer relation among the real numbers a and b; that is, it determines integers s and t such that sa + tb = 0. If such an equation is possible, a and b are called commensurable lengths, otherwise they are incommensurable lengths.^[131][132]

The real-number Euclidean algorithm differs from its integer counterpart in two respects. First, the remainders r_k are real numbers, although the quotients q_k are integers as before. Second, the algorithm is not guaranteed to end in a finite number N of steps. If it does, the fraction a/b is a rational number, i.e., the ratio of two integers

and can be written as a finite continued fraction [q₀; q₁, q₂, …, q_N]. If the algorithm does not stop, the fraction a/b is an irrational number and can be described by an infinite continued fraction [q₀; q₁, q₂, …].^[133] Examples of infinite continued fractions are the golden ratio φ = [1; 1, 1, …] and the square root of two, √2 = [1; 2, 2, …].^[134] The algorithm is unlikely to stop, since almost all ratios a/b of two real numbers are irrational.^[135]

An infinite continued fraction may be truncated at a step k [q₀; q₁, q₂, …, q_k] to yield an approximation to a/b that improves as k is increased. The approximation is described by convergents m_k/n_k; the numerator and denominators are coprime and obey the recurrence relation

where m₋₁ = n₋₂ = 1 and m₋₂ = n₋₁ = 0 are the initial values of the recursion. The convergent m_k/n_k is the best rational number approximation to a/b with denominator n_k:^[136]

Polynomials[edit]

Polynomials in a single variable x can be added, multiplied and factored into irreducible polynomials, which are the analogs of the prime numbers for integers. The greatest common divisor polynomial g(x) of two polynomials a(x) and b(x) is defined as the product of their shared irreducible polynomials, which can be identified using the Euclidean algorithm.^[128] The basic procedure is similar to that for integers. At each step k, a quotient polynomial q_k(x) and a remainder polynomial r_k(x) are identified to satisfy the recursive equation

where r₋₂(x) = a(x) and r₋₁(x) = b(x). Each quotient polynomial is chosen such that each remainder is either zero or has a degree that is smaller than the degree of its predecessor: deg[r_k(x)] < deg[r_k−1(x)]. Since the degree is a nonnegative integer, and since it decreases with every step, the Euclidean algorithm concludes in a finite number of steps. The last nonzero remainder is the greatest common divisor of the original two polynomials, a(x) and b(x).^[137]

For example, consider the following two quartic polynomials, which each factor into two quadratic polynomials

Dividing a(x) by b(x) yields a remainder r₀(x) = x³ + (2/3)x² + (5/3)x − (2/3). In the next step, b(x) is divided by r₀(x) yielding a remainder r₁(x) = x² + x + 2. Finally, dividing r₀(x) by r₁(x) yields a zero remainder, indicating that r₁(x) is the greatest common divisor polynomial of a(x) and b(x), consistent with their factorization.

Many of the applications described above for integers carry over to polynomials.^[138] The Euclidean algorithm can be used to solve linear Diophantine equations and Chinese remainder problems for polynomials; continued fractions of polynomials can also be defined.

The polynomial Euclidean algorithm has other applications, such as Sturm chains, a method for counting the zeros of a polynomial that lie inside a given real interval.^[139] This in turn has applications in several areas, such as the Routh–Hurwitz stability criterion in control theory.^[140]

Finally, the coefficients of the polynomials need not be drawn from integers, real numbers or even the complex numbers. For example, the coefficients may be drawn from a general field, such as the finite fields GF(p) described above. The corresponding conclusions about the Euclidean algorithm and its applications hold even for such polynomials.^[128]

Gaussian integers[edit]

The Gaussian integers are complex numbers of the form α = u + vi, where u and v are ordinary integers^{[note 2]} and i is the square root of negative one.^[141] By defining an analog of the Euclidean algorithm, Gaussian integers can be shown to be uniquely factorizable, by the argument above.^[42] This unique factorization is helpful in many applications, such as deriving all Pythagorean triples or proving Fermat’s theorem on sums of two squares.^[141] In general, the Euclidean algorithm is convenient in such applications, but not essential; for example, the theorems can often be proven by other arguments.

The Euclidean algorithm developed for two Gaussian integers α and β is nearly the same as that for ordinary integers,^[142] but differs in two respects. As before, we set r₋₂ = α and r₋₁ = β, and the task at each step k is to identify a quotient q_k and a remainder r_k such that

where every remainder is strictly smaller than its predecessor: |r_k| < |r_k−1|. The first difference is that the quotients and remainders are themselves Gaussian integers, and thus are complex numbers. The quotients q_k are generally found by rounding the real and complex parts of the exact ratio (such as the complex number α/β) to the nearest integers.^[142] The second difference lies in the necessity of defining how one complex remainder can be “smaller” than another. To do this, a norm function f(u + vi) = u² + v² is defined, which converts every Gaussian integer u + vi into an ordinary integer. After each step k of the Euclidean algorithm, the norm of the remainder f(r_k) is smaller than the norm of the preceding remainder, f(r_k−1). Since the norm is a nonnegative integer and decreases with every step, the Euclidean algorithm for Gaussian integers ends in a finite number of steps.^[143] The final nonzero remainder is gcd(α, β), the Gaussian integer of largest norm that divides both α and β; it is unique up to multiplication by a unit, ±1 or ±i.^[144]

Many of the other applications of the Euclidean algorithm carry over to Gaussian integers. For example, it can be used to solve linear Diophantine equations and Chinese remainder problems for Gaussian integers;^[145] continued fractions of Gaussian integers can also be defined.^[142]

Euclidean domains[edit]

A set of elements under two binary operations, denoted as addition and multiplication, is called a Euclidean domain if it forms a commutative ring R and, roughly speaking, if a generalized Euclidean algorithm can be performed on them.^[146][147] The two operations of such a ring need not be the addition and multiplication of ordinary arithmetic; rather, they can be more general, such as the operations of a mathematical group or monoid. Nevertheless, these general operations should respect many of the laws governing ordinary arithmetic, such as commutativity, associativity and distributivity.

The generalized Euclidean algorithm requires a Euclidean function, i.e., a mapping f from R into the set of nonnegative integers such that, for any two nonzero elements a and b in R, there exist q and r in R such that a = qb + r and f(r) < f(b).^[148] Examples of such mappings are the absolute value for integers, the degree for univariate polynomials, and the norm for Gaussian integers above.^[149][150] The basic principle is that each step of the algorithm reduces f inexorably; hence, if f can be reduced only a finite number of times, the algorithm must stop in a finite number of steps. This principle relies on the well-ordering property of the non-negative integers, which asserts that every non-empty set of non-negative integers has a smallest member.^[151]

The fundamental theorem of arithmetic applies to any Euclidean domain: Any number from a Euclidean domain can be factored uniquely into irreducible elements. Any Euclidean domain is a unique factorization domain (UFD), although the converse is not true.^[151] The Euclidean domains and the UFD’s are subclasses of the GCD domains, domains in which a greatest common divisor of two numbers always exists.^[152] In other words, a greatest common divisor may exist (for all pairs of elements in a domain), although it may not be possible to find it using a Euclidean algorithm. A Euclidean domain is always a principal ideal domain (PID), an integral domain in which every ideal is a principal ideal.^[153] Again, the converse is not true: not every PID is a Euclidean domain.

The unique factorization of Euclidean domains is useful in many applications. For example, the unique factorization of the Gaussian integers is convenient in deriving formulae for all Pythagorean triples and in proving Fermat’s theorem on sums of two squares.^[141] Unique factorization was also a key element in an attempted proof of Fermat’s Last Theorem published in 1847 by Gabriel Lamé, the same mathematician who analyzed the efficiency of Euclid’s algorithm, based on a suggestion of Joseph Liouville.^[154] Lamé’s approach required the unique factorization of numbers of the form x + ωy, where x and y are integers, and ω = e^2iπ/n is an nth root of 1, that is, ωⁿ = 1. Although this approach succeeds for some values of n (such as n = 3, the Eisenstein integers), in general such numbers do not factor uniquely. This failure of unique factorization in some cyclotomic fields led Ernst Kummer to the concept of ideal numbers and, later, Richard Dedekind to ideals.^[155]

Unique factorization of quadratic integers[edit]

The quadratic integer rings are helpful to illustrate Euclidean domains. Quadratic integers are generalizations of the Gaussian integers in which the imaginary unit i is replaced by a number ω. Thus, they have the form u + vω, where u and v are integers and ω has one of two forms, depending on a parameter D. If D does not equal a multiple of four plus one, then

If, however, D does equal a multiple of four plus one, then

If the function f corresponds to a norm function, such as that used to order the Gaussian integers above, then the domain is known as norm-Euclidean. The norm-Euclidean rings of quadratic integers are exactly those where D is one of the values −11, −7, −3, −2, −1, 2, 3, 5, 6, 7, 11, 13, 17, 19, 21, 29, 33, 37, 41, 57, or 73.^[156][157] The cases D = −1 and D = −3 yield the Gaussian integers and Eisenstein integers, respectively.

If f is allowed to be any Euclidean function, then the list of possible values of D for which the domain is Euclidean is not yet known.^[158] The first example of a Euclidean domain that was not norm-Euclidean (with D = 69) was published in 1994.^[158] In 1973, Weinberger proved that a quadratic integer ring with D > 0 is Euclidean if, and only if, it is a principal ideal domain, provided that the generalized Riemann hypothesis holds.^[129]

Noncommutative rings[edit]

The Euclidean algorithm may be applied to some noncommutative rings such as the set of Hurwitz quaternions.^{[clarification needed][130]} Let α and β represent two elements from such a ring. They have a common right divisor δ if α = ξδ and β = ηδ for some choice of ξ and η in the ring. Similarly, they have a common left divisor if α = dξ and β = dη for some choice of ξ and η in the ring. Since multiplication is not commutative, there are two versions of the Euclidean algorithm, one for right divisors and one for left divisors.^[130] Choosing the right divisors, the first step in finding the gcd(α, β) by the Euclidean algorithm can be written

where ψ₀ represents the quotient and ρ₀ the remainder.^{[clarification needed]} This equation shows that any common right divisor of α and β is likewise a common divisor of the remainder ρ₀. The analogous equation for the left divisors would be

With either choice, the process is repeated as above until the greatest common right or left divisor is identified. As in the Euclidean domain, the “size” of the remainder ρ₀ (formally, its norm) must be strictly smaller than β, and there must be only a finite number of possible sizes for ρ₀, so that the algorithm is guaranteed to terminate.^[159]

Most of the results for the GCD carry over to noncommutative numbers.^{[clarification needed]} For example, Bézout’s identity states that the right gcd(α, β) can be expressed as a linear combination of α and β.^[160] In other words, there are numbers σ and τ such that

The analogous identity for the left GCD is nearly the same:

Bézout’s identity can be used to solve Diophantine equations. For instance, one of the standard proofs of Lagrange’s four-square theorem, that every positive integer can be represented as a sum of four squares, is based on quaternion GCDs in this way.^[159]

See also[edit]

• Euclidean rhythm, a method for using the Euclidean algorithm to generate musical rhythms

Notes[edit]

References[edit]

Bibliography[edit]

• Cohen, H. (1993). A Course in Computational Algebraic Number Theory. New York: Springer-Verlag. ISBN 0-387-55640-0.
• Cohn, H. (1962). Advanced Number Theory. New York: Dover. ISBN 0-486-64023-X.
• Cox, D.; Little, J.; O’Shea, D. (1997). Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra (2nd ed.). Springer-Verlag. ISBN 0-387-94680-2.
• Crandall, R.; Pomerance, C. (2001). Prime Numbers: A Computational Perspective (1st ed.). New York: Springer-Verlag. ISBN 0-387-94777-9.
• Lejeune Dirichlet, P. G. (1894). Dedekind, Richard (ed.). Vorlesungen über Zahlentheorie (Lectures on Number Theory) (in German). Braunschweig: Vieweg. LCCN 03005859. OCLC 490186017.. See also Vorlesungen über Zahlentheorie
• Knuth, D. E. (1997). The Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd ed.). Addison–Wesley. ISBN 0-201-89684-2.
• LeVeque, W. J. (1996) [1977]. Fundamentals of Number Theory. New York: Dover. ISBN 0-486-68906-9.
• Mollin, R. A. (2008). Fundamental Number Theory with Applications (2nd ed.). Boca Raton: Chapman & Hall/CRC. ISBN 978-1-4200-6659-3.
• Ore, O. (1948). Number Theory and Its History. New York: McGraw–Hill.
• Rosen, K. H. (2000). Elementary Number Theory and its Applications (4th ed.). Reading, MA: Addison–Wesley. ISBN 0-201-87073-8.
• Schroeder, M. (2005). Number Theory in Science and Communication (4th ed.). Springer-Verlag. ISBN 0-387-15800-6.
• Stark, H. (1978). An Introduction to Number Theory. MIT Press. ISBN 0-262-69060-8.
• Stillwell, J. (1997). Numbers and Geometry. New York: Springer-Verlag. ISBN 0-387-98289-2.
• Stillwell, J. (2003). Elements of Number Theory. New York: Springer-Verlag. ISBN 0-387-95587-9.
• Tattersall, J. J. (2005). Elementary Number Theory in Nine Chapters. Cambridge: Cambridge University Press. ISBN 978-0-521-85014-8.

External links[edit]

• Demonstrations of Euclid’s algorithm
• Weisstein, Eric W. “Euclidean Algorithm”. MathWorld.
• Euclid’s Algorithm at cut-the-knot
• Euclid’s algorithm at PlanetMath.
• The Euclidean Algorithm at MathPages
• Euclid’s Game at cut-the-knot
• Music and Euclid’s algorithm

Алгоритм Евклида

Для начала разберемся, что это и как это работает. Алгоритм Евклида позволяет найти нам наибольший общий делитель чисел. Как это работает:
Пусть a = 18, b = 30.
Цикл: a!=0 and b!=0
Если a > b, то a = a % b, если меньше, то b = b % a, таким образом мы сначала находим остаток деления, а потом повторяем действия. У нас a < b, значит, ищем остаток деления b % a (30 % 18) = 12, присваиваем b = 12, повторяем цикл но теперь у нас уже a > b(b = 12)
значит выполняем a % b (18 % 12) = 6? снова переходим к циклу, теперь снова b > a, значит выполняем b % a (30 % 6), остаток от деления 0, на этом мы прекращаем наш цикл и узнаем, что наибольший общий делитель 18 и 30 = 6. и выводим a + b (b = 0, a = 6).

Python

#!/usr/bin/env python
a = 18
b = 30
 
while a!=0 and b!=0:
    if a > b:
        a = a % b
    else:
        b = b % a
 
print (a+b)

Perl:

 sub nod
 {
 return  $_[0] != 0  ?  nod ( ( $_[1] % $_[0] ), $_[0] )  :  $_[1];
 }

C:

 int gcd(int a, int b) {
   int c;
   while (b) {
      c = a % b;
      a = b;
      b = c;        
   }
   return abs(a);
 }

Pascal:

  function nod( a, b: longint): longint; 
  begin
   while (a <> 0) and (b <> 0) do
     if a >= b then 
       a:= a mod b 
     else 
       b:= b mod a;
   nod:= a + b;
  end;

Java:

public class GCD {
    public static int gcd(int a,int b) {
        while (b !=0) {
            int tmp = a%b;
            a = b;
            b = tmp;
        }
        return a;
    }
}

C#:

int gcd(int a, int b)
{
    while (b != 0)
        b = a % (a = b);
    return a;
}

Любая сложная задача всегда может быть разбита на несколько простых задач. Те в свою очередь могут быть разбиты на ещё1 более мелкие задачи. В олимпиадных задачах по программированию очень часто требуется найти НОД(наибольший общий делитель) или НОК(наименьшее общее кратное) двух или более чисел. Это может быть задача по фасовке предметам по ящикам (целочисленное деление) или формирование людей в бригады. Короче там где нужно искать целые числа после деления.

Пример двух чисел 6 и 15. Очевидно, что НОД (наибольшим общим делителем) будет число 3. А далее находим НОК (наименьшее) общее кратное). Которое будет равно 30.

Для небольших чисел это легко вычисляется в уме. Но вот с пятиначными числами, так легко не получится. Поэтому предлагаю обратиться к алгоритму Евклида. Математические выкладки и детали в данной статье затрагивать не буду, хотя там много есть интересного.

Но суть достаточно простая. Их двух чисел выбираем большее и аычитаем из него меньшее. Далее выбираем снова большое и вычитаем из него снова, до тех пор пока разница не будет равна одному из чисел. Это и будет искомое число. Предлагаю проверить сперва на очевидных примерха.

Мы с вами уже находили НОД для 6 и 15. И у нас также получилось 3.

Теперь возьмём числа побольше. Я конечно могу сказать, что беру случайные числа, но по факту могы их проверить.

Пусть будут числа 195 и 1450. Очевидно, что они точно деляться на 5, но я предлагаю проверить.

И действительно 195 = 3*5*13, а 1450 = 2*5*5*29.

А теперь рассмотрим как найти НОК (наименьшее общее кратное). Рассмотрим сперва на простом примере. Числа 15 и 6.

Есть такая замечательная формула НОК = (A*B) / НОД.

Теперь проверим это выражение. НОК = (15*6)/3=30.

Оказывается, что всё достаточно просто. Если рассмотреть числа 195 и 1450, то для них НОК будет 195*1450/5=56550 или 2*3*5*5*13*29.

То есть без калькулятора можно свободно найти НОД и НОК. Естественно что для программиста эта задача становится очень простой.

Для начала разберем алгоритм через блок-схему.

Подробнее можно увидеть на видео:

У меня всё, благодарю за внимание.

———————————————————————-

Делюсь другими материалами:

Сериал Дистанционка от коллег в А1: Дистанционка. Серия 1. Дистанционка. Серия 2. Дистанционка. Серия 3.

Материалы по Scratch.