6265 and 76254
Find HCF by using Euclids division algorithm
Answers
Answered by
1
Answer:
By using Euclids division algorithms
a=bq+r
step1=76254=6265*12+1074
step2=6265=1074*5+895
step3=895*1+179
step4=895=179*5+0
hence, the h. c. f is b=179
Similar questions
Computer Science,
4 months ago
Math,
4 months ago
English,
9 months ago
Math,
9 months ago
Social Sciences,
1 year ago
Math,
1 year ago