Find the hcf and lcm 13, 15 and 21 using euclid divison algorithm and prime factorisation
Answers
Answered by
0
Taking the hcf of 13 and 15 first ........
15greater than 13...........
15=13×1+2
13=2×6+1
2=1×2+0
hcf is 1
Taking the hcf of 1 and 21
1 id hcf of the whole
15greater than 13...........
15=13×1+2
13=2×6+1
2=1×2+0
hcf is 1
Taking the hcf of 1 and 21
1 id hcf of the whole
Similar questions