find hcf of 1405,1465,1503 using Euclid's division algorithm
Answers
Answered by
2
Euclid's algorithm , a=bq+r
HCF(1405,1465)=
1465=1405×1+60
1405=60×24+25
60=25×2+10
25=10×2+5
10=5×2+0
HCF(1465,1405)=5
HCF(1503,5)
1503=5*300+3
5=3*1+2
3=2*1+1
2=1*2+0
HCF(1405,1465,1503)=1
HENCE THE NUMBERS ARE CO-PRIME.
HOPE IT HELPS
HCF(1405,1465)=
1465=1405×1+60
1405=60×24+25
60=25×2+10
25=10×2+5
10=5×2+0
HCF(1465,1405)=5
HCF(1503,5)
1503=5*300+3
5=3*1+2
3=2*1+1
2=1*2+0
HCF(1405,1465,1503)=1
HENCE THE NUMBERS ARE CO-PRIME.
HOPE IT HELPS
Similar questions