The GCD of two positive integers is the largest integer that divides both of them without leaving a remainder (the GCD of two integers in general is defined in a more subtle way).

In its simplest form, Euclid's algorithm starts with a pair of positive integers, and forms a new pair that consists of the smaller number and the difference between the larger and smaller numbers. The process repeats until the numbers in the pair are equal. That number then is the greatest common divisor of the original pair of integers.

The main principle is that the GCD does not change if the smaller number is subtracted from the larger number. ... Since the larger of the two numbers is reduced, repeating this process gives successively smaller numbers, so this repetition will necessarily stop sooner or later - when the numbers are equal (if the process is attempted once more, one of the numbers will become 0)." [Euclidean algorithm. Wikipedia]

The flowchart example "Euclidean algorithm" was created using the ConceptDraw PRO diagramming and vector drawing software extended with the Mathematics solution from the Science and Education area of ConceptDraw Solution Park.

- Flow Chart To Elaborate And Explain Euclid Lemma Division Or
- How To Make A Flowchart On Euclid Division Lemma
- Euclidean algorithm - Flowchart | Process Flowchart | Flow chart ...
- Euclidean algorithm - Flowchart | ConceptDraw PRO | Create Floor ...
- Process Flowchart | Sales Flowcharts | Euclidean algorithm ...
- Division Process Chart
- Process Flowchart | Sales Process Flowchart Symbols | Flow chart ...
- How To Make A Flow Chart Related To Division Two Nbers