Question

use euclid division algorithm to find HCF 1001 and 385

Answer 1

Answer:

Step-by-step explanation:

a=bq+r where 0<=r <b

1001÷385

=385×2+231

382÷231

=231×1×154

231÷154

=154×1+77

154÷77

=77×2+0

0 has arrived

Divisor is the HCF

So 77 is the HCF

Answer 2

The H.C.F of 1001 and 385 is 77.

Given:

The numbers 1001 and 385.

To Find:

HCF ( 1001 , 385 ) using Euclid's division algorithm.

Solution:

Step 1: Firstly, divide the greater number (here 1001) by the smaller number (here 385).

1001 = 385*2 + 231

Step 2: We see that the remainder, in this case, is non-zero, we will divide the divisor first step (385) by the remainder (231).

385 = 231*1 + 154

Step 3: Repeat the above steps until we obtain the remainder as 0.

231 = 154*1 + 77

154 = 77*2 + 0

The corresponding divisor is 77.

⇒ HCF ( 1001 , 385 ) = 77

∴ The H.C.F of 1001 and 385 is 77.

#SPJ3