Question

use Euclid algorithim to find the HCF of.. 384 and 1296​

Answer 1

Step-by-step explanation:

hope this helps you. ........

Answer 2

Answer:

48 is the HCF of 384 and 1296.

Step-by-step explanation:

Explanation:

Given that, 384 and 1296.

• The Euclidean algorithm, often known as Euclid's algorithm, is an effective way to determine the largest number that divides two integers without leaving a remainder.

Step 1:

We have, 384 and 1296

               384 ) 1296  ( 3

                         -1152      

                             144) 384 (2

                                   - 288            

                                      96)  144(1

                                            - 96                  

                                                  48 )  96 ( 2

                                                          -96      

                                                            xx

                                                             

This can be written as,

1296 = 384 × 3 +144.

384 =144 × 2 +96.

144 = 96 ×1 +48.

96 =48 × 2 +0.

So, here we can see that, on dividing   96 by 4 the remainder become zero.

Therefore, HCF of 1296 and 384 is 48.

Final answer:

Hence, 48 is the HCF of 384 and 1296.

#SPJ2