Use Euclid’s Division Algorithm to find the HCF of 726 and 275.

using Euclid’s Division Algorithm, we find HCF of two positive numbers by repetitive division till we get 0 as the remainder.

In the given two numbers 726 and 275, 726 is greater, so we will divide 726 by 275, we get

We see that the remainder is 176≠0,

Now we divide 275 by 176, we get

We see that the remainder is 99≠0,

Now we divide 176 by 99, we get

We see that the remainder is 77≠0

Now we divide 99 by 77, we get,

We see that the remainder is 22≠0

Now we divide 77 by 22, we get,

We see that the remainder is 11≠0,

Now we divide 22 by 11, we get

We see that the remainder is 0.

Hence the HCF of the two numbers 726 and 275 is 11.