Question

Compute the GCD if 128 and 96 using the Euclidean division method.​

Answer 1

Explanation:

Euclid's division algorithm is a technique to compute the Highest Common Factor (HCF) of two or three given positive integers.

Euclid's division Lemma states that for any two positive integers say a and b there exist two unique whole numbers say q and r ,such that, a = bq+r, where 0≤r<b.

SOLUTION:

On applying euclid's division Lemma for 36 and 96

96 = 36 ×2 + 24

Here, Remainder = 24≠0

So take new Dividend as 36 and divisor a