Question

solve using Euclid's division algorithm.

​

Answer 1

Step-by-step explanation:

Refer to the attachment............................

Euclid Division Algorithm:

In arithmetic, Euclidean division — or division with remainder — is the process of dividing one integer by another, in such a way that produces a quotient and a remainder smaller than the divisor. Its main property is that the quotient and the remainder exist and are unique, under some conditions.

Answer 2

hey mate

here's a clue for your answer

1st of all you must find the HCF of any 2 no. by using the algorithm after this find the HCF of this no. and the remaining number this hcf will be the final answer

hope it helped u