PDF chapter test TRY NOW

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