How many divisions are required to find gcd(l44, 233)

Solution:

Step1

 We have to find how many divisions are required to find gcd(l44, 233) using the Euclidean algorithm?

Step2

By using the Euclidean algorithm( The Euclidean algorithm, is a productive technique for figuring the best regular divisor(GCD) of two numbers, the biggest number that partitions them two without leaving a remainder.It depends on the rule that the best normal divisor of two numbers does not change if the bigger number is supplanted by its distinction with the more modest number.

)

Here Divisor=144

Dividend=233