Question

Solve the questions bu using Euclid's Division Algorithm. (You have to Find Highest Common Factor).

Questions are in the above picture , so attached. ​

Answer 1

Here ,

We have to find the Highest Common Factor of the given numbers by using Euclid's Division Algorithm.

So , What we have to do is as follows :

• Firstly we must know what Euclid's Division Lemma is :

a = bq+r , 0≤r<b

Then ,

We have to classify given numbers as a and b.

Always consider the greater number as a a while the smaller number as b.

Then , make your steps According to the Euclid's Division Lemma.

Continue this process until the remainder is 0.

And the value of b which makes r = 0 is your required Highest Common Factor.

Your solutions are in the above attachment.

Answer 2

Here is your answer........