Question

Find the HCF of the following by using Euclid algorithm
(ii) 96 and 72
​

Answer 1

Answer:

24.

write the sequence by a= bq plus r.

select this answer as a brainliest

Answer 2

Answer:

The GCF of 72 and 96 is 24.

Steps to find GCF

Find the prime factorization of 72

72 = 2 × 2 × 2 × 3 × 3

Find the prime factorization of 96

96 = 2 × 2 × 2 × 2 × 2 × 3

To find the GCF, multiply all the prime factors common to both numbers:

Therefore, GCF = 2 × 2 × 2 × 3

GCF = 24

$❀✿THA᭄NKS★$