# Basic Diagramming

## Basic Diagramming

Mathematics is an exact science, which studies the values, spatial forms and quantitative relations. It is a science, in which is built large number of various diagrams, charts and graphs that present the material in a clear, visual and colorful form, help to analyze the information and to make certain conclusions. A diagram is a graphical representation of data using the linear segments or geometric shapes, which allows to evaluate the ratio of several values. Depending on the types of solved tasks are used the diagrams of different kinds. A graph is a diagram that shows quantitative dependencies of various processes using the curves. ConceptDraw PRO is a powerful intelligent and multifunctional vector engine for drawing different Mathematical diagrams and graphs, Mathematical illustrations, complex and simple Diagram mathematics, Flowcharts of equation solving process, Line graphs, Scatter plots, Histograms, Block diagrams, Bar charts, Divided bar diagrams, Pie charts, Area charts, Circular arrows diagrams, Venn diagrams, Bubble diagrams, Concept maps, and many others. Read moreGET MY CONCEPTDRAW SOFTWARE

"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. Read more

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. Read more

QUICK LINKS

## Accounting Flowcharts

Accounting Flowcharts solution extends ConceptDraw PRO software with templates, samples and library of vector stencils for drawing the accounting flow charts. Read more

QUICK LINKS