Using Euclid's algorithm, find the of and .
The objective is to find the of the given numbers using Euclid's algorithm.
According to Euclid's algorithm,
Where and are the numbers for which needs to be calculated and and are quotient and remainder.
As , this implies that and .
Here, the remainder in the last expression is zero.
Final answer :
Hence, the HCF for the given numbers is 12.