answersLogoWhite

0

Find the greatest common divisor

(Using the Euclidean Algorythm)

24 = 9*2 + 6

9 = 6*1 + 3

6 = 3*2

gcd (24,9) = 3

least common multiple = (a*b)/gcd(a,b)

LCM = 216/3 = 72

User Avatar

Wiki User

13y ago

What else can I help you with?