Use Euclid's division algorithm to the HCF of 155 and 1385

HELLO,

Given :

• a=155

• b=1385

Since 155<1385 we start with:

1385=155.q+r

Step 2: Perform the Division

1385/155=8 remainder 145

1385=155.8+145

Step 3: Next step with 155 and 145

155+145.1+10

Step 4: Next step with 145 and 10

145=10.14+5

Step 5: Next step with 10 and 5

10=5.2+0

Final Step:

Since the remainder is now 0 the divisor at this step is:

HCF=5

Using Euclid’s Division Algorithm:

1385 = 155*8+145

155 = 145*1+10

145 = 10*14+5

10 = 5*2+0

HCF is 5

Hey !

To find the Highest Common Factor (HCF) of 155 and 1385 using Euclid's Division Algorithm, we follow these steps:

1. Divide 1385 by 155:
   1385 ÷ 155 = 8 (quotient) remainder = 1385 - (155 × 8) = 1385 - 1240 = 145
   So, 1385 = 155 × 8 + 145

2. Now, divide 155 by 145:
   155 ÷ 145 = 1 (quotient) remainder = 155 - (145 × 1) = 155 - 145 = 10
   So, 155 = 145 × 1 + 10

3. Now, divide 145 by 10:
   145 ÷ 10 = 14 (quotient) remainder = 145 - (10 × 14) = 145 - 140 = 5
   So, 145 = 10 × 14 + 5

4. Now, divide 10 by 5:
   10 ÷ 5 = 2 (quotient) remainder = 10 - (5 × 2) = 10 - 10 = 0
   So, 10 = 5 × 2 + 0

Since the remainder is now 0, the divisor at this step (which is 5) is the HCF of 155 and 1385.

Thus, the HCF of 155 and 1385 is 5.

Hope it helps !