Log in to add a comment

## Answers

it is an efficient method for computing the greatest common divisor of two numbers... the largest number that divides both of them without leaving any remainder.

it states that:

Given two numbers not prime to one another, to find their greatest common measure.

The Brainliest Answer!

it is in the form of a=bq+r

for ex:

let two positive integers be a and b

a=30 and b= 15 than 30=15*2+0