PDF chapter test TRY NOW

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