Question

using Eudid's division algorithm
Find the HCF of 408,128
.brifly answermore step friends stepwise​

Answer 1

Answer:

The Euclidean Algorithm 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)

Find GCD(B,R) using the Euclidean Algorithm since GCD(A,B) = GCD(B,R) these are steps to find try your self pls Mark as brainlist ans

Answer 2

Answer:

the HCF of 408 and 128 is 8 by using EDL