find hcf (10000,100000) using euclids division algorithm
Answers
Answered by
1
Answer:
10000
Step-by-step explanation:
100000>10000
according to euclid's division algorithm
a=bq+r where 0 ≤ r < b
100000=1000(10)+0
since remainder is 0 10000 is the HCF
if u find it helpful please mark it as brainliest
Similar questions