Question

Use euclid division algorithm to find hcf of 960 and 432 and verify prime factorization method

Answer 1

Hi Guys

960=432*2+96

432=96*4+48

96=48*2+0

HCF(960,432)=48

Answer 2

Thank you for asking this question. Here is your answer.

H.C.F of 960 and 432

960 > 432

Here we used Euclid division algorithm.

→ 960 = 432 × 2 + 96  

→ 432 = 96 × 4 + 48

→ 96 = 48 × 2 + 0

 H.C.F = 48

If there is any confusion please leave a comment below.