# Difference between revisions of "Euclidean algorithm"

m (Changed an equal sign to a not equal sign) |
(→Introductory) |
||

(9 intermediate revisions by 7 users not shown) | |||

Line 4: | Line 4: | ||

The basic idea is to repeatedly use the fact that <math>\gcd({a,b}) \equiv \gcd({b,a - b})</math> | The basic idea is to repeatedly use the fact that <math>\gcd({a,b}) \equiv \gcd({b,a - b})</math> | ||

− | If we have two non-negative integers <math>a,b</math> with <math>a | + | If we have two non-negative integers <math>a,b</math> with <math>a|b</math> and <math>b\ne0</math>, then the greatest common divisor is <math>{a}</math>. If <math>a\ge b>0</math>, then the set of common divisors of <math>{a}</math> and <math>b</math> is the same as the set of common divisors of <math>b</math> and <math>r</math> where <math>r</math> is the [[remainder]] of division of <math>{a}</math> by <math>b</math>. Indeed, we have <math>a=mb+r</math> with some integer <math>m</math>, so, if <math>{d}</math> divides both <math>{a}</math> and <math>b</math>, it must divide both <math>{a}</math> and <math>mb</math> and, thereby, their difference <math>r</math>. Similarly, if <math>{d}</math> divides both <math>b</math> and <math>r</math>, it should divide <math>{a}</math> as well. Thus, the greatest common divisors of <math>{a}</math> and <math>b</math> and of <math>b</math> and <math>r</math> coincide: <math>GCD(a,b)=GCD(b,r)</math>. But the pair <math>(b,r)</math> consists of smaller numbers than the pair <math>(a,b)</math>! So, we reduced our task to a simpler one. And we can do this reduction again and again until the smaller number becomes <math>0</math>. |

== General Form == | == General Form == | ||

Line 14: | Line 14: | ||

<math>a \pmod{b} \equiv r_1</math><br> | <math>a \pmod{b} \equiv r_1</math><br> | ||

− | <math>b | + | <math>b \pmod {r_1} \equiv r_2</math><br> |

<math> \vdots</math> <br> | <math> \vdots</math> <br> | ||

− | <math>r_{n-1} | + | <math>r_{n-1} \pmod r_n \equiv 0</math><br> |

Then <math>\gcd({a,b}) = r_n</math><br> | Then <math>\gcd({a,b}) = r_n</math><br> | ||

Line 26: | Line 26: | ||

<math>r_1 = r_2 \cdot q_3 + r_3</math><br> | <math>r_1 = r_2 \cdot q_3 + r_3</math><br> | ||

<math>\vdots</math><br> | <math>\vdots</math><br> | ||

− | <math>r_{n-1} = r_n \cdot q_{n+ | + | <math>r_{n-1} = r_n \cdot q_{n+1} +0</math><br> |

and so <math>\gcd({a,b}) = r_n</math><br> | and so <math>\gcd({a,b}) = r_n</math><br> | ||

Line 67: | Line 67: | ||

== Problems == | == Problems == | ||

===Introductory=== | ===Introductory=== | ||

+ | |||

===Intermediate=== | ===Intermediate=== | ||

* [[1985 AIME Problems/Problem 13]] | * [[1985 AIME Problems/Problem 13]] |

## Latest revision as of 16:21, 6 August 2020

The **Euclidean algorithm** (also known as the **Euclidean division algorithm** or **Euclid's algorithm**) is an algorithm that finds the greatest common divisor (GCD) of two elements of a Euclidean domain, the most common of which is the nonnegative integers , without factoring them.

## Contents

## Main idea and Informal Description

The basic idea is to repeatedly use the fact that

If we have two non-negative integers with and , then the greatest common divisor is . If , then the set of common divisors of and is the same as the set of common divisors of and where is the remainder of division of by . Indeed, we have with some integer , so, if divides both and , it must divide both and and, thereby, their difference . Similarly, if divides both and , it should divide as well. Thus, the greatest common divisors of and and of and coincide: . But the pair consists of smaller numbers than the pair ! So, we reduced our task to a simpler one. And we can do this reduction again and again until the smaller number becomes .

## General Form

Start with any two elements and of a Euclidean Domain

- If , then .
- Otherwise take the remainder when is divided by , and find .
- Repeat this until the remainder is 0.

Then

Usually the Euclidean algorithm is written down just as a chain of divisions with remainder:

for

and so

## Example

To see how it works, just take an example. Say .

We have , so .

Similarly, , so .

Continuing, , so .

Then , so .

Thus .

## Extended Euclidean Algorithm

An added bonus of the Euclidean algorithm is the "linear representation" of the greatest common divisor. This allows us to write , where are some elements from the same Euclidean Domain as and that can be determined using the algorithm. We can work backwards from whichever step is the most convenient.

Continuing the previous example, our goal is to find and such that We can work backwards from equation since appears there:

We currently have as a linear combination of and . Our goal is to replace and so that we have a linear combination of and only. We start by rearranging to so we can substitute to express as a linear combination of and :

Continuing, we rearrange to substitute :

We have found one linear combination. To find others, since , dividing both sides by gives . We can add times this equation to , so we can write as a linear combination of and

for any integer .

## Problems

### Introductory

### Intermediate

- 1985 AIME Problems/Problem 13
- 1959 IMO Problems/Problem 1 (Note: this problem is widely regarded as the easiest problem ever asked in the IMO)