Using Euclid's algorithm, find the HCF of .
Solution:
Step 1: Stating Euclid's algorithm:
Given numbers are and .
Euclid's algorithm: For any two positive integers and , there exist two unique integers and such that . Here, .
Step 2: Use Euclid's algorithm for
Step 3: Use Euclid's algorithm for
Step 4: Use Euclid's algorithm for
Step 5: Use Euclid's algorithm for
Final answer: Hence, by using Euclid's algorithm the HCF of and is obtained as .