"In mathematics, the Euclidean algorithm, or Euclid's algorithm, is a method for computing the greatest common divisor (GCD) of two (usually positive) integers, also known as the greatest common factor (GCF) or highest common factor (HCF). ...

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.

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.

- Types of Flowcharts | Types of Flowchart - Overview | Basic ...
- Flowchart And Algorithm
- Explain Algorithm And Flowchart With Diagram
- Algorithm Flowchart Diagram
- Explain Algorithm And Flowchart With Example
- Solving quadratic equation algorithm - Flowchart | Types of ...
- Example Of Algorithm And Flowchart Of Discount
- Diagram Flow Chart | Selection sorting method - Algorithm flowchart ...
- Euclidean algorithm - Flowchart | Flow Chart To Elaborate And ...
- Algorithm Flowchart Examples
- Visual Basic Flowchart Examples
- Sample Algorithm And Flowchart
- Basic Flowchart Symbols and Meaning | Process Flowchart | Types ...
- Euclidean algorithm - Flowchart | Euclid Wikipedia
- Basic Flowchart Symbols and Meaning | Flowchart Definition | Types ...
- Euclidean algorithm - Flowchart | Solving quadratic equation ...
- Complex Flow Chart Example
- Solving quadratic equation algorithm - Flowchart
- Define Algorithm And Draw Flow Charts As Descriptive Algorithms
- Basic Flowchart Symbols and Meaning | Audit Flowchart Symbols ...
- ERD | Entity Relationship Diagrams, ERD Software for Mac and Win
- Flowchart | Basic Flowchart Symbols and Meaning
- Flowchart | Flowchart Design - Symbols, Shapes, Stencils and Icons
- Flowchart | Flow Chart Symbols
- Electrical | Electrical Drawing - Wiring and Circuits Schematics
- Flowchart | Common Flowchart Symbols
- Flowchart | Common Flowchart Symbols