Problem Statement
Find the HCF (GCD) of 84 and 210.
Explanation
Use Euclid’s algorithm: 210 mod 84 = 42, and 84 mod 42 = 0. Hence HCF is 42.
HCF is the greatest number dividing both values without remainder.
Code Solution
SolutionRead Only
gcd(210,84) → gcd(84,42) → gcd(42,0) = 42
