use Euclid's division algorithm to find the hcf of 441,567 and 693.plz answer properly ..
Answers
Answered by
1
As i know, Euclid's division algorithm works on only two positive number.... but here are three no. ..... i.e. 441, 567 and 693... how it is possible.. i think ur question is wrong..
Kunnuraj:
its impossible
we can do it prime factorization... but by euclid division method... it is impossible..
aapne hi to teen ke chaar no. krdie h :))
nhi... wo no..
4,441,567... pura ek no. hai..
chlo chhoddo mai kl sir se hi poochlungi
aise kaise..
The question is correct I guess ?
I have found the answer
it is 63
Similar questions