Question

find HCF using Euclid algorithm
30,32 and 160,52,15?​

Answer 1

Answer:

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

Step-by-step explanation:

7344=1260×5+1044

⟹1260=1044×1+216

⟹1044=216×4+180

⟹216=180×1+36

⟹180=36×5+0

So by Euclid's algorithm

HCF of 1260 and 7344 is 36.

Like the upper example one u can do yours questions answer.

Answer 2

Answer:

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

Step-by-step explanation:

7344-1260x5+1044

1260-1044x1+216

1044-216×4+180

→216-180×1+36

-180-36x5+0

So by Euclid's algorithm

HCF of 1260 and 7344 is 36.

Like the upper example one u can do yours questions answer.