Question

use euclid division lemma( algorithm) to find hcf of 441,567 and 693.​

Answer 1

Answer:

HCF(441,567,693)=63

Step-by-step explanation:

Euclid's division lemma: a=bq+r

a>b, 0≤r<b

let a=567 and b=441

567=441*1+126

441=126*3+63

126=63*1+63

63=63*1+0

HCF(441,567)=63

let a=693, b=63

693=63*11+0

HCF(693,63)= 63

Therefore, HCF (441,567,693)= 63