Calculate the greatest common divisor (HCF/GCD) of 84 and 126.
Note
Use prime factorization or Euclid's algorithm: 84 = 2^2 × 3 × 7 and 126 = 2 × 3^2 × 7, so GCD = 2 × 3 × 7 = 42.
Calculate the greatest common divisor (HCF/GCD) of 84 and 126.
Use prime factorization or Euclid's algorithm: 84 = 2^2 × 3 × 7 and 126 = 2 × 3^2 × 7, so GCD = 2 × 3 × 7 = 42.