When the stages of the Euclidean method are reversed to represent the biggest motivating divisor of all of these combinations of integer as a linear equation of these integers, equations such as ged (123,2347) = 1 result.
This algorithm is a collection of guidelines for resolving a dilemma or carrying out a task. A recipe, which includes of detailed directions for creating a dish or meal, is a typical illustration of an algorithm.
The ensuing resolution has been produced in a practical, step-by-step fashion.
Step: 1
To find gcd (123,2347)
by Euclidean algorithm
2347 = 19.123 + 10
123 = 12.10 + 3
10 = 3.3 + 1
3 = 3.3 + 0
Therefore , ged (123,2347 ) = 1
reversed to express the greatest coon divisor
1 = 10 - 3.3
1 = 10 - 3.3 . (123 - 12.10 )
1 = 10 - 3.123 + 36.10
1 = 37.10 - 3.123
1 = 37. ( 2347 - 19.123 ) - 3.123
1 = 37.2347 - 703.123 - 3.123
1 = 37.2347 - 706.123
ged (123,2347 ) = 1
To know more about Algorithm visit :
https://brainly.com/question/22984934
#SPJ4
