Use Euclid's division
algorities to fin
d hef of 64,120
Answers
Answered by
1
Answer:
Step-by-step explanation:
Good morning
Answered by
0
By Euclid division algorithm,
a=b*q+r(where,a>b and r<=0)
120=64*1+56
64=56*1+8
56=8*7+0
HCF=8
Similar questions
Math,
2 months ago
Math,
2 months ago
Biology,
2 months ago
Physics,
5 months ago
India Languages,
10 months ago
India Languages,
10 months ago
India Languages,
10 months ago