Understand the concept
Euclid's algorithm uses repeated division to find greatest common divisor.
HCF of 48 and 18
- Step 1: 48=18×2+12
- Step 2: 18=12×1+6
- Step 3: 12=6×2.
Final answer: 6
HCF of 20 and 12
Show the answer
4
Try another similar question and explain each step aloud. Refer to your school syllabus for topic level and notation.