Question

Find the H.C.F. of 368 &400 by Ecluid’s division algorithm.

Answer 1

400=368×1+32

368=32×11+16

32=16×2+0

Therefore, 16 is the HCF

Answer 2

$\huge\text{\underline{Answer}}$

Let a = 400 and b = 368

By using Euclid division algorithm

$\boxed{\sf{</strong><strong>a</strong><strong>=</strong><strong> </strong><strong>bq</strong><strong> </strong><strong>+</strong><strong> </strong><strong>r</strong><strong> </strong><strong>}}$

$\implies$ $\bold{400 = 368× 1 + 32 }$

$\implies$ $\bold{368 = 32 × 11 + 16}$

$\implies$ $\bold{32 = 16 × 2 + 0 }$

At this step the remainder is 0 hence the HCF will be 16 .