PDF chapter test TRY NOW

Use Eculid's Division Algorithm to find the Highest Common Factor (HCF) of:
 
10224 and 9648
 
Since  \(>\) , apply Euclid's division lemma.
 
i=i×i+ii=i×i+ii=i×i+ii=i×i+0
 
HCF of 10224 and 9648 \(=\)
 
[Note: Enter the values in the order specified by the division algorithm.]