Using euclids division algorithm find the HCL of 280,674
Answers
Answered by
4
by Euclid's division algorithm
now again
now again
once again
at last
as the remainder at this stage has become zero so the divisor at this stage is the required HCF
= 2
if you know Euclid's division algorithm you can simply answer this question.
:)
Similar questions