Question

use Euclid's algorithm to find the HCF of 1651 and 2032​

Answer 1

Question ⤵

use Euclid's algorithm to find the HCF of 1651 and 2032 ?

Answer ⤵

we knew that Euclid's algorithm formula is for finding GCD(A,B) is as follows: If A = 0 then GCD(A,B)=B, since the GCD(0,B)=B, and we can stop. If B = 0 then GCD(A,B)=A, since the GCD(A,0)=A, and we can stop. Write A in quotient remainder form (A = B⋅Q + R).

so we need to apply this law , we get

first let me show you the computations , 1651 and 2032 .

Divide 2032 by 1651 , we get the result 1 with the reminder 381 .

so 2032 = 1.1651 + 381

Divide 1651 by 381 and get the result 4 with reminder 127 .

so 1651 = 4.381 + 127

Hope it helped you