use Euclid division algorithm to find the lcm 135 and 225
Answers
Answered by
0
30375 is a euclid division algorithm
Answered by
0
Euclid's Algorithm is only for finding HCF and not LCM.
So......
By Euclid's algorithm,
225 = 135 x 1 + 90
135 = 90 x 1 + 45
90 = 45 x 2 + 0
Therefore, HCF is 45.
So......
By Euclid's algorithm,
225 = 135 x 1 + 90
135 = 90 x 1 + 45
90 = 45 x 2 + 0
Therefore, HCF is 45.
Similar questions