Question

Using Euclid division algorithm, find the HCF of 252 and 594.

Hint:

Use the remainder repeatedly until it becomes zero to find HCF.

Answer 1

Using Euclid’s algorithm:
\[ \text{Step 1: Divide } 594 \text{ by } 252. \] \[ 594 \div 252 = 2 \text{ remainder } 90. \] \[ \text{Step 2: Divide } 252 \text{ by } 90. \] \[ 252 \div 90 = 2 \text{ remainder } 72. \] \[ \text{Step 3: Divide } 90 \text{ by } 72. \] \[ 90 \div 72 = 1 \text{ remainder } 18. \] \[ \text{Step 4: Divide } 72 \text{ by } 18. \] \[ 72 \div 18 = 4 \text{ remainder } 0. \] Since remainder is 0, HCF = 18.