0
Anonymous
use the equation
lcm(a,b)=ab/gcd(a,b) gcd = greatest common divisor
gcd(88,56) use euclidean algortihm
88=56x1+32
56=32x1+24
32=24x1+8
24=8x2+0
therefore the gcd is 8.
so
lcm(88,56)= 88x56/8
=616
Wiki User
Chat with our AI personalities