UPSKILL MATH PLUS

Learn Mathematics through our AI based learning portal with the support of our Academic Experts!

Learn more
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.]